./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -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 3607a70e53f56c4b4860f9fca9676a925474c3df ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:16:31,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:16:31,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:16:31,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:16:31,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:16:31,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:16:31,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:16:31,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:16:31,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:16:31,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:16:31,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:16:31,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:16:31,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:16:31,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:16:31,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:16:31,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:16:31,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:16:31,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:16:31,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:16:31,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:16:31,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:16:31,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:16:31,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:16:31,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:16:31,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:16:31,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:16:31,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:16:31,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:16:31,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:16:31,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:16:31,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:16:31,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:16:31,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:16:31,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:16:31,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:16:31,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:16:31,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:16:31,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:16:31,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:16:31,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:16:31,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:16:31,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:16:31,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:16:31,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:16:31,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:16:31,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:16:31,630 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:16:31,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:16:31,630 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:16:31,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:16:31,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:16:31,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:16:31,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:16:31,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:16:31,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:16:31,633 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:16:31,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:16:31,634 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:16:31,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:16:31,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:16:31,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:16:31,635 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:16:31,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:16:31,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:16:31,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:16:31,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:16:31,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:16:31,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:16:31,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:16:31,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:16:31,638 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 -> 3607a70e53f56c4b4860f9fca9676a925474c3df [2019-11-19 21:16:31,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:16:31,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:16:31,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:16:31,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:16:31,951 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:16:31,952 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-11-19 21:16:32,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ddb5906/c5c4e29af7de408f92becd2dd96ed1cf/FLAGf4daaa4c7 [2019-11-19 21:16:32,426 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:16:32,427 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-11-19 21:16:32,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ddb5906/c5c4e29af7de408f92becd2dd96ed1cf/FLAGf4daaa4c7 [2019-11-19 21:16:32,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ddb5906/c5c4e29af7de408f92becd2dd96ed1cf [2019-11-19 21:16:32,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:16:32,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:16:32,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:16:32,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:16:32,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:16:32,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:32" (1/1) ... [2019-11-19 21:16:32,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25ec0be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:32, skipping insertion in model container [2019-11-19 21:16:32,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:32" (1/1) ... [2019-11-19 21:16:32,856 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:16:32,882 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:16:33,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:16:33,112 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:16:33,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:16:33,219 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:16:33,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33 WrapperNode [2019-11-19 21:16:33,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:16:33,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:16:33,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:16:33,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:16:33,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:16:33,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:16:33,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:16:33,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:16:33,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... [2019-11-19 21:16:33,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:16:33,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:16:33,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:16:33,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:16:33,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:16:33,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:16:33,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:16:33,801 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:16:33,802 INFO L285 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-19 21:16:33,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:33 BoogieIcfgContainer [2019-11-19 21:16:33,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:16:33,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:16:33,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:16:33,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:16:33,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:16:32" (1/3) ... [2019-11-19 21:16:33,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5b69a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:33, skipping insertion in model container [2019-11-19 21:16:33,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:33" (2/3) ... [2019-11-19 21:16:33,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5b69a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:33, skipping insertion in model container [2019-11-19 21:16:33,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:33" (3/3) ... [2019-11-19 21:16:33,810 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-11-19 21:16:33,817 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:16:33,823 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-19 21:16:33,834 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-19 21:16:33,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:16:33,861 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:16:33,861 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:16:33,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:16:33,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:16:33,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:16:33,862 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:16:33,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:16:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-19 21:16:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 21:16:33,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:33,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:33,887 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:33,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash -374051301, now seen corresponding path program 1 times [2019-11-19 21:16:33,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:33,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894216160] [2019-11-19 21:16:33,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:34,066 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-19 21:16:34,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894216160] [2019-11-19 21:16:34,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:34,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:16:34,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733451964] [2019-11-19 21:16:34,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:16:34,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:34,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:16:34,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:16:34,085 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-11-19 21:16:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:34,272 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2019-11-19 21:16:34,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:16:34,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-19 21:16:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:34,286 INFO L225 Difference]: With dead ends: 171 [2019-11-19 21:16:34,287 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 21:16:34,293 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-19 21:16:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 21:16:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-19 21:16:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-19 21:16:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-11-19 21:16:34,341 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 10 [2019-11-19 21:16:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:34,342 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-11-19 21:16:34,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:16:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-11-19 21:16:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:16:34,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:34,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:34,344 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1314109022, now seen corresponding path program 1 times [2019-11-19 21:16:34,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:34,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332396015] [2019-11-19 21:16:34,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:34,456 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-19 21:16:34,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332396015] [2019-11-19 21:16:34,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:34,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:34,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652997679] [2019-11-19 21:16:34,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:34,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:34,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:34,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:34,460 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 5 states. [2019-11-19 21:16:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:34,655 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-11-19 21:16:34,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:34,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-19 21:16:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:34,657 INFO L225 Difference]: With dead ends: 83 [2019-11-19 21:16:34,658 INFO L226 Difference]: Without dead ends: 67 [2019-11-19 21:16:34,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-19 21:16:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-19 21:16:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-19 21:16:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-11-19 21:16:34,671 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2019-11-19 21:16:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:34,672 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-11-19 21:16:34,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-11-19 21:16:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 21:16:34,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:34,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:34,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash -168637, now seen corresponding path program 1 times [2019-11-19 21:16:34,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:34,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855718882] [2019-11-19 21:16:34,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:34,736 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-19 21:16:34,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855718882] [2019-11-19 21:16:34,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:34,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:16:34,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10838801] [2019-11-19 21:16:34,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:34,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:34,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:16:34,739 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 4 states. [2019-11-19 21:16:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:34,914 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-11-19 21:16:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:34,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-19 21:16:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:34,916 INFO L225 Difference]: With dead ends: 88 [2019-11-19 21:16:34,916 INFO L226 Difference]: Without dead ends: 80 [2019-11-19 21:16:34,917 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-19 21:16:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-19 21:16:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2019-11-19 21:16:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 21:16:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-11-19 21:16:34,934 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 15 [2019-11-19 21:16:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:34,935 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-11-19 21:16:34,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-11-19 21:16:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 21:16:34,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:34,936 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:34,937 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash -749433183, now seen corresponding path program 1 times [2019-11-19 21:16:34,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:34,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325289270] [2019-11-19 21:16:34,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:16:35,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325289270] [2019-11-19 21:16:35,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316669021] [2019-11-19 21:16:35,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:16:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:35,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 21:16:35,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:16:35,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:16:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:16:35,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:16:35,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2019-11-19 21:16:35,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567343086] [2019-11-19 21:16:35,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:16:35,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:16:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:35,248 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 7 states. [2019-11-19 21:16:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:35,456 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-11-19 21:16:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:16:35,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-19 21:16:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:35,458 INFO L225 Difference]: With dead ends: 80 [2019-11-19 21:16:35,459 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 21:16:35,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:16:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 21:16:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2019-11-19 21:16:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 21:16:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-11-19 21:16:35,480 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 26 [2019-11-19 21:16:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:35,482 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-11-19 21:16:35,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:16:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-11-19 21:16:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:16:35,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:35,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:35,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:16:35,692 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:35,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1520484215, now seen corresponding path program 1 times [2019-11-19 21:16:35,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:35,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388790967] [2019-11-19 21:16:35,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:35,770 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-19 21:16:35,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388790967] [2019-11-19 21:16:35,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:35,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:16:35,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533158065] [2019-11-19 21:16:35,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:16:35,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:16:35,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:16:35,776 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2019-11-19 21:16:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:35,817 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-11-19 21:16:35,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:16:35,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-19 21:16:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:35,819 INFO L225 Difference]: With dead ends: 84 [2019-11-19 21:16:35,819 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 21:16:35,820 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-19 21:16:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 21:16:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-19 21:16:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 21:16:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-11-19 21:16:35,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2019-11-19 21:16:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:35,828 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-11-19 21:16:35,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:16:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-11-19 21:16:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 21:16:35,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:35,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:35,831 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:35,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash 550411780, now seen corresponding path program 1 times [2019-11-19 21:16:35,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:35,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036865682] [2019-11-19 21:16:35,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:35,915 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-19 21:16:35,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036865682] [2019-11-19 21:16:35,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:35,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:35,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925580067] [2019-11-19 21:16:35,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:35,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:35,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:35,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:35,918 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2019-11-19 21:16:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,010 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-19 21:16:36,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:16:36,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-19 21:16:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,011 INFO L225 Difference]: With dead ends: 64 [2019-11-19 21:16:36,012 INFO L226 Difference]: Without dead ends: 62 [2019-11-19 21:16:36,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-19 21:16:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-19 21:16:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-19 21:16:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-19 21:16:36,021 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 39 [2019-11-19 21:16:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,022 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-19 21:16:36,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-19 21:16:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 21:16:36,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,024 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 664905863, now seen corresponding path program 1 times [2019-11-19 21:16:36,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638496582] [2019-11-19 21:16:36,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,095 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-19 21:16:36,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638496582] [2019-11-19 21:16:36,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:36,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:36,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136423006] [2019-11-19 21:16:36,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:36,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:36,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:36,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:36,098 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 5 states. [2019-11-19 21:16:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,174 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-11-19 21:16:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:16:36,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-19 21:16:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,176 INFO L225 Difference]: With dead ends: 61 [2019-11-19 21:16:36,176 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 21:16:36,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 21:16:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-19 21:16:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 21:16:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-19 21:16:36,185 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 41 [2019-11-19 21:16:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,186 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-19 21:16:36,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-19 21:16:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 21:16:36,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,188 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,189 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash -743371514, now seen corresponding path program 1 times [2019-11-19 21:16:36,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130139201] [2019-11-19 21:16:36,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:36,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130139201] [2019-11-19 21:16:36,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254785769] [2019-11-19 21:16:36,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:16:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:16:36,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:16:36,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:16:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 21:16:36,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:16:36,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2019-11-19 21:16:36,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153015375] [2019-11-19 21:16:36,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:36,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:36,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:36,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:36,403 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states. [2019-11-19 21:16:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,469 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-19 21:16:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:36,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-19 21:16:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,470 INFO L225 Difference]: With dead ends: 62 [2019-11-19 21:16:36,470 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:16:36,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:16:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:16:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:16:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:16:36,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2019-11-19 21:16:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,472 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:16:36,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:16:36,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:16:36,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:16:36,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:16:37,226 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,226 INFO L444 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-19 21:16:37,226 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,227 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:16:37,227 INFO L444 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-19 21:16:37,227 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,227 INFO L440 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,227 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,228 INFO L440 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,228 INFO L444 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,228 INFO L440 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,228 INFO L444 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,228 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,228 INFO L444 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,228 INFO L440 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,229 INFO L444 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-11-19 21:16:37,229 INFO L444 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,229 INFO L444 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-11-19 21:16:37,229 INFO L440 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,229 INFO L444 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,230 INFO L440 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,230 INFO L444 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,230 INFO L440 ceAbstractionStarter]: At program point L4-23(line 41) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,230 INFO L444 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,231 INFO L440 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,231 INFO L444 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,231 INFO L440 ceAbstractionStarter]: At program point L4-29(line 44) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,231 INFO L444 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,232 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,232 INFO L444 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,232 INFO L440 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (= ULTIMATE.start_main_~c~0 0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,232 INFO L444 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,232 INFO L444 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,233 INFO L444 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,233 INFO L444 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,233 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,233 INFO L444 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,233 INFO L444 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,234 INFO L444 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,234 INFO L444 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,234 INFO L440 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,234 INFO L444 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,234 INFO L444 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,235 INFO L444 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,235 INFO L444 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,235 INFO L440 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,235 INFO L444 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,235 INFO L444 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,236 INFO L444 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,236 INFO L444 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,236 INFO L440 ceAbstractionStarter]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,236 INFO L444 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-11-19 21:16:37,236 INFO L444 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,237 INFO L444 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,237 INFO L444 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-11-19 21:16:37,237 INFO L444 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,237 INFO L440 ceAbstractionStarter]: At program point L55-1(lines 55 61) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,238 INFO L440 ceAbstractionStarter]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,238 INFO L444 ceAbstractionStarter]: For program point L5-16(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,238 INFO L444 ceAbstractionStarter]: For program point L4-48(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,238 INFO L444 ceAbstractionStarter]: For program point L5-17(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,238 INFO L440 ceAbstractionStarter]: At program point L4-50(lines 3 8) the Hoare annotation is: (and (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,239 INFO L444 ceAbstractionStarter]: For program point L4-51(lines 4 6) no Hoare annotation was computed. [2019-11-19 21:16:37,239 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,239 INFO L444 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-11-19 21:16:37,239 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,239 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:16:37,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,240 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:16:37,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,241 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,241 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2019-11-19 21:16:37,241 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-11-19 21:16:37,242 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,242 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,242 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,242 INFO L440 ceAbstractionStarter]: At program point L33-1(lines 3 38) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,242 INFO L444 ceAbstractionStarter]: For program point L33-2(lines 33 38) no Hoare annotation was computed. [2019-11-19 21:16:37,243 INFO L447 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2019-11-19 21:16:37,243 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 21:16:37,243 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-19 21:16:37,243 INFO L444 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-11-19 21:16:37,243 INFO L440 ceAbstractionStarter]: At program point L51-1(lines 3 63) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1))) [2019-11-19 21:16:37,244 INFO L447 ceAbstractionStarter]: At program point L68(lines 10 69) the Hoare annotation is: true [2019-11-19 21:16:37,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:16:37 BoogieIcfgContainer [2019-11-19 21:16:37,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:16:37,271 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:16:37,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:16:37,272 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:16:37,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:33" (3/4) ... [2019-11-19 21:16:37,276 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:16:37,289 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-11-19 21:16:37,289 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:16:37,368 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:16:37,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:16:37,371 INFO L168 Benchmark]: Toolchain (without parser) took 4534.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -202.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:16:37,371 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:16:37,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:37,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:37,372 INFO L168 Benchmark]: Boogie Preprocessor took 43.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:16:37,373 INFO L168 Benchmark]: RCFGBuilder took 481.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:37,373 INFO L168 Benchmark]: TraceAbstraction took 3461.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.7 MB). Peak memory consumption was 292.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:37,374 INFO L168 Benchmark]: Witness Printer took 97.23 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: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:37,376 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 481.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3461.25 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.7 MB). Peak memory consumption was 292.1 MB. Max. memory is 11.5 GB. * Witness Printer took 97.23 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: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((c + 2 <= tokenlen && cp + 1 < urilen) && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((c + 2 <= tokenlen && cp + 1 < urilen) && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 < urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && !(0 == cond)) && 1 <= cp) && 0 <= c) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((!(0 == cond) && cp + 1 <= urilen) && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((cp + 1 < urilen && 1 <= cp) && 0 <= c) && 1 == cond) && 0 < scheme + 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((c == 0 && cp + 1 < urilen) && 1 <= cp) && 1 == cond) && 0 < scheme + 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 18 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 423 SDtfs, 276 SDslu, 366 SDs, 0 SdLazy, 368 SolverSat, 224 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred 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, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 51 NumberOfFragments, 352 HoareAnnotationTreeSize, 20 FomulaSimplifications, 265 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 500 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 22318 SizeOfPredicates, 11 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/20 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...