./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/SpamAssassin-loop.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 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:02:30,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:02:30,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:02:30,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:02:30,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:02:30,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:02:30,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:02:30,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:02:30,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:02:30,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:02:30,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:02:30,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:02:30,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:02:30,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:02:30,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:02:30,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:02:30,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:02:30,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:02:31,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:02:31,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:02:31,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:02:31,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:02:31,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:02:31,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:02:31,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:02:31,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:02:31,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:02:31,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:02:31,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:02:31,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:02:31,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:02:31,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:02:31,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:02:31,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:02:31,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:02:31,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:02:31,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:02:31,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:02:31,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:02:31,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:02:31,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:02:31,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:02:31,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:02:31,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:02:31,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:02:31,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:02:31,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:02:31,058 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:02:31,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:02:31,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:02:31,059 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:02:31,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:02:31,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:02:31,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:02:31,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:02:31,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:02:31,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:02:31,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:02:31,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:02:31,061 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:02:31,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:02:31,061 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:02:31,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:02:31,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:02:31,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:02:31,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:02:31,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:31,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:02:31,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:02:31,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:02:31,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:02:31,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:02:31,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:02:31,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:02:31,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:02:31,064 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 -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 [2022-02-20 17:02:31,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:02:31,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:02:31,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:02:31,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:02:31,333 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:02:31,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2022-02-20 17:02:31,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56e3d05c/93d4f46895f74721a4ac8daff5b3ccda/FLAG15965b10f [2022-02-20 17:02:31,786 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:02:31,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2022-02-20 17:02:31,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56e3d05c/93d4f46895f74721a4ac8daff5b3ccda/FLAG15965b10f [2022-02-20 17:02:31,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56e3d05c/93d4f46895f74721a4ac8daff5b3ccda [2022-02-20 17:02:31,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:02:31,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:02:31,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:31,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:02:31,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:02:31,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:31" (1/1) ... [2022-02-20 17:02:31,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e19cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:31, skipping insertion in model container [2022-02-20 17:02:31,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:31" (1/1) ... [2022-02-20 17:02:31,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:02:31,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:02:31,962 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/SpamAssassin-loop.i[893,906] [2022-02-20 17:02:31,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:31,991 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:02:32,017 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/SpamAssassin-loop.i[893,906] [2022-02-20 17:02:32,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:32,040 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:02:32,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32 WrapperNode [2022-02-20 17:02:32,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:32,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:32,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:02:32,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:02:32,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,084 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-02-20 17:02:32,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:32,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:02:32,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:02:32,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:02:32,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:02:32,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:02:32,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:02:32,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:02:32,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:32,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:32,154 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-02-20 17:02:32,167 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-02-20 17:02:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:02:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:02:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:02:32,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:02:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:02:32,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:02:32,248 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:02:32,249 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:02:32,444 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:02:32,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:02:32,450 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:02:32,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:32 BoogieIcfgContainer [2022-02-20 17:02:32,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:02:32,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:02:32,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:02:32,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:02:32,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:02:31" (1/3) ... [2022-02-20 17:02:32,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:32, skipping insertion in model container [2022-02-20 17:02:32,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (2/3) ... [2022-02-20 17:02:32,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:32, skipping insertion in model container [2022-02-20 17:02:32,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:32" (3/3) ... [2022-02-20 17:02:32,464 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-02-20 17:02:32,475 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:02:32,476 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:02:32,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:02:32,566 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:02:32,566 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:02:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:02:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:02:32,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:32,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:32,596 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:32,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -667640892, now seen corresponding path program 1 times [2022-02-20 17:02:32,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:32,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690509437] [2022-02-20 17:02:32,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:32,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {41#true} is VALID [2022-02-20 17:02:32,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {41#true} is VALID [2022-02-20 17:02:32,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {41#true} is VALID [2022-02-20 17:02:32,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {41#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {43#(not (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:32,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {43#(not (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {43#(not (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:32,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#(not (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !(1 + main_~i~0#1 < main_~len~0#1); {43#(not (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:02:32,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#(not (<= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {44#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:32,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {44#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {45#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:32,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {45#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {42#false} is VALID [2022-02-20 17:02:32,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-02-20 17:02:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:32,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:32,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690509437] [2022-02-20 17:02:32,843 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690509437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:32,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:32,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:32,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22996164] [2022-02-20 17:02:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:32,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:02:32,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:32,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:32,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:32,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:32,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:32,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:32,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:32,905 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,280 INFO L93 Difference]: Finished difference Result 79 states and 142 transitions. [2022-02-20 17:02:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:33,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:02:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-02-20 17:02:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-02-20 17:02:33,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 142 transitions. [2022-02-20 17:02:33,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,461 INFO L225 Difference]: With dead ends: 79 [2022-02-20 17:02:33,461 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:02:33,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-20 17:02:33,467 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:33,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 155 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:02:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-02-20 17:02:33,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:33,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:02:33,511 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:02:33,511 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:02:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,517 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2022-02-20 17:02:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-02-20 17:02:33,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 40 states. [2022-02-20 17:02:33,520 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 40 states. [2022-02-20 17:02:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,524 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2022-02-20 17:02:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-02-20 17:02:33,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:33,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:02:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2022-02-20 17:02:33,542 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 10 [2022-02-20 17:02:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:33,542 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2022-02-20 17:02:33,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2022-02-20 17:02:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:02:33,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:33,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:33,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:02:33,544 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -689596859, now seen corresponding path program 1 times [2022-02-20 17:02:33,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:33,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719344645] [2022-02-20 17:02:33,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:33,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:33,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {310#true} is VALID [2022-02-20 17:02:33,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {310#true} is VALID [2022-02-20 17:02:33,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {310#true} is VALID [2022-02-20 17:02:33,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {310#true} is VALID [2022-02-20 17:02:33,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {310#true} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {310#true} is VALID [2022-02-20 17:02:33,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#true} assume 1 + main_~i~0#1 < main_~len~0#1; {312#(not (<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 17:02:33,606 INFO L272 TraceCheckUtils]: 6: Hoare triple {312#(not (<= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)))} call __VERIFIER_assert((if 1 + main_~i~0#1 < main_~len~0#1 then 1 else 0)); {313#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:33,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {314#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:33,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {311#false} is VALID [2022-02-20 17:02:33,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#false} assume !false; {311#false} is VALID [2022-02-20 17:02:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:33,608 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:33,608 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719344645] [2022-02-20 17:02:33,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719344645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:33,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:33,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:33,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839604121] [2022-02-20 17:02:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:33,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:02:33,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:33,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:33,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:33,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:33,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:33,620 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,878 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2022-02-20 17:02:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-02-20 17:02:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-02-20 17:02:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-02-20 17:02:33,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-02-20 17:02:33,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,958 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:02:33,959 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:02:33,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-20 17:02:33,964 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:33,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:33,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:02:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-02-20 17:02:33,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:33,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:33,986 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:33,986 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,990 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 17:02:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 17:02:33,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-02-20 17:02:33,993 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-02-20 17:02:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,997 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 17:02:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 17:02:33,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:33,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2022-02-20 17:02:34,002 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 10 [2022-02-20 17:02:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:34,002 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-02-20 17:02:34,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-02-20 17:02:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-02-20 17:02:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:02:34,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:34,003 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:34,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:02:34,003 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:34,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:34,004 INFO L85 PathProgramCache]: Analyzing trace with hash 214778336, now seen corresponding path program 1 times [2022-02-20 17:02:34,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:34,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474608807] [2022-02-20 17:02:34,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:34,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:34,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:02:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:34,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#true} ~cond := #in~cond; {570#true} is VALID [2022-02-20 17:02:34,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#true} assume !(0 == ~cond); {570#true} is VALID [2022-02-20 17:02:34,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#true} assume true; {570#true} is VALID [2022-02-20 17:02:34,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570#true} {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #103#return; {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:02:34,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {570#true} is VALID [2022-02-20 17:02:34,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {570#true} is VALID [2022-02-20 17:02:34,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:02:34,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:02:34,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:02:34,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(1 + main_~i~0#1 < main_~len~0#1); {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:02:34,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {570#true} is VALID [2022-02-20 17:02:34,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#true} ~cond := #in~cond; {570#true} is VALID [2022-02-20 17:02:34,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#true} assume !(0 == ~cond); {570#true} is VALID [2022-02-20 17:02:34,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {570#true} assume true; {570#true} is VALID [2022-02-20 17:02:34,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {570#true} {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #103#return; {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 17:02:34,132 INFO L272 TraceCheckUtils]: 11: Hoare triple {572#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:34,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {577#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {578#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:34,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {571#false} is VALID [2022-02-20 17:02:34,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#false} assume !false; {571#false} is VALID [2022-02-20 17:02:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:34,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:34,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474608807] [2022-02-20 17:02:34,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474608807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:34,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:34,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:34,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119787055] [2022-02-20 17:02:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:34,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2022-02-20 17:02:34,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:34,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:34,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:34,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:34,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:34,152 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,357 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 17:02:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:34,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2022-02-20 17:02:34,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 17:02:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-02-20 17:02:34,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-02-20 17:02:34,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,426 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:02:34,427 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:02:34,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-02-20 17:02:34,428 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:34,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 123 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:34,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:02:34,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 17:02:34,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:34,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:34,457 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:34,458 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,461 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-02-20 17:02:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-02-20 17:02:34,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-02-20 17:02:34,463 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 51 states. [2022-02-20 17:02:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,466 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-02-20 17:02:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-02-20 17:02:34,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:34,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-02-20 17:02:34,471 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 15 [2022-02-20 17:02:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:34,471 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-02-20 17:02:34,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-02-20 17:02:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-02-20 17:02:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:02:34,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:34,472 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:34,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:02:34,473 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1804674308, now seen corresponding path program 1 times [2022-02-20 17:02:34,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:34,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732483039] [2022-02-20 17:02:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:34,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:02:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:34,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-02-20 17:02:34,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-02-20 17:02:34,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 17:02:34,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {837#true} {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #103#return; {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:34,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-02-20 17:02:34,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-02-20 17:02:34,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 17:02:34,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {837#true} {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #105#return; {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {837#true} is VALID [2022-02-20 17:02:34,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {837#true} is VALID [2022-02-20 17:02:34,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {837#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {839#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {839#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {839#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {839#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} assume !(1 + main_~i~0#1 < main_~len~0#1); {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {837#true} is VALID [2022-02-20 17:02:34,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-02-20 17:02:34,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-02-20 17:02:34,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 17:02:34,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {837#true} {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #103#return; {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,557 INFO L272 TraceCheckUtils]: 11: Hoare triple {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {837#true} is VALID [2022-02-20 17:02:34,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#true} ~cond := #in~cond; {837#true} is VALID [2022-02-20 17:02:34,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#true} assume !(0 == ~cond); {837#true} is VALID [2022-02-20 17:02:34,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#true} assume true; {837#true} is VALID [2022-02-20 17:02:34,558 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {837#true} {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #105#return; {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:34,559 INFO L272 TraceCheckUtils]: 16: Hoare triple {840#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:34,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {849#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {850#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:34,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {850#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {838#false} is VALID [2022-02-20 17:02:34,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {838#false} assume !false; {838#false} is VALID [2022-02-20 17:02:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:02:34,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:34,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732483039] [2022-02-20 17:02:34,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732483039] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:34,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:34,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:34,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713542573] [2022-02-20 17:02:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:34,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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 20 [2022-02-20 17:02:34,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:34,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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-02-20 17:02:34,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:34,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:34,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:34,576 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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-02-20 17:02:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,911 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-02-20 17:02:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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 20 [2022-02-20 17:02:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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-02-20 17:02:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-02-20 17:02:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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-02-20 17:02:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-02-20 17:02:34,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2022-02-20 17:02:34,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,971 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:02:34,972 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 17:02:34,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-02-20 17:02:34,973 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:34,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 164 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 17:02:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 17:02:35,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:35,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,015 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,016 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,019 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-02-20 17:02:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-02-20 17:02:35,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-02-20 17:02:35,021 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-02-20 17:02:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,023 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-02-20 17:02:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-02-20 17:02:35,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:35,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-02-20 17:02:35,028 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 20 [2022-02-20 17:02:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:35,028 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-02-20 17:02:35,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 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-02-20 17:02:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-02-20 17:02:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:02:35,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:35,029 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:35,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:02:35,030 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1749987360, now seen corresponding path program 1 times [2022-02-20 17:02:35,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:35,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811765338] [2022-02-20 17:02:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:35,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:02:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {1129#true} ~cond := #in~cond; {1129#true} is VALID [2022-02-20 17:02:35,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume !(0 == ~cond); {1129#true} is VALID [2022-02-20 17:02:35,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-02-20 17:02:35,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} #103#return; {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {1129#true} ~cond := #in~cond; {1129#true} is VALID [2022-02-20 17:02:35,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume !(0 == ~cond); {1129#true} is VALID [2022-02-20 17:02:35,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-02-20 17:02:35,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} #105#return; {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 17:02:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {1129#true} ~cond := #in~cond; {1129#true} is VALID [2022-02-20 17:02:35,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume !(0 == ~cond); {1129#true} is VALID [2022-02-20 17:02:35,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-02-20 17:02:35,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1129#true} {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} #107#return; {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {1129#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1129#true} is VALID [2022-02-20 17:02:35,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1129#true} is VALID [2022-02-20 17:02:35,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1129#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {1129#true} is VALID [2022-02-20 17:02:35,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {1129#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !(1 + main_~i~0#1 < main_~len~0#1); {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {1129#true} is VALID [2022-02-20 17:02:35,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1129#true} ~cond := #in~cond; {1129#true} is VALID [2022-02-20 17:02:35,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {1129#true} assume !(0 == ~cond); {1129#true} is VALID [2022-02-20 17:02:35,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-02-20 17:02:35,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1129#true} {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} #103#return; {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {1129#true} is VALID [2022-02-20 17:02:35,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {1129#true} ~cond := #in~cond; {1129#true} is VALID [2022-02-20 17:02:35,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {1129#true} assume !(0 == ~cond); {1129#true} is VALID [2022-02-20 17:02:35,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-02-20 17:02:35,105 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1129#true} {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} #105#return; {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,106 INFO L272 TraceCheckUtils]: 16: Hoare triple {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {1129#true} is VALID [2022-02-20 17:02:35,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {1129#true} ~cond := #in~cond; {1129#true} is VALID [2022-02-20 17:02:35,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {1129#true} assume !(0 == ~cond); {1129#true} is VALID [2022-02-20 17:02:35,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {1129#true} assume true; {1129#true} is VALID [2022-02-20 17:02:35,107 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1129#true} {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} #107#return; {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 17:02:35,110 INFO L272 TraceCheckUtils]: 21: Hoare triple {1131#(<= 0 |ULTIMATE.start_main_~j~0#1|)} call __VERIFIER_assert((if 0 <= main_~j~0#1 then 1 else 0)); {1144#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:35,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {1144#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1145#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:35,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {1145#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1130#false} is VALID [2022-02-20 17:02:35,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {1130#false} assume !false; {1130#false} is VALID [2022-02-20 17:02:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:02:35,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:35,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811765338] [2022-02-20 17:02:35,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811765338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:35,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:35,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:35,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175317381] [2022-02-20 17:02:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:35,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-02-20 17:02:35,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:35,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:02:35,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:35,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:35,134 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:02:35,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,358 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-02-20 17:02:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:35,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-02-20 17:02:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:02:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-20 17:02:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:02:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-02-20 17:02:35,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-02-20 17:02:35,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,423 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:02:35,423 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 17:02:35,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-02-20 17:02:35,424 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:35,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 133 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 17:02:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-02-20 17:02:35,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:35,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,475 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,476 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,478 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-02-20 17:02:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-02-20 17:02:35,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 60 states. [2022-02-20 17:02:35,480 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 60 states. [2022-02-20 17:02:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,482 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-02-20 17:02:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-02-20 17:02:35,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:35,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-02-20 17:02:35,486 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 25 [2022-02-20 17:02:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:35,486 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-02-20 17:02:35,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:02:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-20 17:02:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 17:02:35,487 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:35,487 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:35,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 17:02:35,487 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 158999923, now seen corresponding path program 1 times [2022-02-20 17:02:35,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:35,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545902925] [2022-02-20 17:02:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:02:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #79#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #81#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:02:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #83#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 17:02:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #85#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 17:02:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #87#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 17:02:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #89#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {1444#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1444#true} is VALID [2022-02-20 17:02:35,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {1444#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1444#true} is VALID [2022-02-20 17:02:35,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {1444#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {1444#true} is VALID [2022-02-20 17:02:35,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {1444#true} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {1444#true} is VALID [2022-02-20 17:02:35,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {1444#true} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {1444#true} is VALID [2022-02-20 17:02:35,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {1444#true} assume 1 + main_~i~0#1 < main_~len~0#1; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call __VERIFIER_assert((if 1 + main_~i~0#1 < main_~len~0#1 then 1 else 0)); {1444#true} is VALID [2022-02-20 17:02:35,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #79#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,615 INFO L272 TraceCheckUtils]: 11: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {1444#true} is VALID [2022-02-20 17:02:35,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,616 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #81#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,617 INFO L272 TraceCheckUtils]: 18: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {1444#true} is VALID [2022-02-20 17:02:35,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,618 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #83#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,618 INFO L272 TraceCheckUtils]: 23: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {1444#true} is VALID [2022-02-20 17:02:35,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,619 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #85#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,620 INFO L272 TraceCheckUtils]: 28: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {1444#true} is VALID [2022-02-20 17:02:35,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,621 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #87#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,621 INFO L272 TraceCheckUtils]: 33: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} call __VERIFIER_assert((if 0 <= main_~j~0#1 then 1 else 0)); {1444#true} is VALID [2022-02-20 17:02:35,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {1444#true} ~cond := #in~cond; {1444#true} is VALID [2022-02-20 17:02:35,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {1444#true} assume !(0 == ~cond); {1444#true} is VALID [2022-02-20 17:02:35,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {1444#true} assume true; {1444#true} is VALID [2022-02-20 17:02:35,622 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1444#true} {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} #89#return; {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {1446#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|)} main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1471#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 17:02:35,623 INFO L272 TraceCheckUtils]: 39: Hoare triple {1471#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {1472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:35,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {1472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:35,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {1473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1445#false} is VALID [2022-02-20 17:02:35,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {1445#false} assume !false; {1445#false} is VALID [2022-02-20 17:02:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-20 17:02:35,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:35,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545902925] [2022-02-20 17:02:35,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545902925] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:35,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:35,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:35,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102635383] [2022-02-20 17:02:35,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:35,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-02-20 17:02:35,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:35,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:02:35,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:35,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:35,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:35,653 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:02:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,022 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-02-20 17:02:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-02-20 17:02:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:02:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 17:02:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:02:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 17:02:36,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-02-20 17:02:36,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,095 INFO L225 Difference]: With dead ends: 71 [2022-02-20 17:02:36,095 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 17:02:36,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:36,096 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:36,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 171 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 17:02:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2022-02-20 17:02:36,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:36,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,163 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,163 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,166 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-02-20 17:02:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-02-20 17:02:36,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 69 states. [2022-02-20 17:02:36,167 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 69 states. [2022-02-20 17:02:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,170 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-02-20 17:02:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-02-20 17:02:36,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:36,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-02-20 17:02:36,173 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 43 [2022-02-20 17:02:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:36,173 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-02-20 17:02:36,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 17:02:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-02-20 17:02:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 17:02:36,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:36,175 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 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-02-20 17:02:36,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 17:02:36,175 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1329631219, now seen corresponding path program 1 times [2022-02-20 17:02:36,175 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:36,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782701960] [2022-02-20 17:02:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:02:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #79#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #81#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:02:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #83#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 17:02:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #85#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 17:02:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #87#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 17:02:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #89#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 17:02:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #91#return; {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 17:02:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #93#return; {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {1809#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1809#true} is VALID [2022-02-20 17:02:36,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1809#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1809#true} is VALID [2022-02-20 17:02:36,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {1809#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {1811#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {1811#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {1811#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {1811#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} assume 1 + main_~i~0#1 < main_~len~0#1; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 1 + main_~i~0#1 < main_~len~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #79#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,301 INFO L272 TraceCheckUtils]: 11: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,302 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #81#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,303 INFO L272 TraceCheckUtils]: 18: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,304 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #83#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,304 INFO L272 TraceCheckUtils]: 23: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,305 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #85#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,305 INFO L272 TraceCheckUtils]: 28: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,306 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #87#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,306 INFO L272 TraceCheckUtils]: 33: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~j~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,307 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1809#true} {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #89#return; {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {1812#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,307 INFO L272 TraceCheckUtils]: 39: Hoare triple {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,308 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1809#true} {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #91#return; {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,309 INFO L272 TraceCheckUtils]: 44: Hoare triple {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {1809#true} is VALID [2022-02-20 17:02:36,309 INFO L290 TraceCheckUtils]: 45: Hoare triple {1809#true} ~cond := #in~cond; {1809#true} is VALID [2022-02-20 17:02:36,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {1809#true} assume !(0 == ~cond); {1809#true} is VALID [2022-02-20 17:02:36,309 INFO L290 TraceCheckUtils]: 47: Hoare triple {1809#true} assume true; {1809#true} is VALID [2022-02-20 17:02:36,310 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1809#true} {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #93#return; {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:36,310 INFO L272 TraceCheckUtils]: 49: Hoare triple {1837#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {1846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:36,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {1846#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1847#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:36,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {1847#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1810#false} is VALID [2022-02-20 17:02:36,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2022-02-20 17:02:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-20 17:02:36,312 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:36,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782701960] [2022-02-20 17:02:36,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782701960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:36,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:36,312 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 17:02:36,312 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669042132] [2022-02-20 17:02:36,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:36,313 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2022-02-20 17:02:36,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:36,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:02:36,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:02:36,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:02:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:36,343 INFO L87 Difference]: Start difference. First operand 63 states and 75 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:02:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,735 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-02-20 17:02:36,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:02:36,735 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2022-02-20 17:02:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:02:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-02-20 17:02:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:02:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-02-20 17:02:36,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-02-20 17:02:36,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,809 INFO L225 Difference]: With dead ends: 71 [2022-02-20 17:02:36,809 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 17:02:36,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:02:36,811 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:36,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 161 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 17:02:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-02-20 17:02:36,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:36,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,890 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,890 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,893 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-02-20 17:02:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-02-20 17:02:36,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 69 states. [2022-02-20 17:02:36,896 INFO L87 Difference]: Start difference. First operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 69 states. [2022-02-20 17:02:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,900 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-02-20 17:02:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-02-20 17:02:36,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:36,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-02-20 17:02:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-02-20 17:02:36,903 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 53 [2022-02-20 17:02:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:36,904 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-02-20 17:02:36,904 INFO L471 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 17:02:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-02-20 17:02:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 17:02:36,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:36,905 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:36,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 17:02:36,905 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:02:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1418667265, now seen corresponding path program 1 times [2022-02-20 17:02:36,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:36,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341097459] [2022-02-20 17:02:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:36,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:02:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #79#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 17:02:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #81#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 17:02:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #83#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 17:02:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #85#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 17:02:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #87#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 17:02:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #89#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 17:02:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #91#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 17:02:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #93#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 17:02:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #95#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 17:02:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #97#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {2190#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2190#true} is VALID [2022-02-20 17:02:37,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2190#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~post4#1, main_#t~post5#1, main_#t~post6#1, main_#t~post7#1, main_#t~post8#1, main_#t~post9#1, main_#t~post10#1, main_~len~0#1, main_~i~0#1, main_~j~0#1, main_~bufsize~0#1, main_~limit~0#1;havoc main_~len~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~bufsize~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~bufsize~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {2190#true} is VALID [2022-02-20 17:02:37,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {2190#true} assume !(main_~bufsize~0#1 < 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~len~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~limit~0#1 := main_~bufsize~0#1 - 4;main_~i~0#1 := 0; {2192#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {2192#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1);main_~j~0#1 := 0; {2192#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {2192#(<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} assume !!(main_~i~0#1 < main_~len~0#1 && main_~j~0#1 < main_~limit~0#1); {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} assume 1 + main_~i~0#1 < main_~len~0#1; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 1 + main_~i~0#1 < main_~len~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #79#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,083 INFO L272 TraceCheckUtils]: 11: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,084 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #81#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,087 INFO L272 TraceCheckUtils]: 18: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,088 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #83#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,089 INFO L272 TraceCheckUtils]: 23: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,090 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #85#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,090 INFO L272 TraceCheckUtils]: 28: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,093 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #87#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,093 INFO L272 TraceCheckUtils]: 33: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~j~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,094 INFO L290 TraceCheckUtils]: 35: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,094 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2190#true} {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} #89#return; {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#(<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} main_#t~post4#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1;main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,095 INFO L272 TraceCheckUtils]: 39: Hoare triple {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~i~0#1 < main_~len~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,096 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #91#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,096 INFO L272 TraceCheckUtils]: 44: Hoare triple {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~i~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,097 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #93#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,097 INFO L272 TraceCheckUtils]: 49: Hoare triple {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,098 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #95#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,098 INFO L272 TraceCheckUtils]: 54: Hoare triple {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if 0 <= main_~j~0#1 then 1 else 0)); {2190#true} is VALID [2022-02-20 17:02:37,099 INFO L290 TraceCheckUtils]: 55: Hoare triple {2190#true} ~cond := #in~cond; {2190#true} is VALID [2022-02-20 17:02:37,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {2190#true} assume !(0 == ~cond); {2190#true} is VALID [2022-02-20 17:02:37,099 INFO L290 TraceCheckUtils]: 57: Hoare triple {2190#true} assume true; {2190#true} is VALID [2022-02-20 17:02:37,100 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2190#true} {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} #97#return; {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {2218#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)} main_#t~post6#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2235#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} is VALID [2022-02-20 17:02:37,102 INFO L272 TraceCheckUtils]: 60: Hoare triple {2235#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|)} call __VERIFIER_assert((if main_~j~0#1 < main_~bufsize~0#1 then 1 else 0)); {2236#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:02:37,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {2236#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2237#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:02:37,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {2237#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2191#false} is VALID [2022-02-20 17:02:37,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {2191#false} assume !false; {2191#false} is VALID [2022-02-20 17:02:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-02-20 17:02:37,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:37,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341097459] [2022-02-20 17:02:37,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341097459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:37,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:37,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 17:02:37,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043005735] [2022-02-20 17:02:37,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:37,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-02-20 17:02:37,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:37,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 17:02:37,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:37,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:02:37,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:37,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:02:37,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:37,137 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 17:02:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:37,629 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-02-20 17:02:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:02:37,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-02-20 17:02:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 17:02:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-20 17:02:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 17:02:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-20 17:02:37,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-02-20 17:02:37,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:37,685 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:02:37,685 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:02:37,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:02:37,686 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:37,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 188 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:02:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:02:37,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:37,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-02-20 17:02:37,687 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-02-20 17:02:37,688 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-02-20 17:02:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:37,688 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:37,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:37,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:37,688 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 17:02:37,688 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 17:02:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:37,688 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:37,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:37,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:37,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:37,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:37,689 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-02-20 17:02:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:02:37,689 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2022-02-20 17:02:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:37,689 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:02:37,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 17:02:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:37,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:37,692 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:02:37,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 17:02:37,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:02:38,117 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,118 INFO L858 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-02-20 17:02:38,118 INFO L858 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-02-20 17:02:38,118 INFO L854 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,118 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,118 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,118 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,119 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,119 INFO L854 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,119 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 63) no Hoare annotation was computed. [2022-02-20 17:02:38,119 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:02:38,119 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:02:38,119 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:02:38,119 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,119 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-02-20 17:02:38,120 INFO L858 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-02-20 17:02:38,120 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,120 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,120 INFO L854 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,120 INFO L861 garLoopResultBuilder]: At program point L66(lines 24 67) the Hoare annotation is: true [2022-02-20 17:02:38,121 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:02:38,121 INFO L854 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,121 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,121 INFO L854 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,121 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,121 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-02-20 17:02:38,121 INFO L854 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,121 INFO L858 garLoopResultBuilder]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2022-02-20 17:02:38,121 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,122 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-02-20 17:02:38,122 INFO L858 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-02-20 17:02:38,122 INFO L858 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-02-20 17:02:38,122 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-02-20 17:02:38,122 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-02-20 17:02:38,123 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-02-20 17:02:38,123 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-20 17:02:38,123 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-02-20 17:02:38,123 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-02-20 17:02:38,126 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:38,127 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:02:38,130 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:02:38,130 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:02:38,130 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:02:38,130 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:02:38,131 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-02-20 17:02:38,132 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-02-20 17:02:38,133 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,133 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,133 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,133 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,134 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,135 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,135 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,135 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,135 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:02:38,135 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:02:38,135 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-02-20 17:02:38,138 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 17:02:38,138 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:02:38,138 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 17:02:38,138 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 17:02:38,138 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 17:02:38,138 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:02:38,138 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 17:02:38,139 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 17:02:38,140 INFO L163 areAnnotationChecker]: CFG has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:02:38,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:02:38 BoogieIcfgContainer [2022-02-20 17:02:38,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:02:38,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:02:38,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:02:38,158 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:02:38,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:32" (3/4) ... [2022-02-20 17:02:38,161 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:02:38,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:02:38,171 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 17:02:38,171 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 17:02:38,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:02:38,172 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:02:38,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:02:38,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:02:38,219 INFO L158 Benchmark]: Toolchain (without parser) took 6407.64ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 39.9MB in the beginning and 77.9MB in the end (delta: -37.9MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2022-02-20 17:02:38,219 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:02:38,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.58ms. Allocated memory is still 98.6MB. Free memory was 78.8MB in the beginning and 68.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:02:38,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.22ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:02:38,220 INFO L158 Benchmark]: Boogie Preprocessor took 32.74ms. Allocated memory is still 98.6MB. Free memory was 66.0MB in the beginning and 64.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:02:38,220 INFO L158 Benchmark]: RCFGBuilder took 333.51ms. Allocated memory is still 98.6MB. Free memory was 64.9MB in the beginning and 68.2MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:02:38,220 INFO L158 Benchmark]: TraceAbstraction took 5704.57ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 67.7MB in the beginning and 81.0MB in the end (delta: -13.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2022-02-20 17:02:38,221 INFO L158 Benchmark]: Witness Printer took 59.62ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 77.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:02:38,226 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.58ms. Allocated memory is still 98.6MB. Free memory was 78.8MB in the beginning and 68.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.22ms. Allocated memory is still 98.6MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.74ms. Allocated memory is still 98.6MB. Free memory was 66.0MB in the beginning and 64.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 333.51ms. Allocated memory is still 98.6MB. Free memory was 64.9MB in the beginning and 68.2MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5704.57ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 67.7MB in the beginning and 81.0MB in the end (delta: -13.3MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 59.62ms. Allocated memory is still 151.0MB. Free memory was 81.0MB in the beginning and 77.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 1277 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 907 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 370 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 52 PreInvPairs, 74 NumberOfFragments, 365 HoareAnnotationTreeSize, 52 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize RESULT: Ultimate proved your program to be correct! [2022-02-20 17:02:38,279 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