./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.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/sendmail-close-angle.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 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:57:45,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:57:45,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:57:45,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:57:45,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:57:45,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:57:45,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:57:45,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:57:45,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:57:45,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:57:45,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:57:45,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:57:45,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:57:45,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:57:45,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:57:45,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:57:45,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:57:45,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:57:45,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:57:45,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:57:45,403 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:57:45,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:57:45,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:57:45,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:57:45,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:57:45,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:57:45,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:57:45,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:57:45,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:57:45,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:57:45,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:57:45,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:57:45,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:57:45,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:57:45,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:57:45,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:57:45,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:57:45,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:57:45,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:57:45,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:57:45,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:57:45,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:57:45,420 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:57:45,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:57:45,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:57:45,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:57:45,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:57:45,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:57:45,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:57:45,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:57:45,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:57:45,451 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:57:45,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:57:45,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:57:45,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:57:45,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:57:45,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:57:45,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:57:45,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:57:45,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:57:45,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:57:45,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:57:45,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:57:45,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:57:45,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:57:45,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:57:45,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:57:45,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:57:45,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:57:45,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:57:45,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:57:45,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:57:45,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:57:45,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:57:45,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:57:45,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:57:45,457 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 [2022-07-12 03:57:45,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:57:45,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:57:45,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:57:45,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:57:45,694 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:57:45,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2022-07-12 03:57:45,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2a07d84/7a6b81923a6f460e98a0064f81c32b9c/FLAGb9f31fbb2 [2022-07-12 03:57:46,090 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:57:46,090 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2022-07-12 03:57:46,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2a07d84/7a6b81923a6f460e98a0064f81c32b9c/FLAGb9f31fbb2 [2022-07-12 03:57:46,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2a07d84/7a6b81923a6f460e98a0064f81c32b9c [2022-07-12 03:57:46,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:57:46,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:57:46,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:57:46,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:57:46,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:57:46,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25efcefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46, skipping insertion in model container [2022-07-12 03:57:46,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:57:46,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:57:46,283 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/sendmail-close-angle.i[893,906] [2022-07-12 03:57:46,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:57:46,301 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:57:46,314 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/sendmail-close-angle.i[893,906] [2022-07-12 03:57:46,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:57:46,335 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:57:46,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46 WrapperNode [2022-07-12 03:57:46,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:57:46,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:57:46,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:57:46,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:57:46,341 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:57:46" (1/1) ... [2022-07-12 03:57:46,346 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:57:46" (1/1) ... [2022-07-12 03:57:46,361 INFO L137 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2022-07-12 03:57:46,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:57:46,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:57:46,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:57:46,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:57:46,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:57:46,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:57:46,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:57:46,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:57:46,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (1/1) ... [2022-07-12 03:57:46,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:57:46,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:57:46,427 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:57:46,432 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:57:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:57:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:57:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:57:46,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:57:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 03:57:46,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 03:57:46,513 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:57:46,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:57:46,590 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:57:46,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:57:46,594 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 03:57:46,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:57:46 BoogieIcfgContainer [2022-07-12 03:57:46,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:57:46,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:57:46,615 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:57:46,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:57:46,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:57:46" (1/3) ... [2022-07-12 03:57:46,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a715d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:57:46, skipping insertion in model container [2022-07-12 03:57:46,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:57:46" (2/3) ... [2022-07-12 03:57:46,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a715d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:57:46, skipping insertion in model container [2022-07-12 03:57:46,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:57:46" (3/3) ... [2022-07-12 03:57:46,620 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2022-07-12 03:57:46,629 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:57:46,629 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:57:46,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:57:46,672 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@460b8ae2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4af0c5ff [2022-07-12 03:57:46,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:57:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 03:57:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:57:46,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:46,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:46,715 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash -167421905, now seen corresponding path program 1 times [2022-07-12 03:57:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:46,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601611476] [2022-07-12 03:57:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:46,846 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:57:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:46,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601611476] [2022-07-12 03:57:46,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601611476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:57:46,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:57:46,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:57:46,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380742624] [2022-07-12 03:57:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:57:46,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:57:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:46,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:57:46,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:57:46,880 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:57:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:46,898 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2022-07-12 03:57:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:57:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2022-07-12 03:57:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:46,906 INFO L225 Difference]: With dead ends: 56 [2022-07-12 03:57:46,907 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:57:46,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:57:46,913 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:46,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:57:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:57:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:57:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 03:57:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:57:46,946 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 11 [2022-07-12 03:57:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:46,946 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:57:46,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:57:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:57:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:57:46,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:46,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:46,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:57:46,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1482831489, now seen corresponding path program 1 times [2022-07-12 03:57:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:46,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039863590] [2022-07-12 03:57:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:46,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,062 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:57:47,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039863590] [2022-07-12 03:57:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039863590] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:57:47,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:57:47,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:57:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676475632] [2022-07-12 03:57:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:57:47,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:57:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:47,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:57:47,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:57:47,065 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:57:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:47,135 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-07-12 03:57:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:57:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 12 [2022-07-12 03:57:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:47,137 INFO L225 Difference]: With dead ends: 32 [2022-07-12 03:57:47,137 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 03:57:47,141 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:57:47,142 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:47,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:57:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 03:57:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 03:57:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 03:57:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-12 03:57:47,155 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 12 [2022-07-12 03:57:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:47,155 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-12 03:57:47,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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:57:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-07-12 03:57:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:57:47,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:47,156 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:47,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:57:47,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:47,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2126947644, now seen corresponding path program 1 times [2022-07-12 03:57:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:47,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352492525] [2022-07-12 03:57:47,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 03:57:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,247 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:57:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:47,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352492525] [2022-07-12 03:57:47,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352492525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:57:47,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:57:47,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:57:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465890669] [2022-07-12 03:57:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:57:47,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:57:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:57:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:57:47,249 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:57:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:47,347 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-07-12 03:57:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:57:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2022-07-12 03:57:47,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:47,349 INFO L225 Difference]: With dead ends: 45 [2022-07-12 03:57:47,349 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:57:47,350 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:57:47,350 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:47,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 97 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:57:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:57:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-07-12 03:57:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 03:57:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-07-12 03:57:47,358 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 17 [2022-07-12 03:57:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:47,358 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2022-07-12 03:57:47,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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:57:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-07-12 03:57:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:57:47,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:47,360 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:47,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:57:47,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2018842485, now seen corresponding path program 1 times [2022-07-12 03:57:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:47,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372687366] [2022-07-12 03:57:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:57:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:57:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:57:47,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:47,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372687366] [2022-07-12 03:57:47,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372687366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:57:47,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:57:47,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:57:47,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837931511] [2022-07-12 03:57:47,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:57:47,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:57:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:47,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:57:47,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:57:47,427 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:57:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:47,505 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-07-12 03:57:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:57:47,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-12 03:57:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:47,507 INFO L225 Difference]: With dead ends: 52 [2022-07-12 03:57:47,508 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 03:57:47,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:57:47,510 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:47,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:57:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 03:57:47,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-07-12 03:57:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 31 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-12 03:57:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-07-12 03:57:47,524 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 25 [2022-07-12 03:57:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:47,524 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-07-12 03:57:47,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 03:57:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-07-12 03:57:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:57:47,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:47,527 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:47,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:57:47,527 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1644488141, now seen corresponding path program 1 times [2022-07-12 03:57:47,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:47,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276815763] [2022-07-12 03:57:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:47,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 03:57:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 03:57:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 03:57:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 03:57:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:47,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276815763] [2022-07-12 03:57:47,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276815763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:57:47,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:57:47,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:57:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204001218] [2022-07-12 03:57:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:57:47,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:57:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:57:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:57:47,592 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:57:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:47,740 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-07-12 03:57:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:57:47,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-12 03:57:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:47,742 INFO L225 Difference]: With dead ends: 71 [2022-07-12 03:57:47,742 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 03:57:47,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:57:47,743 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:47,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 99 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:57:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 03:57:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-07-12 03:57:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-12 03:57:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-07-12 03:57:47,751 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2022-07-12 03:57:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:47,751 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-07-12 03:57:47,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:57:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-07-12 03:57:47,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:57:47,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:47,752 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:47,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:57:47,752 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:47,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:47,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1722491344, now seen corresponding path program 1 times [2022-07-12 03:57:47,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:47,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975531858] [2022-07-12 03:57:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:47,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:57:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:57:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:57:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 03:57:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975531858] [2022-07-12 03:57:47,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975531858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:57:47,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:57:47,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:57:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178267037] [2022-07-12 03:57:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:57:47,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:57:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:47,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:57:47,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:57:47,825 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:57:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:47,929 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-07-12 03:57:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:57:47,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-07-12 03:57:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:47,932 INFO L225 Difference]: With dead ends: 73 [2022-07-12 03:57:47,933 INFO L226 Difference]: Without dead ends: 71 [2022-07-12 03:57:47,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:57:47,939 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 56 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:47,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 146 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:57:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-12 03:57:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2022-07-12 03:57:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.119047619047619) internal successors, (47), 45 states have internal predecessors, (47), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-12 03:57:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-07-12 03:57:47,954 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 30 [2022-07-12 03:57:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:47,955 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-07-12 03:57:47,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 03:57:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-07-12 03:57:47,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 03:57:47,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:47,956 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:47,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:57:47,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1030091550, now seen corresponding path program 1 times [2022-07-12 03:57:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:47,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142294721] [2022-07-12 03:57:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:57:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:57:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:57:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:57:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 03:57:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 03:57:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 03:57:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:57:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:48,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142294721] [2022-07-12 03:57:48,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142294721] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:57:48,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574553981] [2022-07-12 03:57:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:48,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:57:48,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:57:48,111 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:57:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:57:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:48,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:57:48,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:57:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:57:48,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:57:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:57:48,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574553981] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:57:48,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:57:48,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-07-12 03:57:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414287880] [2022-07-12 03:57:48,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:57:48,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:57:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:57:48,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-12 03:57:48,539 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 17 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-12 03:57:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:48,985 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2022-07-12 03:57:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 03:57:48,986 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 53 [2022-07-12 03:57:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:48,987 INFO L225 Difference]: With dead ends: 111 [2022-07-12 03:57:48,987 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 03:57:48,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2022-07-12 03:57:48,988 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 72 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:48,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 238 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:57:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 03:57:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-07-12 03:57:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 58 states have internal predecessors, (60), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 03:57:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2022-07-12 03:57:48,999 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 53 [2022-07-12 03:57:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:48,999 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2022-07-12 03:57:49,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-12 03:57:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-07-12 03:57:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 03:57:49,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:49,001 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:49,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:57:49,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:57:49,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:49,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash 302113055, now seen corresponding path program 1 times [2022-07-12 03:57:49,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:49,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638811668] [2022-07-12 03:57:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:57:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:57:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:57:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:57:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 03:57:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 03:57:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 03:57:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:57:49,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:49,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638811668] [2022-07-12 03:57:49,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638811668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:57:49,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001599048] [2022-07-12 03:57:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:49,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:57:49,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:57:49,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:57:49,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:57:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:57:49,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:57:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:57:49,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:57:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 03:57:49,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001599048] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:57:49,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:57:49,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2022-07-12 03:57:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055554523] [2022-07-12 03:57:49,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:57:49,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 03:57:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 03:57:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-12 03:57:49,540 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-12 03:57:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:49,640 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2022-07-12 03:57:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 03:57:49,641 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 55 [2022-07-12 03:57:49,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:49,643 INFO L225 Difference]: With dead ends: 94 [2022-07-12 03:57:49,643 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 03:57:49,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-07-12 03:57:49,645 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:49,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 189 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:57:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 03:57:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-12 03:57:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 61 states have internal predecessors, (63), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 03:57:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2022-07-12 03:57:49,677 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 55 [2022-07-12 03:57:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:49,677 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2022-07-12 03:57:49,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-12 03:57:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2022-07-12 03:57:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 03:57:49,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:49,682 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:49,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:57:49,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-12 03:57:49,892 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 847231248, now seen corresponding path program 2 times [2022-07-12 03:57:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:49,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461008266] [2022-07-12 03:57:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:57:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:57:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:57:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:57:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 03:57:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 03:57:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 03:57:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 03:57:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 03:57:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 03:57:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 03:57:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-07-12 03:57:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:50,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461008266] [2022-07-12 03:57:50,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461008266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:57:50,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264254921] [2022-07-12 03:57:50,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:57:50,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:57:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:57:50,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:57:50,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:57:50,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:57:50,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:57:50,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 03:57:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:57:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-12 03:57:50,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:57:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-12 03:57:50,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264254921] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:57:50,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:57:50,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-07-12 03:57:50,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031236694] [2022-07-12 03:57:50,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:57:50,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 03:57:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 03:57:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-07-12 03:57:50,484 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand has 25 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 10 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-12 03:57:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:51,005 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2022-07-12 03:57:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 03:57:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 10 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 80 [2022-07-12 03:57:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:51,006 INFO L225 Difference]: With dead ends: 109 [2022-07-12 03:57:51,006 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 03:57:51,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 167 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 03:57:51,008 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 77 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:51,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 127 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 03:57:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 03:57:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2022-07-12 03:57:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 64 states have internal predecessors, (66), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-12 03:57:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2022-07-12 03:57:51,017 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 80 [2022-07-12 03:57:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:51,018 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2022-07-12 03:57:51,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 10 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2022-07-12 03:57:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2022-07-12 03:57:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 03:57:51,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:57:51,032 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:51,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:57:51,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:57:51,236 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:57:51,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:57:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1329001986, now seen corresponding path program 2 times [2022-07-12 03:57:51,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:57:51,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428330163] [2022-07-12 03:57:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:57:51,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:57:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:57:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 03:57:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 03:57:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 03:57:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 03:57:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 03:57:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 03:57:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 03:57:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 03:57:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 03:57:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 03:57:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 03:57:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 03:57:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 03:57:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 03:57:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:57:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-07-12 03:57:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:57:51,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428330163] [2022-07-12 03:57:51,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428330163] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:57:51,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502573805] [2022-07-12 03:57:51,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:57:51,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:57:51,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:57:51,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:57:51,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:57:51,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:57:51,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:57:51,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 03:57:51,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:57:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-07-12 03:57:51,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:57:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-07-12 03:57:51,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502573805] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:57:51,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:57:51,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 14 [2022-07-12 03:57:51,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038731272] [2022-07-12 03:57:51,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:57:51,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:57:51,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:57:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:57:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:57:51,658 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-12 03:57:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:57:51,870 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2022-07-12 03:57:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:57:51,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 103 [2022-07-12 03:57:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:57:51,871 INFO L225 Difference]: With dead ends: 96 [2022-07-12 03:57:51,872 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:57:51,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 229 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-07-12 03:57:51,873 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:57:51,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 164 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:57:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:57:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:57:51,874 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:57:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:57:51,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2022-07-12 03:57:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:57:51,874 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:57:51,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-12 03:57:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:57:51,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:57:51,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:57:51,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:57:52,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:57:52,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:57:52,586 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-07-12 03:57:52,586 INFO L899 garLoopResultBuilder]: For program point L31-1(lines 25 56) no Hoare annotation was computed. [2022-07-12 03:57:52,586 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~in~0#1| 0)) (and .cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|) .cse1))) (<= (+ |ULTIMATE.start_main_~buf~0#1| 1) |ULTIMATE.start_main_~bufferlen~0#1|)) [2022-07-12 03:57:52,586 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (let ((.cse0 (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~in~0#1| 0)) (and .cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|) .cse1))) (<= (+ |ULTIMATE.start_main_~buf~0#1| 1) |ULTIMATE.start_main_~bufferlen~0#1|)) [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point L32(lines 25 56) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and (<= 3 |ULTIMATE.start_main_~inlen~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~buf~0#1| 2) .cse2) (let ((.cse3 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse3 |ULTIMATE.start_main_~bufferlen~0#1|) .cse0 (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse3) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) .cse1 .cse2)) (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~in~0#1| 0)))) [2022-07-12 03:57:52,587 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (.cse1 (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 3) |ULTIMATE.start_main_~bufferlen~0#1|)) (and (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~in~0#1| 0) (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)))) [2022-07-12 03:57:52,587 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (.cse1 (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|))) (or (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (<= 0 |ULTIMATE.start_main_~buf~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 3) |ULTIMATE.start_main_~bufferlen~0#1|)) (and (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~in~0#1| 0) (<= 3 |ULTIMATE.start_main_~bufferlen~0#1|)))) [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 37 48) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 48) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~in~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~buf~0#1|))) (or (and (<= 3 |ULTIMATE.start_main_~inlen~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_main_~buf~0#1| 2) .cse2) (let ((.cse3 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse3 |ULTIMATE.start_main_~bufferlen~0#1|) .cse0 (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse3) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) .cse1 .cse2)) (and (<= 2 |ULTIMATE.start_main_~bufferlen~0#1|) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~in~0#1| 0)))) [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-07-12 03:57:52,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|))) [2022-07-12 03:57:52,588 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|))) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|) (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|))) [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L902 garLoopResultBuilder]: At program point L55(lines 25 56) the Hoare annotation is: true [2022-07-12 03:57:52,588 INFO L902 garLoopResultBuilder]: At program point L55-1(lines 24 56) the Hoare annotation is: true [2022-07-12 03:57:52,588 INFO L895 garLoopResultBuilder]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_main_~buflim~0#1|)) (.cse1 (< |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~inlen~0#1|))) (or (and (< 0 (+ |ULTIMATE.start_main_~buflim~0#1| 1)) (= |ULTIMATE.start_main_~buf~0#1| 0) (= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (= |ULTIMATE.start_main_~in~0#1| 0)) (and (<= (+ |ULTIMATE.start_main_~bufferlen~0#1| |ULTIMATE.start_main_~in~0#1| 1) (+ |ULTIMATE.start_main_~buf~0#1| |ULTIMATE.start_main_~inlen~0#1|)) (<= .cse0 |ULTIMATE.start_main_~bufferlen~0#1|) (<= 1 |ULTIMATE.start_main_~in~0#1|) (<= |ULTIMATE.start_main_~bufferlen~0#1| .cse0) .cse1 (<= (+ |ULTIMATE.start_main_~buf~0#1| 2) |ULTIMATE.start_main_~bufferlen~0#1|) (<= 0 |ULTIMATE.start_main_~buf~0#1|)))) [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-12 03:57:52,588 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-07-12 03:57:52,590 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:57:52,592 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:57:52,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:57:52 BoogieIcfgContainer [2022-07-12 03:57:52,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:57:52,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:57:52,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:57:52,615 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:57:52,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:57:46" (3/4) ... [2022-07-12 03:57:52,618 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:57:52,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-12 03:57:52,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-12 03:57:52,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 03:57:52,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:57:52,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:57:52,654 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:57:52,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:57:52,655 INFO L158 Benchmark]: Toolchain (without parser) took 6544.19ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 41.4MB in the beginning and 47.8MB in the end (delta: -6.4MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2022-07-12 03:57:52,656 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:57:52,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.25ms. Allocated memory is still 117.4MB. Free memory was 97.3MB in the beginning and 87.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:57:52,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.51ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 85.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:57:52,657 INFO L158 Benchmark]: Boogie Preprocessor took 33.71ms. Allocated memory is still 117.4MB. Free memory was 85.5MB in the beginning and 84.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:57:52,657 INFO L158 Benchmark]: RCFGBuilder took 199.78ms. Allocated memory is still 117.4MB. Free memory was 84.4MB in the beginning and 74.5MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:57:52,658 INFO L158 Benchmark]: TraceAbstraction took 6002.65ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 73.9MB in the beginning and 51.0MB in the end (delta: 23.0MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-07-12 03:57:52,658 INFO L158 Benchmark]: Witness Printer took 53.79ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 47.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:57:52,659 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.18ms. Allocated memory is still 83.9MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.25ms. Allocated memory is still 117.4MB. Free memory was 97.3MB in the beginning and 87.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.51ms. Allocated memory is still 117.4MB. Free memory was 87.0MB in the beginning and 85.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.71ms. Allocated memory is still 117.4MB. Free memory was 85.5MB in the beginning and 84.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 199.78ms. Allocated memory is still 117.4MB. Free memory was 84.4MB in the beginning and 74.5MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6002.65ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 73.9MB in the beginning and 51.0MB in the end (delta: 23.0MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Witness Printer took 53.79ms. Allocated memory is still 142.6MB. Free memory was 51.0MB in the beginning and 47.8MB in the end (delta: 3.1MB). 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 428 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 388 mSDsluCounter, 1359 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1002 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1701 IncrementalHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 357 mSDtfsCounter, 1701 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 649 SyntacticMatches, 14 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=9, InterpolantAutomatonStates: 104, 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, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 57 PreInvPairs, 102 NumberOfFragments, 405 HoareAnnotationTreeSize, 57 FomulaSimplifications, 387 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 2195 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 3458 SizeOfPredicates, 16 NumberOfNonLiveVariables, 616 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2737/2923 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((0 < buflim + 1 && buf == 0) && bufferlen == 2 + buflim) && bufferlen < inlen) && in == 0) || ((((((bufferlen + in + 1 <= buf + inlen && 2 + buflim <= bufferlen) && 1 <= in) && bufferlen <= 2 + buflim) && bufferlen < inlen) && buf + 2 <= bufferlen) && 0 <= buf) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 03:57:52,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE