./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5107685577f81a5867811396b2c0a05eb5630c95 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:11:35,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:11:35,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:11:35,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:11:35,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:11:35,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:11:35,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:11:35,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:11:35,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:11:35,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:11:35,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:11:35,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:11:35,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:11:35,463 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:11:35,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:11:35,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:11:35,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:11:35,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:11:35,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:11:35,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:11:35,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:11:35,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:11:35,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:11:35,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:11:35,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:11:35,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:11:35,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:11:35,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:11:35,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:11:35,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:11:35,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:11:35,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:11:35,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:11:35,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:11:35,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:11:35,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:11:35,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:11:35,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:11:35,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:11:35,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:11:35,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:11:35,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:11:35,519 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:11:35,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:11:35,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:11:35,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:11:35,520 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:11:35,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:11:35,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:11:35,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:11:35,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:11:35,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:11:35,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:11:35,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:11:35,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:11:35,522 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:11:35,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:11:35,522 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:11:35,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:11:35,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:11:35,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:11:35,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:11:35,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:11:35,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:11:35,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:11:35,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:11:35,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:11:35,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:11:35,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:11:35,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:11:35,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-11-20 03:11:35,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:11:35,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:11:35,729 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:11:35,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:11:35,731 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:11:35,733 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_9.c [2019-11-20 03:11:35,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/data/790b16f4d/d7d69819c15c4b86a0174be750c0cb1a/FLAGe0312b033 [2019-11-20 03:11:36,176 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:11:36,176 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/sv-benchmarks/c/locks/test_locks_9.c [2019-11-20 03:11:36,181 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/data/790b16f4d/d7d69819c15c4b86a0174be750c0cb1a/FLAGe0312b033 [2019-11-20 03:11:36,529 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/data/790b16f4d/d7d69819c15c4b86a0174be750c0cb1a [2019-11-20 03:11:36,531 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:11:36,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:11:36,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:11:36,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:11:36,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:11:36,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b77f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36, skipping insertion in model container [2019-11-20 03:11:36,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,552 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:11:36,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:11:36,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:11:36,795 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:11:36,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:11:36,903 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:11:36,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36 WrapperNode [2019-11-20 03:11:36,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:11:36,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:11:36,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:11:36,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:11:36,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:11:36,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:11:36,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:11:36,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:11:36,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... [2019-11-20 03:11:36,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:11:36,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:11:36,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:11:36,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:11:36,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/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-11-20 03:11:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:11:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:11:37,352 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:11:37,352 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 03:11:37,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:11:37 BoogieIcfgContainer [2019-11-20 03:11:37,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:11:37,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:11:37,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:11:37,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:11:37,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:11:36" (1/3) ... [2019-11-20 03:11:37,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ee11e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:11:37, skipping insertion in model container [2019-11-20 03:11:37,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:11:36" (2/3) ... [2019-11-20 03:11:37,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ee11e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:11:37, skipping insertion in model container [2019-11-20 03:11:37,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:11:37" (3/3) ... [2019-11-20 03:11:37,370 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-11-20 03:11:37,379 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:11:37,385 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:11:37,395 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:11:37,416 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:11:37,416 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:11:37,417 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:11:37,417 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:11:37,417 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:11:37,417 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:11:37,417 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:11:37,418 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:11:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-20 03:11:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:11:37,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:37,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:37,439 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1076851140, now seen corresponding path program 1 times [2019-11-20 03:11:37,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:37,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096012333] [2019-11-20 03:11:37,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:37,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096012333] [2019-11-20 03:11:37,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:37,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:37,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588266567] [2019-11-20 03:11:37,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:37,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:37,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:37,633 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-11-20 03:11:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:37,699 INFO L93 Difference]: Finished difference Result 76 states and 132 transitions. [2019-11-20 03:11:37,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:37,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 03:11:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:37,716 INFO L225 Difference]: With dead ends: 76 [2019-11-20 03:11:37,716 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 03:11:37,720 INFO L630 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-11-20 03:11:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 03:11:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-11-20 03:11:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 03:11:37,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2019-11-20 03:11:37,761 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2019-11-20 03:11:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:37,762 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2019-11-20 03:11:37,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2019-11-20 03:11:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:11:37,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:37,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:37,763 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1335016578, now seen corresponding path program 1 times [2019-11-20 03:11:37,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:37,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624741477] [2019-11-20 03:11:37,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:37,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624741477] [2019-11-20 03:11:37,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:37,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:37,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599739093] [2019-11-20 03:11:37,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:37,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:37,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:37,812 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand 3 states. [2019-11-20 03:11:37,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:37,846 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2019-11-20 03:11:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:37,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 03:11:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:37,848 INFO L225 Difference]: With dead ends: 103 [2019-11-20 03:11:37,848 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 03:11:37,850 INFO L630 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-11-20 03:11:37,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 03:11:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-20 03:11:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 03:11:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2019-11-20 03:11:37,858 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2019-11-20 03:11:37,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:37,858 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2019-11-20 03:11:37,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2019-11-20 03:11:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:11:37,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:37,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:37,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash -977139357, now seen corresponding path program 1 times [2019-11-20 03:11:37,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:37,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57658282] [2019-11-20 03:11:37,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:37,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:37,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57658282] [2019-11-20 03:11:37,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:37,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:37,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509953523] [2019-11-20 03:11:37,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:37,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:37,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:37,903 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 3 states. [2019-11-20 03:11:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:37,938 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2019-11-20 03:11:37,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:37,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 03:11:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:37,941 INFO L225 Difference]: With dead ends: 95 [2019-11-20 03:11:37,941 INFO L226 Difference]: Without dead ends: 65 [2019-11-20 03:11:37,942 INFO L630 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-11-20 03:11:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-20 03:11:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-20 03:11:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 03:11:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2019-11-20 03:11:37,952 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2019-11-20 03:11:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:37,953 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2019-11-20 03:11:37,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2019-11-20 03:11:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:11:37,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:37,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:37,955 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1563945371, now seen corresponding path program 1 times [2019-11-20 03:11:37,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:37,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864558970] [2019-11-20 03:11:37,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864558970] [2019-11-20 03:11:38,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247441818] [2019-11-20 03:11:38,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,008 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand 3 states. [2019-11-20 03:11:38,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,038 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-11-20 03:11:38,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 03:11:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,040 INFO L225 Difference]: With dead ends: 120 [2019-11-20 03:11:38,041 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 03:11:38,041 INFO L630 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-11-20 03:11:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 03:11:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2019-11-20 03:11:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 03:11:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2019-11-20 03:11:38,053 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2019-11-20 03:11:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,054 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2019-11-20 03:11:38,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,054 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2019-11-20 03:11:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 03:11:38,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,056 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1305779933, now seen corresponding path program 1 times [2019-11-20 03:11:38,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683496110] [2019-11-20 03:11:38,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,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-11-20 03:11:38,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683496110] [2019-11-20 03:11:38,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013045724] [2019-11-20 03:11:38,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,096 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand 3 states. [2019-11-20 03:11:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,123 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2019-11-20 03:11:38,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 03:11:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,125 INFO L225 Difference]: With dead ends: 200 [2019-11-20 03:11:38,126 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 03:11:38,131 INFO L630 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-11-20 03:11:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 03:11:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-11-20 03:11:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-20 03:11:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2019-11-20 03:11:38,156 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2019-11-20 03:11:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,156 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2019-11-20 03:11:38,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2019-11-20 03:11:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:11:38,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,161 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1237452233, now seen corresponding path program 1 times [2019-11-20 03:11:38,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14760719] [2019-11-20 03:11:38,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14760719] [2019-11-20 03:11:38,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406851893] [2019-11-20 03:11:38,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,211 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand 3 states. [2019-11-20 03:11:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,228 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2019-11-20 03:11:38,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 03:11:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,230 INFO L225 Difference]: With dead ends: 179 [2019-11-20 03:11:38,230 INFO L226 Difference]: Without dead ends: 122 [2019-11-20 03:11:38,231 INFO L630 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-11-20 03:11:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-20 03:11:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-20 03:11:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 03:11:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2019-11-20 03:11:38,240 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2019-11-20 03:11:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,241 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2019-11-20 03:11:38,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2019-11-20 03:11:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:11:38,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1824258247, now seen corresponding path program 1 times [2019-11-20 03:11:38,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210778655] [2019-11-20 03:11:38,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210778655] [2019-11-20 03:11:38,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709354298] [2019-11-20 03:11:38,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,316 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand 3 states. [2019-11-20 03:11:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,347 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2019-11-20 03:11:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 03:11:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,349 INFO L225 Difference]: With dead ends: 344 [2019-11-20 03:11:38,350 INFO L226 Difference]: Without dead ends: 230 [2019-11-20 03:11:38,351 INFO L630 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-11-20 03:11:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-20 03:11:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2019-11-20 03:11:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-20 03:11:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2019-11-20 03:11:38,367 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2019-11-20 03:11:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,368 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2019-11-20 03:11:38,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2019-11-20 03:11:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 03:11:38,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2082423685, now seen corresponding path program 1 times [2019-11-20 03:11:38,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044008435] [2019-11-20 03:11:38,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044008435] [2019-11-20 03:11:38,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610356829] [2019-11-20 03:11:38,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,419 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand 3 states. [2019-11-20 03:11:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,448 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2019-11-20 03:11:38,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-20 03:11:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,451 INFO L225 Difference]: With dead ends: 288 [2019-11-20 03:11:38,451 INFO L226 Difference]: Without dead ends: 286 [2019-11-20 03:11:38,452 INFO L630 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-11-20 03:11:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-20 03:11:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2019-11-20 03:11:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-20 03:11:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2019-11-20 03:11:38,473 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2019-11-20 03:11:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,474 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2019-11-20 03:11:38,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2019-11-20 03:11:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:11:38,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,480 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,481 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash -717216456, now seen corresponding path program 1 times [2019-11-20 03:11:38,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857706615] [2019-11-20 03:11:38,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857706615] [2019-11-20 03:11:38,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340476264] [2019-11-20 03:11:38,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,537 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand 3 states. [2019-11-20 03:11:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,569 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-11-20 03:11:38,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 03:11:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,572 INFO L225 Difference]: With dead ends: 420 [2019-11-20 03:11:38,573 INFO L226 Difference]: Without dead ends: 418 [2019-11-20 03:11:38,573 INFO L630 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-11-20 03:11:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-20 03:11:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2019-11-20 03:11:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-20 03:11:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2019-11-20 03:11:38,593 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2019-11-20 03:11:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,593 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2019-11-20 03:11:38,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2019-11-20 03:11:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:11:38,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,596 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -459051018, now seen corresponding path program 1 times [2019-11-20 03:11:38,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178351520] [2019-11-20 03:11:38,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178351520] [2019-11-20 03:11:38,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299713471] [2019-11-20 03:11:38,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,628 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand 3 states. [2019-11-20 03:11:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,648 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2019-11-20 03:11:38,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 03:11:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,652 INFO L225 Difference]: With dead ends: 756 [2019-11-20 03:11:38,652 INFO L226 Difference]: Without dead ends: 442 [2019-11-20 03:11:38,653 INFO L630 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-11-20 03:11:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-11-20 03:11:38,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-11-20 03:11:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-20 03:11:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2019-11-20 03:11:38,671 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2019-11-20 03:11:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,678 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2019-11-20 03:11:38,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2019-11-20 03:11:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 03:11:38,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash -758658962, now seen corresponding path program 1 times [2019-11-20 03:11:38,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801634466] [2019-11-20 03:11:38,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801634466] [2019-11-20 03:11:38,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480546258] [2019-11-20 03:11:38,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,730 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand 3 states. [2019-11-20 03:11:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,756 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2019-11-20 03:11:38,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 03:11:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,759 INFO L225 Difference]: With dead ends: 668 [2019-11-20 03:11:38,760 INFO L226 Difference]: Without dead ends: 454 [2019-11-20 03:11:38,760 INFO L630 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-11-20 03:11:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-20 03:11:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2019-11-20 03:11:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-20 03:11:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2019-11-20 03:11:38,783 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2019-11-20 03:11:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,783 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2019-11-20 03:11:38,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2019-11-20 03:11:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 03:11:38,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,785 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1345464976, now seen corresponding path program 1 times [2019-11-20 03:11:38,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856929782] [2019-11-20 03:11:38,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856929782] [2019-11-20 03:11:38,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845979516] [2019-11-20 03:11:38,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,827 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand 3 states. [2019-11-20 03:11:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,857 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2019-11-20 03:11:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 03:11:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,864 INFO L225 Difference]: With dead ends: 808 [2019-11-20 03:11:38,865 INFO L226 Difference]: Without dead ends: 806 [2019-11-20 03:11:38,865 INFO L630 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-11-20 03:11:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-11-20 03:11:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2019-11-20 03:11:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-20 03:11:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2019-11-20 03:11:38,888 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2019-11-20 03:11:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:38,888 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2019-11-20 03:11:38,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2019-11-20 03:11:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 03:11:38,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:38,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:38,894 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:38,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1087299538, now seen corresponding path program 1 times [2019-11-20 03:11:38,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:38,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762227668] [2019-11-20 03:11:38,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:38,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762227668] [2019-11-20 03:11:38,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:38,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:38,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945671592] [2019-11-20 03:11:38,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:38,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:38,930 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand 3 states. [2019-11-20 03:11:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:38,969 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2019-11-20 03:11:38,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:38,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 03:11:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:38,975 INFO L225 Difference]: With dead ends: 1496 [2019-11-20 03:11:38,976 INFO L226 Difference]: Without dead ends: 870 [2019-11-20 03:11:38,977 INFO L630 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-11-20 03:11:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-11-20 03:11:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2019-11-20 03:11:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-11-20 03:11:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2019-11-20 03:11:39,011 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2019-11-20 03:11:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:39,012 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2019-11-20 03:11:39,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2019-11-20 03:11:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 03:11:39,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:39,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:39,018 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:39,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:39,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1240473739, now seen corresponding path program 1 times [2019-11-20 03:11:39,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:39,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780388897] [2019-11-20 03:11:39,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:39,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780388897] [2019-11-20 03:11:39,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:39,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:39,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513904400] [2019-11-20 03:11:39,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:39,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:39,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:39,065 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand 3 states. [2019-11-20 03:11:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:39,095 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2019-11-20 03:11:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:39,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 03:11:39,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:39,100 INFO L225 Difference]: With dead ends: 1304 [2019-11-20 03:11:39,100 INFO L226 Difference]: Without dead ends: 886 [2019-11-20 03:11:39,101 INFO L630 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-11-20 03:11:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-11-20 03:11:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2019-11-20 03:11:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-11-20 03:11:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2019-11-20 03:11:39,133 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2019-11-20 03:11:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:39,134 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2019-11-20 03:11:39,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2019-11-20 03:11:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 03:11:39,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:39,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:39,136 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash 653667725, now seen corresponding path program 1 times [2019-11-20 03:11:39,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:39,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165389167] [2019-11-20 03:11:39,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:39,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165389167] [2019-11-20 03:11:39,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:39,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:39,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188580223] [2019-11-20 03:11:39,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:39,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:39,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:39,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:39,175 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand 3 states. [2019-11-20 03:11:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:39,216 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2019-11-20 03:11:39,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:39,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 03:11:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:39,225 INFO L225 Difference]: With dead ends: 1544 [2019-11-20 03:11:39,225 INFO L226 Difference]: Without dead ends: 1542 [2019-11-20 03:11:39,227 INFO L630 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-11-20 03:11:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-11-20 03:11:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2019-11-20 03:11:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-11-20 03:11:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2019-11-20 03:11:39,271 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2019-11-20 03:11:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:39,271 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2019-11-20 03:11:39,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2019-11-20 03:11:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 03:11:39,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:39,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:39,275 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:39,275 INFO L82 PathProgramCache]: Analyzing trace with hash 911833163, now seen corresponding path program 1 times [2019-11-20 03:11:39,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:39,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551894366] [2019-11-20 03:11:39,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:39,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551894366] [2019-11-20 03:11:39,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:39,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:39,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144654084] [2019-11-20 03:11:39,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:39,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:39,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:39,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:39,299 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand 3 states. [2019-11-20 03:11:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:39,341 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2019-11-20 03:11:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:39,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 03:11:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:39,351 INFO L225 Difference]: With dead ends: 2952 [2019-11-20 03:11:39,351 INFO L226 Difference]: Without dead ends: 1702 [2019-11-20 03:11:39,353 INFO L630 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-11-20 03:11:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-11-20 03:11:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2019-11-20 03:11:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-11-20 03:11:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2019-11-20 03:11:39,410 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2019-11-20 03:11:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:39,410 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2019-11-20 03:11:39,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2019-11-20 03:11:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:11:39,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:39,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:39,413 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1210921629, now seen corresponding path program 1 times [2019-11-20 03:11:39,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:39,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136859178] [2019-11-20 03:11:39,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:39,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136859178] [2019-11-20 03:11:39,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:39,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:39,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060545444] [2019-11-20 03:11:39,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:39,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:39,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:39,433 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand 3 states. [2019-11-20 03:11:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:39,485 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2019-11-20 03:11:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:39,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 03:11:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:39,494 INFO L225 Difference]: With dead ends: 2552 [2019-11-20 03:11:39,495 INFO L226 Difference]: Without dead ends: 1734 [2019-11-20 03:11:39,496 INFO L630 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-11-20 03:11:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-11-20 03:11:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-11-20 03:11:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-11-20 03:11:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2019-11-20 03:11:39,547 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2019-11-20 03:11:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:39,548 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2019-11-20 03:11:39,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2019-11-20 03:11:39,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:11:39,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:39,551 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:39,551 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:39,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:39,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1797727643, now seen corresponding path program 1 times [2019-11-20 03:11:39,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:39,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956497232] [2019-11-20 03:11:39,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:39,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956497232] [2019-11-20 03:11:39,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:39,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:39,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761205801] [2019-11-20 03:11:39,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:39,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:39,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:39,571 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand 3 states. [2019-11-20 03:11:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:39,623 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2019-11-20 03:11:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:39,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 03:11:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:39,638 INFO L225 Difference]: With dead ends: 2952 [2019-11-20 03:11:39,639 INFO L226 Difference]: Without dead ends: 2950 [2019-11-20 03:11:39,640 INFO L630 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-11-20 03:11:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-11-20 03:11:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2019-11-20 03:11:39,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-11-20 03:11:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2019-11-20 03:11:39,707 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2019-11-20 03:11:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:39,708 INFO L462 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2019-11-20 03:11:39,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2019-11-20 03:11:39,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:11:39,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:39,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:39,712 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1539562205, now seen corresponding path program 1 times [2019-11-20 03:11:39,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:39,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866810010] [2019-11-20 03:11:39,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:39,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866810010] [2019-11-20 03:11:39,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:39,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:39,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434526281] [2019-11-20 03:11:39,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:39,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:39,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:39,733 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand 3 states. [2019-11-20 03:11:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:39,801 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2019-11-20 03:11:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:39,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 03:11:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:39,818 INFO L225 Difference]: With dead ends: 5832 [2019-11-20 03:11:39,818 INFO L226 Difference]: Without dead ends: 3334 [2019-11-20 03:11:39,822 INFO L630 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-11-20 03:11:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-11-20 03:11:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2019-11-20 03:11:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-20 03:11:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2019-11-20 03:11:39,923 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2019-11-20 03:11:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:39,924 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2019-11-20 03:11:39,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2019-11-20 03:11:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:11:39,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:39,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:39,928 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 105233632, now seen corresponding path program 1 times [2019-11-20 03:11:39,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:39,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031646569] [2019-11-20 03:11:39,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:39,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-11-20 03:11:39,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031646569] [2019-11-20 03:11:39,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:39,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:39,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319804726] [2019-11-20 03:11:39,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:39,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:39,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:39,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:39,956 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand 3 states. [2019-11-20 03:11:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:40,023 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2019-11-20 03:11:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:40,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 03:11:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:40,041 INFO L225 Difference]: With dead ends: 5000 [2019-11-20 03:11:40,041 INFO L226 Difference]: Without dead ends: 3398 [2019-11-20 03:11:40,044 INFO L630 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-11-20 03:11:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-20 03:11:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2019-11-20 03:11:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2019-11-20 03:11:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2019-11-20 03:11:40,150 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2019-11-20 03:11:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:40,150 INFO L462 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2019-11-20 03:11:40,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2019-11-20 03:11:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:11:40,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:40,155 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:40,155 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash -481572382, now seen corresponding path program 1 times [2019-11-20 03:11:40,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:40,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533854689] [2019-11-20 03:11:40,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:40,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:40,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533854689] [2019-11-20 03:11:40,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:40,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:40,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342732440] [2019-11-20 03:11:40,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:40,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:40,175 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand 3 states. [2019-11-20 03:11:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:40,273 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2019-11-20 03:11:40,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:40,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 03:11:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:40,327 INFO L225 Difference]: With dead ends: 5640 [2019-11-20 03:11:40,327 INFO L226 Difference]: Without dead ends: 5638 [2019-11-20 03:11:40,329 INFO L630 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-11-20 03:11:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-11-20 03:11:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2019-11-20 03:11:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-11-20 03:11:40,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2019-11-20 03:11:40,559 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2019-11-20 03:11:40,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:40,559 INFO L462 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2019-11-20 03:11:40,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2019-11-20 03:11:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 03:11:40,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:40,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:11:40,566 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash -223406944, now seen corresponding path program 1 times [2019-11-20 03:11:40,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:40,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130530417] [2019-11-20 03:11:40,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:40,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130530417] [2019-11-20 03:11:40,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:40,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:40,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162937951] [2019-11-20 03:11:40,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:40,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:40,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:40,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:40,587 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand 3 states. [2019-11-20 03:11:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:40,706 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2019-11-20 03:11:40,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:40,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 03:11:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:40,717 INFO L225 Difference]: With dead ends: 11528 [2019-11-20 03:11:40,717 INFO L226 Difference]: Without dead ends: 6534 [2019-11-20 03:11:40,723 INFO L630 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-11-20 03:11:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-11-20 03:11:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2019-11-20 03:11:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-11-20 03:11:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2019-11-20 03:11:40,894 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2019-11-20 03:11:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:40,894 INFO L462 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2019-11-20 03:11:40,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2019-11-20 03:11:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:11:40,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:40,902 INFO L410 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] [2019-11-20 03:11:40,904 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2043625896, now seen corresponding path program 1 times [2019-11-20 03:11:40,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:40,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935777698] [2019-11-20 03:11:40,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:40,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935777698] [2019-11-20 03:11:40,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:40,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:40,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876734507] [2019-11-20 03:11:40,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:40,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:40,921 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand 3 states. [2019-11-20 03:11:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:41,033 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2019-11-20 03:11:41,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:41,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 03:11:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:41,043 INFO L225 Difference]: With dead ends: 9800 [2019-11-20 03:11:41,043 INFO L226 Difference]: Without dead ends: 6662 [2019-11-20 03:11:41,048 INFO L630 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-11-20 03:11:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2019-11-20 03:11:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2019-11-20 03:11:41,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-20 03:11:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2019-11-20 03:11:41,222 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2019-11-20 03:11:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:41,223 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2019-11-20 03:11:41,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2019-11-20 03:11:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:11:41,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:41,231 INFO L410 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] [2019-11-20 03:11:41,231 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1664535386, now seen corresponding path program 1 times [2019-11-20 03:11:41,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:41,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995904733] [2019-11-20 03:11:41,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:11:41,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995904733] [2019-11-20 03:11:41,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:41,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:41,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174644517] [2019-11-20 03:11:41,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:41,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:41,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:41,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:41,257 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand 3 states. [2019-11-20 03:11:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:41,412 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2019-11-20 03:11:41,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:41,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 03:11:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:41,431 INFO L225 Difference]: With dead ends: 10758 [2019-11-20 03:11:41,431 INFO L226 Difference]: Without dead ends: 10756 [2019-11-20 03:11:41,435 INFO L630 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-11-20 03:11:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-11-20 03:11:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2019-11-20 03:11:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-11-20 03:11:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2019-11-20 03:11:41,687 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2019-11-20 03:11:41,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:41,688 INFO L462 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2019-11-20 03:11:41,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2019-11-20 03:11:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 03:11:41,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:11:41,702 INFO L410 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] [2019-11-20 03:11:41,702 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:11:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:11:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1922700824, now seen corresponding path program 1 times [2019-11-20 03:11:41,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:11:41,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625818559] [2019-11-20 03:11:41,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:11:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:11:41,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-11-20 03:11:41,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625818559] [2019-11-20 03:11:41,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:11:41,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:11:41,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355144572] [2019-11-20 03:11:41,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:11:41,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:11:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:11:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:11:41,717 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand 3 states. [2019-11-20 03:11:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:11:41,895 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2019-11-20 03:11:41,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:11:41,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 03:11:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:11:41,895 INFO L225 Difference]: With dead ends: 22788 [2019-11-20 03:11:41,896 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:11:41,914 INFO L630 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-11-20 03:11:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:11:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:11:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:11:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:11:41,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-20 03:11:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:11:41,915 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:11:41,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:11:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:11:41,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:11:41,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:11:41,934 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,934 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,935 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L447 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,936 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,937 INFO L447 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-11-20 03:11:41,937 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,937 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,937 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-11-20 03:11:41,937 INFO L447 ceAbstractionStarter]: At program point L148(lines 4 149) the Hoare annotation is: true [2019-11-20 03:11:41,937 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 03:11:41,937 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-20 03:11:41,937 INFO L440 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-11-20 03:11:41,937 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,938 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:11:41,938 INFO L444 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,938 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 03:11:41,938 INFO L444 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-20 03:11:41,938 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,938 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-11-20 03:11:41,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:11:41 BoogieIcfgContainer [2019-11-20 03:11:41,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:11:41,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:11:41,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:11:41,947 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:11:41,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:11:37" (3/4) ... [2019-11-20 03:11:41,950 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:11:41,963 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 03:11:41,964 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:11:42,045 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e7238328-c7f9-4149-8ed2-3920dae653be/bin/uautomizer/witness.graphml [2019-11-20 03:11:42,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:11:42,047 INFO L168 Benchmark]: Toolchain (without parser) took 5514.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -60.8 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:42,048 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:11:42,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:42,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:11:42,049 INFO L168 Benchmark]: Boogie Preprocessor took 46.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:11:42,049 INFO L168 Benchmark]: RCFGBuilder took 357.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:42,050 INFO L168 Benchmark]: TraceAbstraction took 4592.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.4 MB). Peak memory consumption was 136.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:42,050 INFO L168 Benchmark]: Witness Printer took 98.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:42,053 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -182.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 357.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4592.55 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.4 MB). Peak memory consumption was 136.9 MB. Max. memory is 11.5 GB. * Witness Printer took 98.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 4.5s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1841 SDtfs, 922 SDslu, 1207 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 correct! Received shutdown request...