./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/SpamAssassin-loop.i.v+cfa-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 5daa60820c0033439eb2fc136c4a16d466a909bc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:06:01,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:06:01,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:06:01,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:06:01,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:06:01,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:06:01,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:06:01,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:06:01,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:06:01,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:06:01,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:06:01,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:06:01,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:06:01,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:06:01,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:06:01,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:06:01,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:06:01,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:06:01,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:06:01,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:06:01,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:06:01,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:06:01,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:06:01,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:06:01,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:06:01,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:06:01,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:06:01,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:06:01,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:06:01,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:06:01,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:06:01,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:06:01,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:06:01,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:06:01,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:06:01,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:06:01,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:06:01,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:06:01,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:06:01,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:06:01,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:06:01,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:06:01,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:06:01,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:06:01,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:06:01,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:06:01,438 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:06:01,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:06:01,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:06:01,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:06:01,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:06:01,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:06:01,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:06:01,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:06:01,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:06:01,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:06:01,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:06:01,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:06:01,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:06:01,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:06:01,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:06:01,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:06:01,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:06:01,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:01,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:06:01,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:06:01,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:06:01,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:06:01,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:06:01,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:06:01,447 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:06:01,447 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 -> 5daa60820c0033439eb2fc136c4a16d466a909bc [2019-11-28 17:06:01,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:06:01,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:06:01,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:06:01,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:06:01,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:06:01,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-28 17:06:01,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8b20bcc/09837ffe274347728a3df08f607b8ca8/FLAG118a10e36 [2019-11-28 17:06:02,300 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:06:02,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-28 17:06:02,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8b20bcc/09837ffe274347728a3df08f607b8ca8/FLAG118a10e36 [2019-11-28 17:06:02,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8b20bcc/09837ffe274347728a3df08f607b8ca8 [2019-11-28 17:06:02,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:06:02,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:06:02,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:02,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:06:02,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:06:02,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:02" (1/1) ... [2019-11-28 17:06:02,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f492a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:02, skipping insertion in model container [2019-11-28 17:06:02,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:02" (1/1) ... [2019-11-28 17:06:02,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:06:02,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:06:03,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:03,010 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:06:03,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:03,183 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:06:03,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03 WrapperNode [2019-11-28 17:06:03,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:03,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:03,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:06:03,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:06:03,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:03,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:06:03,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:06:03,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:06:03,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (1/1) ... [2019-11-28 17:06:03,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:06:03,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:06:03,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:06:03,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:06:03,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (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 17:06:03,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:06:03,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:06:03,758 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:06:03,758 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:06:03,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:03 BoogieIcfgContainer [2019-11-28 17:06:03,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:06:03,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:06:03,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:06:03,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:06:03,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:06:02" (1/3) ... [2019-11-28 17:06:03,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3900b76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:03, skipping insertion in model container [2019-11-28 17:06:03,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:03" (2/3) ... [2019-11-28 17:06:03,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3900b76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:03, skipping insertion in model container [2019-11-28 17:06:03,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:03" (3/3) ... [2019-11-28 17:06:03,768 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-28 17:06:03,778 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:06:03,784 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 17:06:03,793 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 17:06:03,819 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:06:03,819 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:06:03,819 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:06:03,820 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:06:03,820 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:06:03,820 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:06:03,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:06:03,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:06:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-28 17:06:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:06:03,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:03,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:03,850 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2019-11-28 17:06:03,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:03,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078773955] [2019-11-28 17:06:03,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:04,027 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 17:06:04,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078773955] [2019-11-28 17:06:04,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:04,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:06:04,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402229642] [2019-11-28 17:06:04,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:06:04,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:04,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:06:04,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:06:04,048 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2019-11-28 17:06:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:04,081 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2019-11-28 17:06:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:06:04,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 17:06:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:04,094 INFO L225 Difference]: With dead ends: 83 [2019-11-28 17:06:04,094 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 17:06:04,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:06:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 17:06:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2019-11-28 17:06:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 17:06:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-28 17:06:04,138 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2019-11-28 17:06:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:04,138 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-28 17:06:04,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:06:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-28 17:06:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:06:04,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:04,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:04,141 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:04,141 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2019-11-28 17:06:04,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:04,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714135188] [2019-11-28 17:06:04,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:04,200 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 17:06:04,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714135188] [2019-11-28 17:06:04,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:04,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:04,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803093455] [2019-11-28 17:06:04,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:04,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:04,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:04,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:04,205 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2019-11-28 17:06:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:04,315 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-11-28 17:06:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:04,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 17:06:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:04,317 INFO L225 Difference]: With dead ends: 73 [2019-11-28 17:06:04,318 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:06:04,319 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 17:06:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:06:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2019-11-28 17:06:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:06:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-28 17:06:04,330 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2019-11-28 17:06:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:04,330 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-28 17:06:04,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-28 17:06:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:06:04,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:04,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:04,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2019-11-28 17:06:04,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:04,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066658179] [2019-11-28 17:06:04,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:04,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066658179] [2019-11-28 17:06:04,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:04,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:04,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34923829] [2019-11-28 17:06:04,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:04,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:04,421 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2019-11-28 17:06:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:04,519 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2019-11-28 17:06:04,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:04,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 17:06:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:04,522 INFO L225 Difference]: With dead ends: 143 [2019-11-28 17:06:04,522 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 17:06:04,523 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 17:06:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 17:06:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-11-28 17:06:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-28 17:06:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-28 17:06:04,533 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2019-11-28 17:06:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:04,534 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-28 17:06:04,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-28 17:06:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:06:04,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:04,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:04,535 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:04,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:04,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2019-11-28 17:06:04,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:04,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741125979] [2019-11-28 17:06:04,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:04,572 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 17:06:04,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741125979] [2019-11-28 17:06:04,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:04,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:04,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996244688] [2019-11-28 17:06:04,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:04,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:04,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:04,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:04,575 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-11-28 17:06:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:04,671 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2019-11-28 17:06:04,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:04,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 17:06:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:04,673 INFO L225 Difference]: With dead ends: 92 [2019-11-28 17:06:04,673 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 17:06:04,674 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 17:06:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 17:06:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2019-11-28 17:06:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 17:06:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-28 17:06:04,682 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2019-11-28 17:06:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:04,682 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-28 17:06:04,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-28 17:06:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:06:04,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:04,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:04,685 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2019-11-28 17:06:04,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:04,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264583176] [2019-11-28 17:06:04,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:04,810 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 17:06:04,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264583176] [2019-11-28 17:06:04,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:04,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:04,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770856484] [2019-11-28 17:06:04,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:04,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:04,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:04,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:04,814 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-28 17:06:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:04,919 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-28 17:06:04,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:04,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 17:06:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:04,923 INFO L225 Difference]: With dead ends: 69 [2019-11-28 17:06:04,923 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 17:06:04,923 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 17:06:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 17:06:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2019-11-28 17:06:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 17:06:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-28 17:06:04,942 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2019-11-28 17:06:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:04,942 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-28 17:06:04,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-28 17:06:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 17:06:04,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:04,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:04,946 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2019-11-28 17:06:04,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:04,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841160369] [2019-11-28 17:06:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:05,000 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 17:06:05,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841160369] [2019-11-28 17:06:05,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:05,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:05,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972396512] [2019-11-28 17:06:05,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:05,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:05,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:05,003 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-11-28 17:06:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:05,124 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2019-11-28 17:06:05,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:05,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 17:06:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:05,126 INFO L225 Difference]: With dead ends: 87 [2019-11-28 17:06:05,126 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 17:06:05,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 17:06:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2019-11-28 17:06:05,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 17:06:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-28 17:06:05,135 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2019-11-28 17:06:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:05,135 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-28 17:06:05,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:05,136 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-28 17:06:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:06:05,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:05,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:05,137 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:05,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:05,138 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2019-11-28 17:06:05,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:05,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372019048] [2019-11-28 17:06:05,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:05,221 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 17:06:05,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372019048] [2019-11-28 17:06:05,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:05,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:05,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360416919] [2019-11-28 17:06:05,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:05,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:05,223 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-28 17:06:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:05,382 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2019-11-28 17:06:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:05,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 17:06:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:05,383 INFO L225 Difference]: With dead ends: 75 [2019-11-28 17:06:05,383 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 17:06:05,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 17:06:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-11-28 17:06:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 17:06:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-28 17:06:05,391 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2019-11-28 17:06:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:05,391 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-28 17:06:05,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-28 17:06:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:06:05,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:05,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:05,393 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:05,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2019-11-28 17:06:05,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:05,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97810385] [2019-11-28 17:06:05,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:05,447 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 17:06:05,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97810385] [2019-11-28 17:06:05,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:05,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:05,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516452560] [2019-11-28 17:06:05,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:05,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:05,450 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-11-28 17:06:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:05,515 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-11-28 17:06:05,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:05,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 17:06:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:05,517 INFO L225 Difference]: With dead ends: 83 [2019-11-28 17:06:05,517 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 17:06:05,518 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 17:06:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 17:06:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2019-11-28 17:06:05,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:06:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-28 17:06:05,525 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2019-11-28 17:06:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:05,525 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-28 17:06:05,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-28 17:06:05,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 17:06:05,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:05,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:05,527 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:05,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2019-11-28 17:06:05,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:05,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115589145] [2019-11-28 17:06:05,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:05,623 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 17:06:05,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115589145] [2019-11-28 17:06:05,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:05,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:06:05,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452160129] [2019-11-28 17:06:05,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:06:05,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:06:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:05,626 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2019-11-28 17:06:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:05,781 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-28 17:06:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:05,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-28 17:06:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:05,786 INFO L225 Difference]: With dead ends: 62 [2019-11-28 17:06:05,786 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 17:06:05,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:06:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 17:06:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-11-28 17:06:05,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:06:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-28 17:06:05,794 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2019-11-28 17:06:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:05,795 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-28 17:06:05,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:06:05,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-28 17:06:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:06:05,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:05,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:05,797 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:05,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2019-11-28 17:06:05,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:05,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177132281] [2019-11-28 17:06:05,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:05,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177132281] [2019-11-28 17:06:05,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:05,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:05,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277055443] [2019-11-28 17:06:05,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:05,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:05,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:05,883 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2019-11-28 17:06:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:05,938 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-28 17:06:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:05,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 17:06:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:05,942 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:06:05,943 INFO L226 Difference]: Without dead ends: 55 [2019-11-28 17:06:05,945 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 17:06:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-28 17:06:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-11-28 17:06:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:06:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-28 17:06:05,960 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2019-11-28 17:06:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:05,963 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-28 17:06:05,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-28 17:06:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:06:05,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:05,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:05,967 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2019-11-28 17:06:05,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:05,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396257804] [2019-11-28 17:06:05,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,064 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 17:06:06,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396257804] [2019-11-28 17:06:06,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:06,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910324726] [2019-11-28 17:06:06,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:06,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:06,067 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2019-11-28 17:06:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,176 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-11-28 17:06:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:06,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 17:06:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,178 INFO L225 Difference]: With dead ends: 65 [2019-11-28 17:06:06,178 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 17:06:06,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 17:06:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 17:06:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2019-11-28 17:06:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 17:06:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-28 17:06:06,189 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2019-11-28 17:06:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,192 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-28 17:06:06,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-28 17:06:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:06:06,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,195 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 17:06:06,195 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2019-11-28 17:06:06,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171720697] [2019-11-28 17:06:06,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,295 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 17:06:06,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171720697] [2019-11-28 17:06:06,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:06,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567638759] [2019-11-28 17:06:06,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:06,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:06,297 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-11-28 17:06:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,381 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-11-28 17:06:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:06,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 17:06:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,382 INFO L225 Difference]: With dead ends: 54 [2019-11-28 17:06:06,382 INFO L226 Difference]: Without dead ends: 52 [2019-11-28 17:06:06,383 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 17:06:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-28 17:06:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2019-11-28 17:06:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 17:06:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-28 17:06:06,389 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2019-11-28 17:06:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,390 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-28 17:06:06,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-28 17:06:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:06:06,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:06,391 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2019-11-28 17:06:06,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492907151] [2019-11-28 17:06:06,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,481 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 17:06:06,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492907151] [2019-11-28 17:06:06,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:06:06,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272867010] [2019-11-28 17:06:06,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:06:06,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:06:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:06:06,484 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-11-28 17:06:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,629 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-11-28 17:06:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:06,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 17:06:06,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,631 INFO L225 Difference]: With dead ends: 58 [2019-11-28 17:06:06,631 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 17:06:06,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:06:06,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 17:06:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-11-28 17:06:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:06:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-28 17:06:06,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2019-11-28 17:06:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,640 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-28 17:06:06,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:06:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-28 17:06:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:06:06,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:06,642 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2019-11-28 17:06:06,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553485220] [2019-11-28 17:06:06,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,714 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 17:06:06,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553485220] [2019-11-28 17:06:06,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:06,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617441060] [2019-11-28 17:06:06,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:06,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:06,719 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2019-11-28 17:06:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:06,776 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-11-28 17:06:06,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:06,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 17:06:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:06,777 INFO L225 Difference]: With dead ends: 53 [2019-11-28 17:06:06,778 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 17:06:06,778 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 17:06:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 17:06:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2019-11-28 17:06:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 17:06:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-28 17:06:06,784 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2019-11-28 17:06:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:06,784 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-28 17:06:06,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-28 17:06:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 17:06:06,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:06,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:06,786 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:06,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:06,786 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2019-11-28 17:06:06,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:06,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818886937] [2019-11-28 17:06:06,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:06,876 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 17:06:06,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818886937] [2019-11-28 17:06:06,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:06,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:06,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813057853] [2019-11-28 17:06:06,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:06,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:06,878 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2019-11-28 17:06:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:07,009 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2019-11-28 17:06:07,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:06:07,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 17:06:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:07,010 INFO L225 Difference]: With dead ends: 56 [2019-11-28 17:06:07,010 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 17:06:07,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:06:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 17:06:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2019-11-28 17:06:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 17:06:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-28 17:06:07,016 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-11-28 17:06:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:07,016 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-28 17:06:07,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-28 17:06:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:06:07,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:07,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:07,018 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_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 17:06:07,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:07,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2019-11-28 17:06:07,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:07,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638954562] [2019-11-28 17:06:07,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:07,074 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 17:06:07,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638954562] [2019-11-28 17:06:07,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:07,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:07,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539785098] [2019-11-28 17:06:07,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:07,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:07,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:07,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:07,077 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-11-28 17:06:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:07,183 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2019-11-28 17:06:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:07,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 17:06:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:07,184 INFO L225 Difference]: With dead ends: 81 [2019-11-28 17:06:07,184 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:06:07,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:06:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:06:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:06:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:06:07,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-28 17:06:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:07,187 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:06:07,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:06:07,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:06:07,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:06:07,302 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 62 [2019-11-28 17:06:07,419 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 10 [2019-11-28 17:06:07,538 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 84 [2019-11-28 17:06:07,967 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-11-28 17:06:07,972 INFO L246 CegarLoopResult]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-11-28 17:06:07,972 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-28 17:06:07,972 INFO L246 CegarLoopResult]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-11-28 17:06:07,972 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-28 17:06:07,972 INFO L246 CegarLoopResult]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-11-28 17:06:07,973 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-11-28 17:06:07,973 INFO L246 CegarLoopResult]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-11-28 17:06:07,973 INFO L242 CegarLoopResult]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse1 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) (.cse0 (<= 0 ULTIMATE.start_main_~main__i~0))) (or (and .cse0 (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) .cse1 (<= 0 ULTIMATE.start_main_~main__j~0)) (and (let ((.cse2 (let ((.cse4 (< ULTIMATE.start_main_~main__j~0 ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse3 (or (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~8)) .cse0) (and .cse4 .cse0)))) (or (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~12)) .cse3) (and .cse4 .cse3)))))) (or (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~14)) .cse1 .cse2) (and .cse1 .cse2 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0)))) (<= 1 ULTIMATE.start_main_~main__j~0)))) [2019-11-28 17:06:07,974 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-28 17:06:07,974 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-11-28 17:06:07,974 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:06:07,974 INFO L246 CegarLoopResult]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-11-28 17:06:07,974 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:06:07,974 INFO L246 CegarLoopResult]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-11-28 17:06:07,974 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-28 17:06:07,975 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-28 17:06:07,975 INFO L246 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-28 17:06:07,975 INFO L246 CegarLoopResult]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-28 17:06:07,975 INFO L246 CegarLoopResult]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-11-28 17:06:07,975 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-11-28 17:06:07,975 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-28 17:06:07,975 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-11-28 17:06:07,976 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-11-28 17:06:07,976 INFO L246 CegarLoopResult]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-11-28 17:06:07,976 INFO L246 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-28 17:06:07,976 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-11-28 17:06:07,976 INFO L246 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2019-11-28 17:06:07,976 INFO L246 CegarLoopResult]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-11-28 17:06:07,977 INFO L246 CegarLoopResult]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-11-28 17:06:07,977 INFO L246 CegarLoopResult]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-11-28 17:06:07,977 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-11-28 17:06:07,977 INFO L246 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-28 17:06:07,977 INFO L246 CegarLoopResult]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-11-28 17:06:07,977 INFO L246 CegarLoopResult]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-11-28 17:06:07,978 INFO L246 CegarLoopResult]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-11-28 17:06:07,978 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-28 17:06:07,978 INFO L246 CegarLoopResult]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-11-28 17:06:07,978 INFO L242 CegarLoopResult]: At program point L288(lines 33 289) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__i~0 1) ULTIMATE.start_main_~main__len~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__j~0)) [2019-11-28 17:06:07,979 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 17:06:07,979 INFO L246 CegarLoopResult]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-11-28 17:06:07,979 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-11-28 17:06:07,979 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-11-28 17:06:07,980 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-28 17:06:07,980 INFO L249 CegarLoopResult]: At program point L305(lines 8 308) the Hoare annotation is: true [2019-11-28 17:06:07,980 INFO L246 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-28 17:06:07,980 INFO L246 CegarLoopResult]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-11-28 17:06:07,980 INFO L246 CegarLoopResult]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-11-28 17:06:07,981 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:06:07,981 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-11-28 17:06:07,981 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-28 17:06:07,981 INFO L246 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2019-11-28 17:06:07,982 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-28 17:06:07,982 INFO L246 CegarLoopResult]: For program point L224(line 224) no Hoare annotation was computed. [2019-11-28 17:06:07,982 INFO L246 CegarLoopResult]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-11-28 17:06:07,983 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-11-28 17:06:07,983 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-11-28 17:06:07,983 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-11-28 17:06:07,983 INFO L242 CegarLoopResult]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2019-11-28 17:06:07,984 INFO L246 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-28 17:06:07,984 INFO L246 CegarLoopResult]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-11-28 17:06:08,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:06:08 BoogieIcfgContainer [2019-11-28 17:06:08,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:06:08,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:06:08,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:06:08,016 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:06:08,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:03" (3/4) ... [2019-11-28 17:06:08,021 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:06:08,044 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 17:06:08,045 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:06:08,191 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:06:08,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:06:08,192 INFO L168 Benchmark]: Toolchain (without parser) took 5542.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -75.6 MB). Peak memory consumption was 143.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:08,193 INFO L168 Benchmark]: CDTParser took 0.28 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 17:06:08,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -201.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:08,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:08,194 INFO L168 Benchmark]: Boogie Preprocessor took 21.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:08,194 INFO L168 Benchmark]: RCFGBuilder took 500.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:08,194 INFO L168 Benchmark]: TraceAbstraction took 4254.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:08,195 INFO L168 Benchmark]: Witness Printer took 175.58 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.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:08,197 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.28 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 533.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -201.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 500.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4254.31 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.6 MB). Peak memory consumption was 138.6 MB. Max. memory is 11.5 GB. * Witness Printer took 175.58 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.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((main__j + 5 <= main__bufsize && 0 <= main__i) && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((0 <= main__i && main__i + 1 <= main__len) && main__limit + 4 <= main__bufsize) && 0 <= main__j) || ((((!(0 == __VERIFIER_assert__cond) && main__limit + 4 <= main__bufsize) && ((!(0 == __VERIFIER_assert__cond) && ((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i))) || (main__j < main__bufsize && ((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i))))) || ((main__limit + 4 <= main__bufsize && ((!(0 == __VERIFIER_assert__cond) && ((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i))) || (main__j < main__bufsize && ((!(0 == __VERIFIER_assert__cond) && 0 <= main__i) || (main__j < main__bufsize && 0 <= main__i))))) && main__j + 4 <= main__bufsize)) && 1 <= main__j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 845 SDtfs, 1238 SDslu, 620 SDs, 0 SdLazy, 780 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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, 16 MinimizatonAttempts, 395 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 19 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 137558677 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 15219 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...