./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 75f71671f83387eb35a445031d63abe79f5c0c7c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:01:59,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:01:59,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:01:59,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:01:59,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:01:59,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:01:59,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:01:59,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:01:59,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:01:59,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:01:59,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:01:59,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:01:59,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:01:59,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:01:59,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:01:59,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:01:59,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:01:59,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:01:59,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:01:59,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:01:59,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:01:59,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:01:59,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:01:59,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:01:59,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:01:59,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:01:59,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:01:59,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:01:59,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:01:59,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:01:59,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:01:59,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:01:59,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:01:59,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:01:59,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:01:59,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:01:59,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:01:59,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:01:59,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:01:59,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:01:59,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:01:59,740 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:01:59,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:01:59,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:01:59,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:01:59,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:01:59,778 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:01:59,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:01:59,781 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:01:59,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:01:59,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:01:59,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:01:59,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:01:59,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:01:59,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:01:59,782 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:01:59,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:01:59,782 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:01:59,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:01:59,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:01:59,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:01:59,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:01:59,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:01:59,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:01:59,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:01:59,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:01:59,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:01:59,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:01:59,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:01:59,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:01:59,787 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 75f71671f83387eb35a445031d63abe79f5c0c7c [2019-11-28 00:02:00,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:02:00,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:02:00,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:02:00,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:02:00,104 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:02:00,105 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-28 00:02:00,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad326088e/58fcac4ced694662836d6d4f42483565/FLAG86257718d [2019-11-28 00:02:00,594 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:02:00,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-28 00:02:00,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad326088e/58fcac4ced694662836d6d4f42483565/FLAG86257718d [2019-11-28 00:02:00,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad326088e/58fcac4ced694662836d6d4f42483565 [2019-11-28 00:02:00,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:02:00,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:02:00,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:00,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:02:00,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:02:00,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:00" (1/1) ... [2019-11-28 00:02:00,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4f4d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:00, skipping insertion in model container [2019-11-28 00:02:00,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:00" (1/1) ... [2019-11-28 00:02:00,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:02:00,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:02:01,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:01,264 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:02:01,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:01,368 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:02:01,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01 WrapperNode [2019-11-28 00:02:01,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:01,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:01,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:02:01,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:02:01,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,392 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:01,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:02:01,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:02:01,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:02:01,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... [2019-11-28 00:02:01,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:02:01,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:02:01,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:02:01,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:02:01,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:02:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:02:01,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:02:01,933 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:02:01,933 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:02:01,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:01 BoogieIcfgContainer [2019-11-28 00:02:01,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:02:01,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:02:01,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:02:01,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:02:01,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:02:00" (1/3) ... [2019-11-28 00:02:01,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741e72e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:01, skipping insertion in model container [2019-11-28 00:02:01,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:01" (2/3) ... [2019-11-28 00:02:01,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741e72e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:01, skipping insertion in model container [2019-11-28 00:02:01,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:01" (3/3) ... [2019-11-28 00:02:01,942 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-11-28 00:02:01,952 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:02:01,959 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-28 00:02:01,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-28 00:02:02,000 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:02:02,000 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:02:02,000 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:02:02,000 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:02:02,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:02:02,001 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:02:02,001 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:02:02,001 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:02:02,019 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-11-28 00:02:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 00:02:02,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:02,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:02,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:02,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2019-11-28 00:02:02,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:02,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117855602] [2019-11-28 00:02:02,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,236 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-28 00:02:02,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117855602] [2019-11-28 00:02:02,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:02,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:02,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436306693] [2019-11-28 00:02:02,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:02,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:02,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:02,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:02,266 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-11-28 00:02:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:02,459 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-11-28 00:02:02,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:02,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 00:02:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:02,476 INFO L225 Difference]: With dead ends: 128 [2019-11-28 00:02:02,476 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 00:02:02,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 00:02:02,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2019-11-28 00:02:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-28 00:02:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-28 00:02:02,528 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2019-11-28 00:02:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:02,530 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-28 00:02:02,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-28 00:02:02,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 00:02:02,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:02,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:02,533 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:02,535 INFO L82 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2019-11-28 00:02:02,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:02,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346281706] [2019-11-28 00:02:02,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,600 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-28 00:02:02,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346281706] [2019-11-28 00:02:02,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:02,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:02,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751616713] [2019-11-28 00:02:02,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:02,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:02,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:02,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:02,605 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-11-28 00:02:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:02,700 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-11-28 00:02:02,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:02,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 00:02:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:02,704 INFO L225 Difference]: With dead ends: 107 [2019-11-28 00:02:02,704 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 00:02:02,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 00:02:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2019-11-28 00:02:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 00:02:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-28 00:02:02,715 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2019-11-28 00:02:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:02,716 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-28 00:02:02,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-28 00:02:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:02:02,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:02,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:02,718 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2019-11-28 00:02:02,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:02,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299994823] [2019-11-28 00:02:02,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:02,821 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-28 00:02:02,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299994823] [2019-11-28 00:02:02,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:02,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:02,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603704286] [2019-11-28 00:02:02,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:02,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:02,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:02,826 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-11-28 00:02:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:02,922 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-11-28 00:02:02,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:02,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 00:02:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:02,924 INFO L225 Difference]: With dead ends: 67 [2019-11-28 00:02:02,924 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 00:02:02,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 00:02:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 00:02:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 00:02:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-28 00:02:02,932 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2019-11-28 00:02:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:02,932 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-28 00:02:02,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-28 00:02:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:02:02,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:02,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:02,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:02,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2019-11-28 00:02:02,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:02,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286495710] [2019-11-28 00:02:02,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,007 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-28 00:02:03,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286495710] [2019-11-28 00:02:03,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:03,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712012880] [2019-11-28 00:02:03,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:03,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:03,010 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-11-28 00:02:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,106 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-11-28 00:02:03,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:03,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-28 00:02:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,108 INFO L225 Difference]: With dead ends: 67 [2019-11-28 00:02:03,108 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 00:02:03,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 00:02:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-11-28 00:02:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 00:02:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-28 00:02:03,115 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2019-11-28 00:02:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,116 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-28 00:02:03,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-28 00:02:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:03,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,117 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,117 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:03,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2019-11-28 00:02:03,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381597079] [2019-11-28 00:02:03,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,191 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-28 00:02:03,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381597079] [2019-11-28 00:02:03,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:03,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242021567] [2019-11-28 00:02:03,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:03,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:03,194 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-28 00:02:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,264 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-28 00:02:03,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:03,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 00:02:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,266 INFO L225 Difference]: With dead ends: 65 [2019-11-28 00:02:03,267 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 00:02:03,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 00:02:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-28 00:02:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 00:02:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-28 00:02:03,279 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2019-11-28 00:02:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,283 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-28 00:02:03,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-28 00:02:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:03,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,285 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2019-11-28 00:02:03,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609298598] [2019-11-28 00:02:03,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,382 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-28 00:02:03,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609298598] [2019-11-28 00:02:03,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:03,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334061339] [2019-11-28 00:02:03,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:03,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:03,385 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-11-28 00:02:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,496 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-11-28 00:02:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:03,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 00:02:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,498 INFO L225 Difference]: With dead ends: 94 [2019-11-28 00:02:03,499 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 00:02:03,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 00:02:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 57. [2019-11-28 00:02:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-28 00:02:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2019-11-28 00:02:03,505 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2019-11-28 00:02:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,506 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2019-11-28 00:02:03,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2019-11-28 00:02:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:03,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,507 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2019-11-28 00:02:03,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173132431] [2019-11-28 00:02:03,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,589 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-28 00:02:03,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173132431] [2019-11-28 00:02:03,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:03,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629542475] [2019-11-28 00:02:03,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:03,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:03,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:03,598 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 5 states. [2019-11-28 00:02:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,709 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-28 00:02:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:03,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 00:02:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,710 INFO L225 Difference]: With dead ends: 99 [2019-11-28 00:02:03,710 INFO L226 Difference]: Without dead ends: 97 [2019-11-28 00:02:03,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-28 00:02:03,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2019-11-28 00:02:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 00:02:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-28 00:02:03,717 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2019-11-28 00:02:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,718 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-28 00:02:03,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-28 00:02:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 00:02:03,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,719 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:03,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,720 INFO L82 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2019-11-28 00:02:03,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117863223] [2019-11-28 00:02:03,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,754 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-28 00:02:03,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117863223] [2019-11-28 00:02:03,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:03,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603403662] [2019-11-28 00:02:03,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:03,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:03,757 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-11-28 00:02:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:03,810 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-28 00:02:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:03,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 00:02:03,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:03,812 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:02:03,812 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:02:03,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:02:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-11-28 00:02:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 00:02:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-28 00:02:03,817 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2019-11-28 00:02:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:03,817 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-28 00:02:03,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-28 00:02:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:03,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:03,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:03,819 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:03,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2019-11-28 00:02:03,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:03,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145459265] [2019-11-28 00:02:03,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:03,903 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-28 00:02:03,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145459265] [2019-11-28 00:02:03,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:03,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:03,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073137477] [2019-11-28 00:02:03,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:03,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:03,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:03,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:03,907 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-11-28 00:02:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,025 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-11-28 00:02:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:04,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 00:02:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,027 INFO L225 Difference]: With dead ends: 82 [2019-11-28 00:02:04,027 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:02:04,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:02:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2019-11-28 00:02:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 00:02:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-28 00:02:04,033 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2019-11-28 00:02:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,033 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-28 00:02:04,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-28 00:02:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:04,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,036 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2019-11-28 00:02:04,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722738738] [2019-11-28 00:02:04,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,140 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-28 00:02:04,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722738738] [2019-11-28 00:02:04,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:04,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128392281] [2019-11-28 00:02:04,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:04,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:04,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:04,143 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-11-28 00:02:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,272 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2019-11-28 00:02:04,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:04,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 00:02:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,275 INFO L225 Difference]: With dead ends: 86 [2019-11-28 00:02:04,275 INFO L226 Difference]: Without dead ends: 84 [2019-11-28 00:02:04,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-28 00:02:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2019-11-28 00:02:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:02:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-28 00:02:04,284 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-11-28 00:02:04,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,286 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-28 00:02:04,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-28 00:02:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:04,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,290 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2019-11-28 00:02:04,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819285752] [2019-11-28 00:02:04,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:02:04,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819285752] [2019-11-28 00:02:04,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:04,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045529274] [2019-11-28 00:02:04,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:04,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:04,358 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-11-28 00:02:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,446 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2019-11-28 00:02:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:04,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 00:02:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,448 INFO L225 Difference]: With dead ends: 66 [2019-11-28 00:02:04,448 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 00:02:04,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 00:02:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2019-11-28 00:02:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 00:02:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-28 00:02:04,454 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 13 [2019-11-28 00:02:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,455 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-28 00:02:04,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-28 00:02:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 00:02:04,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,457 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2019-11-28 00:02:04,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371329876] [2019-11-28 00:02:04,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,545 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-28 00:02:04,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371329876] [2019-11-28 00:02:04,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:04,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279871207] [2019-11-28 00:02:04,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:04,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:04,547 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-11-28 00:02:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,612 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-28 00:02:04,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:04,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-28 00:02:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,613 INFO L225 Difference]: With dead ends: 47 [2019-11-28 00:02:04,613 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 00:02:04,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:04,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 00:02:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-11-28 00:02:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 00:02:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-28 00:02:04,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 13 [2019-11-28 00:02:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,621 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-28 00:02:04,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-28 00:02:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:04,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,623 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2019-11-28 00:02:04,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841843285] [2019-11-28 00:02:04,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,676 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-28 00:02:04,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841843285] [2019-11-28 00:02:04,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:04,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632276047] [2019-11-28 00:02:04,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:04,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:04,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:04,679 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-11-28 00:02:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,778 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-28 00:02:04,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:04,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 00:02:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,779 INFO L225 Difference]: With dead ends: 59 [2019-11-28 00:02:04,779 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:02:04,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:02:04,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-11-28 00:02:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:02:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 00:02:04,784 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-11-28 00:02:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,784 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 00:02:04,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 00:02:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:04,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,785 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2019-11-28 00:02:04,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430931273] [2019-11-28 00:02:04,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:04,842 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-28 00:02:04,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430931273] [2019-11-28 00:02:04,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:04,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:04,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44336577] [2019-11-28 00:02:04,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:04,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:04,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:04,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:04,844 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-11-28 00:02:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:04,925 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-28 00:02:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:04,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 00:02:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:04,927 INFO L225 Difference]: With dead ends: 61 [2019-11-28 00:02:04,927 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 00:02:04,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 00:02:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-11-28 00:02:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:02:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 00:02:04,933 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-11-28 00:02:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:04,933 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 00:02:04,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 00:02:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 00:02:04,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:04,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:04,934 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2019-11-28 00:02:04,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:04,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445127416] [2019-11-28 00:02:04,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,001 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-28 00:02:05,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445127416] [2019-11-28 00:02:05,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:05,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35320665] [2019-11-28 00:02:05,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:05,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:05,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:05,003 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-28 00:02:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,063 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-11-28 00:02:05,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:05,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 00:02:05,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,064 INFO L225 Difference]: With dead ends: 39 [2019-11-28 00:02:05,064 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:02:05,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:02:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 00:02:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:02:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-28 00:02:05,067 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2019-11-28 00:02:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,068 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-28 00:02:05,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-28 00:02:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:02:05,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,069 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2019-11-28 00:02:05,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165807563] [2019-11-28 00:02:05,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,140 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-28 00:02:05,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165807563] [2019-11-28 00:02:05,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:05,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805139200] [2019-11-28 00:02:05,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:05,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:05,143 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-11-28 00:02:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,222 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2019-11-28 00:02:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:05,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-28 00:02:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,223 INFO L225 Difference]: With dead ends: 50 [2019-11-28 00:02:05,223 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 00:02:05,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 00:02:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2019-11-28 00:02:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:02:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-28 00:02:05,227 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2019-11-28 00:02:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,227 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-28 00:02:05,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-28 00:02:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:02:05,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,228 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2019-11-28 00:02:05,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542219822] [2019-11-28 00:02:05,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,275 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-28 00:02:05,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542219822] [2019-11-28 00:02:05,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:05,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065921921] [2019-11-28 00:02:05,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:05,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:05,276 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-11-28 00:02:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,370 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-28 00:02:05,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:05,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 00:02:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,375 INFO L225 Difference]: With dead ends: 52 [2019-11-28 00:02:05,375 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 00:02:05,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:02:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 00:02:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-11-28 00:02:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 00:02:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-28 00:02:05,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2019-11-28 00:02:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,382 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-28 00:02:05,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-28 00:02:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:02:05,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:05,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:05,385 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:05,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2019-11-28 00:02:05,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:05,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665253468] [2019-11-28 00:02:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:05,416 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-28 00:02:05,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665253468] [2019-11-28 00:02:05,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:05,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:05,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790747386] [2019-11-28 00:02:05,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:05,418 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-11-28 00:02:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:05,461 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-28 00:02:05,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:05,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 00:02:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:05,461 INFO L225 Difference]: With dead ends: 33 [2019-11-28 00:02:05,461 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:02:05,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:02:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:02:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:02:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:02:05,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-28 00:02:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:05,463 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:02:05,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:02:05,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:02:05,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:02:05,774 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-11-28 00:02:05,774 INFO L246 CegarLoopResult]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-11-28 00:02:05,774 INFO L246 CegarLoopResult]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-11-28 00:02:05,774 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-11-28 00:02:05,775 INFO L246 CegarLoopResult]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-11-28 00:02:05,775 INFO L246 CegarLoopResult]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-11-28 00:02:05,777 INFO L246 CegarLoopResult]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-11-28 00:02:05,777 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-11-28 00:02:05,777 INFO L246 CegarLoopResult]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-11-28 00:02:05,777 INFO L246 CegarLoopResult]: For program point L292(line 292) no Hoare annotation was computed. [2019-11-28 00:02:05,777 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-28 00:02:05,777 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:02:05,777 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:02:05,778 INFO L246 CegarLoopResult]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-11-28 00:02:05,778 INFO L249 CegarLoopResult]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-11-28 00:02:05,779 INFO L246 CegarLoopResult]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-11-28 00:02:05,779 INFO L246 CegarLoopResult]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-11-28 00:02:05,779 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-11-28 00:02:05,779 INFO L246 CegarLoopResult]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-11-28 00:02:05,780 INFO L246 CegarLoopResult]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-11-28 00:02:05,780 INFO L246 CegarLoopResult]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-11-28 00:02:05,780 INFO L246 CegarLoopResult]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-11-28 00:02:05,782 INFO L246 CegarLoopResult]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-11-28 00:02:05,782 INFO L246 CegarLoopResult]: For program point L219(line 219) no Hoare annotation was computed. [2019-11-28 00:02:05,782 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-11-28 00:02:05,782 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-28 00:02:05,783 INFO L242 CegarLoopResult]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-28 00:02:05,783 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-28 00:02:05,783 INFO L246 CegarLoopResult]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-11-28 00:02:05,783 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-11-28 00:02:05,784 INFO L246 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-28 00:02:05,784 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-11-28 00:02:05,784 INFO L246 CegarLoopResult]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-11-28 00:02:05,784 INFO L246 CegarLoopResult]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-11-28 00:02:05,784 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-28 00:02:05,785 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-11-28 00:02:05,785 INFO L246 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-28 00:02:05,785 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-28 00:02:05,785 INFO L246 CegarLoopResult]: For program point L361(line 361) no Hoare annotation was computed. [2019-11-28 00:02:05,785 INFO L246 CegarLoopResult]: For program point L328(line 328) no Hoare annotation was computed. [2019-11-28 00:02:05,786 INFO L246 CegarLoopResult]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-11-28 00:02:05,786 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-11-28 00:02:05,786 INFO L246 CegarLoopResult]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-11-28 00:02:05,786 INFO L246 CegarLoopResult]: For program point L304(line 304) no Hoare annotation was computed. [2019-11-28 00:02:05,787 INFO L246 CegarLoopResult]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-11-28 00:02:05,787 INFO L246 CegarLoopResult]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-11-28 00:02:05,787 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-11-28 00:02:05,787 INFO L249 CegarLoopResult]: At program point L395(lines 10 397) the Hoare annotation is: true [2019-11-28 00:02:05,787 INFO L246 CegarLoopResult]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-11-28 00:02:05,788 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:02:05,788 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-11-28 00:02:05,788 INFO L242 CegarLoopResult]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-28 00:02:05,788 INFO L242 CegarLoopResult]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-28 00:02:05,789 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-11-28 00:02:05,789 INFO L246 CegarLoopResult]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-11-28 00:02:05,789 INFO L246 CegarLoopResult]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-11-28 00:02:05,789 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-28 00:02:05,789 INFO L246 CegarLoopResult]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-11-28 00:02:05,790 INFO L246 CegarLoopResult]: For program point L231(line 231) no Hoare annotation was computed. [2019-11-28 00:02:05,790 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:02:05,790 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-11-28 00:02:05,790 INFO L242 CegarLoopResult]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-11-28 00:02:05,790 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-28 00:02:05,791 INFO L246 CegarLoopResult]: For program point L273(line 273) no Hoare annotation was computed. [2019-11-28 00:02:05,791 INFO L246 CegarLoopResult]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-11-28 00:02:05,791 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-28 00:02:05,792 INFO L246 CegarLoopResult]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-11-28 00:02:05,792 INFO L246 CegarLoopResult]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-11-28 00:02:05,792 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-11-28 00:02:05,792 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-11-28 00:02:05,792 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-28 00:02:05,793 INFO L246 CegarLoopResult]: For program point L373(line 373) no Hoare annotation was computed. [2019-11-28 00:02:05,793 INFO L246 CegarLoopResult]: For program point L340(line 340) no Hoare annotation was computed. [2019-11-28 00:02:05,793 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-28 00:02:05,793 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-11-28 00:02:05,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:02:05 BoogieIcfgContainer [2019-11-28 00:02:05,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:02:05,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:02:05,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:02:05,827 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:02:05,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:01" (3/4) ... [2019-11-28 00:02:05,832 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:02:05,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 00:02:05,854 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:02:05,976 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:02:05,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:02:05,979 INFO L168 Benchmark]: Toolchain (without parser) took 5035.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -78.2 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:05,979 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:02:05,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:05,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.12 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-28 00:02:05,980 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 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-28 00:02:05,981 INFO L168 Benchmark]: RCFGBuilder took 484.86 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: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:05,981 INFO L168 Benchmark]: TraceAbstraction took 3890.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.6 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:05,981 INFO L168 Benchmark]: Witness Printer took 150.06 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: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:05,983 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 425.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.12 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 27.04 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 484.86 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: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3890.59 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.6 MB). Peak memory consumption was 104.4 MB. Max. memory is 11.5 GB. * Witness Printer took 150.06 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: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 18 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 773 SDtfs, 1307 SDslu, 740 SDs, 0 SdLazy, 1080 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 54 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 40 HoareAnnotationTreeSize, 6 FomulaSimplifications, 285942 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1102 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 7087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...