./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:55:10,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:55:10,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:55:10,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:55:10,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:55:10,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:55:10,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:55:10,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:55:10,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:55:10,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:55:10,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:55:10,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:55:10,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:55:10,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:55:10,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:55:10,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:55:10,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:55:10,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:55:10,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:55:10,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:55:10,538 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:55:10,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:55:10,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:55:10,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:55:10,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:55:10,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:55:10,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:55:10,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:55:10,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:55:10,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:55:10,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:55:10,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:55:10,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:55:10,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:55:10,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:55:10,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:55:10,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:55:10,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:55:10,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:55:10,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:55:10,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:55:10,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:55:10,559 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:55:10,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:55:10,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:55:10,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:55:10,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:55:10,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:55:10,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:55:10,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:55:10,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:55:10,592 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:55:10,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:55:10,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:55:10,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:55:10,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:55:10,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:55:10,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:55:10,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:55:10,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:55:10,594 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:55:10,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:55:10,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:55:10,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:55:10,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:55:10,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:55:10,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:55:10,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:55:10,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:55:10,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:55:10,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:55:10,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:55:10,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:55:10,598 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:55:10,598 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:55:10,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:55:10,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2022-07-12 03:55:10,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:55:10,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:55:10,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:55:10,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:55:10,878 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:55:10,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-07-12 03:55:10,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ac1c76e/9743ad4807d2480ab16cb210d6357c16/FLAG23e3b37a0 [2022-07-12 03:55:11,321 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:55:11,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-07-12 03:55:11,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ac1c76e/9743ad4807d2480ab16cb210d6357c16/FLAG23e3b37a0 [2022-07-12 03:55:11,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ac1c76e/9743ad4807d2480ab16cb210d6357c16 [2022-07-12 03:55:11,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:55:11,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:55:11,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:55:11,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:55:11,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:55:11,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:55:11" (1/1) ... [2022-07-12 03:55:11,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b4477b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:11, skipping insertion in model container [2022-07-12 03:55:11,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:55:11" (1/1) ... [2022-07-12 03:55:11,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:55:11,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:55:11,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-07-12 03:55:11,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:55:11,968 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:55:11,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-07-12 03:55:11,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:55:12,010 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:55:12,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12 WrapperNode [2022-07-12 03:55:12,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:55:12,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:55:12,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:55:12,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:55:12,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,049 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 106 [2022-07-12 03:55:12,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:55:12,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:55:12,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:55:12,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:55:12,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:55:12,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:55:12,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:55:12,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:55:12,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (1/1) ... [2022-07-12 03:55:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:55:12,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:55:12,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:55:12,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:55:12,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:55:12,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:55:12,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:55:12,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:55:12,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 03:55:12,138 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 03:55:12,182 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:55:12,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:55:12,380 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:55:12,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:55:12,386 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 03:55:12,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:55:12 BoogieIcfgContainer [2022-07-12 03:55:12,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:55:12,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:55:12,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:55:12,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:55:12,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:55:11" (1/3) ... [2022-07-12 03:55:12,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a32556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:55:12, skipping insertion in model container [2022-07-12 03:55:12,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:55:12" (2/3) ... [2022-07-12 03:55:12,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a32556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:55:12, skipping insertion in model container [2022-07-12 03:55:12,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:55:12" (3/3) ... [2022-07-12 03:55:12,395 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-07-12 03:55:12,407 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:55:12,407 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:55:12,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:55:12,452 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12b22862, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b7bf1f1 [2022-07-12 03:55:12,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:55:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-12 03:55:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:55:12,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:12,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:12,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:55:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash 92647790, now seen corresponding path program 1 times [2022-07-12 03:55:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:12,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319744909] [2022-07-12 03:55:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:12,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319744909] [2022-07-12 03:55:12,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319744909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:12,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:12,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:55:12,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804457377] [2022-07-12 03:55:12,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:12,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:55:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:55:12,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:55:12,746 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:55:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:12,954 INFO L93 Difference]: Finished difference Result 107 states and 201 transitions. [2022-07-12 03:55:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:55:12,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 03:55:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:12,964 INFO L225 Difference]: With dead ends: 107 [2022-07-12 03:55:12,964 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 03:55:12,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:12,971 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:12,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 237 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 03:55:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-07-12 03:55:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 03:55:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2022-07-12 03:55:13,023 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 13 [2022-07-12 03:55:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:13,023 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2022-07-12 03:55:13,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:55:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2022-07-12 03:55:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:55:13,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:13,025 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:13,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:55:13,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:55:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816530, now seen corresponding path program 1 times [2022-07-12 03:55:13,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:13,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653475541] [2022-07-12 03:55:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:55:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:55:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:13,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653475541] [2022-07-12 03:55:13,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653475541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:13,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:13,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817725079] [2022-07-12 03:55:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:13,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:13,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:13,102 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:55:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:13,217 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-07-12 03:55:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-12 03:55:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:13,219 INFO L225 Difference]: With dead ends: 59 [2022-07-12 03:55:13,219 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 03:55:13,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:55:13,221 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:13,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 03:55:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-12 03:55:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 03:55:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-07-12 03:55:13,235 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 18 [2022-07-12 03:55:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:13,236 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-07-12 03:55:13,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 03:55:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-07-12 03:55:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 03:55:13,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:13,237 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:13,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:55:13,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:55:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash 323306105, now seen corresponding path program 1 times [2022-07-12 03:55:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:13,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139515786] [2022-07-12 03:55:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:55:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:55:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:55:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:55:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 03:55:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 03:55:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 03:55:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:13,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139515786] [2022-07-12 03:55:13,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139515786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:13,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:13,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:55:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250683678] [2022-07-12 03:55:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:13,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:55:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:55:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:55:13,348 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:55:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:13,393 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2022-07-12 03:55:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:55:13,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-12 03:55:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:13,394 INFO L225 Difference]: With dead ends: 86 [2022-07-12 03:55:13,395 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 03:55:13,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:55:13,396 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:13,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 03:55:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-12 03:55:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 03:55:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2022-07-12 03:55:13,415 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 47 [2022-07-12 03:55:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:13,415 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2022-07-12 03:55:13,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:55:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2022-07-12 03:55:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:55:13,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:13,417 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:13,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:55:13,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:55:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash -353292279, now seen corresponding path program 1 times [2022-07-12 03:55:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:13,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797529137] [2022-07-12 03:55:13,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:55:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:55:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:55:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:55:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 03:55:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 03:55:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-12 03:55:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797529137] [2022-07-12 03:55:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797529137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:13,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:13,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966296534] [2022-07-12 03:55:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:13,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:13,535 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:55:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:13,647 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-07-12 03:55:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:13,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-12 03:55:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:13,649 INFO L225 Difference]: With dead ends: 64 [2022-07-12 03:55:13,649 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:55:13,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:13,650 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:13,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 121 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:55:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-07-12 03:55:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 03:55:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-07-12 03:55:13,661 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 48 [2022-07-12 03:55:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:13,662 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-07-12 03:55:13,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 03:55:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-07-12 03:55:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 03:55:13,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:13,664 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:13,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:55:13,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:55:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash 89962133, now seen corresponding path program 1 times [2022-07-12 03:55:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:13,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961838584] [2022-07-12 03:55:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:55:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:55:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:55:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:55:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 03:55:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 03:55:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 03:55:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 03:55:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 03:55:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 03:55:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 03:55:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 03:55:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-12 03:55:13,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:13,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961838584] [2022-07-12 03:55:13,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961838584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:13,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:13,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:13,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039561998] [2022-07-12 03:55:13,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:13,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:13,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:13,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:13,819 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 03:55:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:13,914 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-07-12 03:55:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-07-12 03:55:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:13,918 INFO L225 Difference]: With dead ends: 70 [2022-07-12 03:55:13,920 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 03:55:13,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:13,922 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:13,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 259 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:55:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 03:55:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-12 03:55:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-12 03:55:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-07-12 03:55:13,940 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 83 [2022-07-12 03:55:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:13,940 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-07-12 03:55:13,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 03:55:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-07-12 03:55:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 03:55:13,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:55:13,943 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:55:13,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:55:13,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:55:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:55:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1632378009, now seen corresponding path program 1 times [2022-07-12 03:55:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:55:13,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762537514] [2022-07-12 03:55:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:55:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:55:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:55:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:55:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:55:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:55:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 03:55:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 03:55:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 03:55:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 03:55:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 03:55:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 03:55:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 03:55:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 03:55:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 03:55:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:55:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-07-12 03:55:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:55:14,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762537514] [2022-07-12 03:55:14,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762537514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:55:14,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:55:14,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:55:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967627040] [2022-07-12 03:55:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:55:14,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:55:14,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:55:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:55:14,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:55:14,056 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 03:55:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:55:14,122 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-07-12 03:55:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:55:14,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 88 [2022-07-12 03:55:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:55:14,124 INFO L225 Difference]: With dead ends: 71 [2022-07-12 03:55:14,124 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:55:14,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:55:14,126 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:55:14,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:55:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:55:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:55:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:55:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:55:14,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-07-12 03:55:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:55:14,128 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:55:14,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 03:55:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:55:14,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:55:14,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:55:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:55:14,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:55:14,394 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-07-12 03:55:14,394 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-07-12 03:55:14,394 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-07-12 03:55:14,395 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-07-12 03:55:14,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:55:14,395 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-07-12 03:55:14,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:55:14,395 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,395 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,395 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,395 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-07-12 03:55:14,395 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-07-12 03:55:14,395 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,396 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-07-12 03:55:14,396 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-07-12 03:55:14,397 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,397 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-07-12 03:55:14,397 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2))) [2022-07-12 03:55:14,397 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:55:14,397 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-07-12 03:55:14,397 INFO L902 garLoopResultBuilder]: At program point L82(lines 24 83) the Hoare annotation is: true [2022-07-12 03:55:14,397 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) [2022-07-12 03:55:14,397 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,397 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-07-12 03:55:14,397 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:55:14,397 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-07-12 03:55:14,397 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,398 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-12 03:55:14,398 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse3 (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (.cse4 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-07-12 03:55:14,398 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse3 (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (.cse4 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-07-12 03:55:14,398 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-07-12 03:55:14,398 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-12 03:55:14,399 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-12 03:55:14,399 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-07-12 03:55:14,401 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-12 03:55:14,402 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:55:14,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:55:14 BoogieIcfgContainer [2022-07-12 03:55:14,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:55:14,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:55:14,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:55:14,426 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:55:14,427 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:55:12" (3/4) ... [2022-07-12 03:55:14,429 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:55:14,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 03:55:14,437 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-12 03:55:14,437 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 03:55:14,437 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:55:14,438 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:55:14,472 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:55:14,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:55:14,473 INFO L158 Benchmark]: Toolchain (without parser) took 2718.27ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 78.6MB in the beginning and 71.3MB in the end (delta: 7.3MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-07-12 03:55:14,473 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:55:14,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.48ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 85.6MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:55:14,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.12ms. Allocated memory is still 111.1MB. Free memory was 85.6MB in the beginning and 84.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:55:14,474 INFO L158 Benchmark]: Boogie Preprocessor took 32.36ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 82.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:55:14,475 INFO L158 Benchmark]: RCFGBuilder took 304.30ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 70.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:55:14,475 INFO L158 Benchmark]: TraceAbstraction took 2036.55ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 70.4MB in the beginning and 74.5MB in the end (delta: -4.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2022-07-12 03:55:14,475 INFO L158 Benchmark]: Witness Printer took 46.39ms. Allocated memory is still 134.2MB. Free memory was 74.5MB in the beginning and 71.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:55:14,477 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 53.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.48ms. Allocated memory is still 111.1MB. Free memory was 78.3MB in the beginning and 85.6MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.12ms. Allocated memory is still 111.1MB. Free memory was 85.6MB in the beginning and 84.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.36ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 82.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.30ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 70.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2036.55ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 70.4MB in the beginning and 74.5MB in the end (delta: -4.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 46.39ms. Allocated memory is still 134.2MB. Free memory was 74.5MB in the beginning and 71.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 1135 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 763 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 460 IncrementalHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 372 mSDtfsCounter, 460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 73 PreInvPairs, 104 NumberOfFragments, 456 HoareAnnotationTreeSize, 73 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 283 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (cp + 1 <= urilen && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((cp < urilen && c == 0) && 1 <= cp) && 0 < scheme + 1) || (((cp < urilen && 1 <= c) && 1 <= cp) && 0 < scheme + 1) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 03:55:14,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE