/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/string-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 11:00:20,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 11:00:20,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 11:00:20,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 11:00:20,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 11:00:20,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 11:00:20,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 11:00:20,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 11:00:20,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 11:00:20,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 11:00:20,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 11:00:20,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 11:00:20,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 11:00:20,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 11:00:20,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 11:00:20,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 11:00:20,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 11:00:20,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 11:00:20,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 11:00:20,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 11:00:20,171 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 11:00:20,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 11:00:20,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 11:00:20,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 11:00:20,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 11:00:20,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 11:00:20,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 11:00:20,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 11:00:20,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 11:00:20,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 11:00:20,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 11:00:20,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 11:00:20,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 11:00:20,178 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 11:00:20,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 11:00:20,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 11:00:20,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 11:00:20,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 11:00:20,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 11:00:20,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 11:00:20,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 11:00:20,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 11:00:20,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 11:00:20,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 11:00:20,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 11:00:20,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 11:00:20,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 11:00:20,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 11:00:20,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 11:00:20,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 11:00:20,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 11:00:20,196 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 11:00:20,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 11:00:20,196 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 11:00:20,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 11:00:20,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 11:00:20,197 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 11:00:20,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 11:00:20,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 11:00:20,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 11:00:20,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:00:20,198 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 11:00:20,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 11:00:20,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 11:00:20,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 11:00:20,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 11:00:20,199 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 11:00:20,199 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 11:00:20,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 11:00:20,199 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 11:00:20,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 11:00:20,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 11:00:20,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 11:00:20,390 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 11:00:20,391 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 11:00:20,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-1.i [2022-04-07 11:00:20,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0abb2f8a9/4a4c52fd0e894c9cb9a3598553b19e89/FLAGcd36b6981 [2022-04-07 11:00:20,752 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 11:00:20,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i [2022-04-07 11:00:20,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0abb2f8a9/4a4c52fd0e894c9cb9a3598553b19e89/FLAGcd36b6981 [2022-04-07 11:00:21,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0abb2f8a9/4a4c52fd0e894c9cb9a3598553b19e89 [2022-04-07 11:00:21,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 11:00:21,216 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 11:00:21,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 11:00:21,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 11:00:21,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 11:00:21,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6b1b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21, skipping insertion in model container [2022-04-07 11:00:21,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 11:00:21,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 11:00:21,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2022-04-07 11:00:21,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:00:21,422 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 11:00:21,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2022-04-07 11:00:21,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:00:21,451 INFO L208 MainTranslator]: Completed translation [2022-04-07 11:00:21,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21 WrapperNode [2022-04-07 11:00:21,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 11:00:21,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 11:00:21,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 11:00:21,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 11:00:21,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 11:00:21,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 11:00:21,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 11:00:21,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 11:00:21,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (1/1) ... [2022-04-07 11:00:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:00:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:21,526 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-04-07 11:00:21,534 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-04-07 11:00:21,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 11:00:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 11:00:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 11:00:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 11:00:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 11:00:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 11:00:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 11:00:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 11:00:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 11:00:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 11:00:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 11:00:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 11:00:21,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 11:00:21,615 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 11:00:21,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 11:00:21,823 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 11:00:21,827 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 11:00:21,828 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-07 11:00:21,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:00:21 BoogieIcfgContainer [2022-04-07 11:00:21,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 11:00:21,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 11:00:21,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 11:00:21,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 11:00:21,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:00:21" (1/3) ... [2022-04-07 11:00:21,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf90089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:00:21, skipping insertion in model container [2022-04-07 11:00:21,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:21" (2/3) ... [2022-04-07 11:00:21,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf90089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:00:21, skipping insertion in model container [2022-04-07 11:00:21,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:00:21" (3/3) ... [2022-04-07 11:00:21,834 INFO L111 eAbstractionObserver]: Analyzing ICFG string-1.i [2022-04-07 11:00:21,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 11:00:21,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 11:00:21,866 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 11:00:21,871 INFO L340 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 [2022-04-07 11:00:21,871 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 11:00:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 11:00:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 11:00:21,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:21,888 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:00:21,889 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:21,893 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 1 times [2022-04-07 11:00:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:21,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418931039] [2022-04-07 11:00:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:22,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {38#true} is VALID [2022-04-07 11:00:22,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-07 11:00:22,066 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-07 11:00:22,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:00:22,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {38#true} is VALID [2022-04-07 11:00:22,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-07 11:00:22,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-07 11:00:22,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2022-04-07 11:00:22,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {43#(= main_~i~0 0)} is VALID [2022-04-07 11:00:22,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(= main_~i~0 0)} assume !(~i~0 < 5); {39#false} is VALID [2022-04-07 11:00:22,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {39#false} is VALID [2022-04-07 11:00:22,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {39#false} is VALID [2022-04-07 11:00:22,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2022-04-07 11:00:22,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {39#false} is VALID [2022-04-07 11:00:22,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {39#false} is VALID [2022-04-07 11:00:22,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-07 11:00:22,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2022-04-07 11:00:22,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-07 11:00:22,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {39#false} is VALID [2022-04-07 11:00:22,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-07 11:00:22,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {39#false} is VALID [2022-04-07 11:00:22,070 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {39#false} is VALID [2022-04-07 11:00:22,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-07 11:00:22,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-07 11:00:22,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-07 11:00:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 11:00:22,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418931039] [2022-04-07 11:00:22,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418931039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:00:22,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:00:22,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 11:00:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637742505] [2022-04-07 11:00:22,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:00:22,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 11:00:22,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:22,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:22,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 11:00:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:22,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 11:00:22,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 11:00:22,129 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:22,369 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2022-04-07 11:00:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 11:00:22,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 11:00:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-07 11:00:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-07 11:00:22,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-07 11:00:22,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:22,492 INFO L225 Difference]: With dead ends: 73 [2022-04-07 11:00:22,492 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 11:00:22,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 11:00:22,499 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 47 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:00:22,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 45 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:00:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 11:00:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-07 11:00:22,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:22,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,526 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,526 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:22,528 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-07 11:00:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 11:00:22,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:22,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:22,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-07 11:00:22,530 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-07 11:00:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:22,531 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-07 11:00:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 11:00:22,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:22,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:22,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:22,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-07 11:00:22,534 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2022-04-07 11:00:22,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:22,535 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-07 11:00:22,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-07 11:00:22,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 11:00:22,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:22,536 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:00:22,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 11:00:22,536 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 1 times [2022-04-07 11:00:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:22,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669732355] [2022-04-07 11:00:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:22,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {258#true} is VALID [2022-04-07 11:00:22,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:22,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:22,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:00:22,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {258#true} is VALID [2022-04-07 11:00:22,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:22,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:22,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret15 := main(); {258#true} is VALID [2022-04-07 11:00:22,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {263#(= main_~i~0 0)} is VALID [2022-04-07 11:00:22,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {263#(= main_~i~0 0)} is VALID [2022-04-07 11:00:22,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {264#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:22,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= main_~i~0 1)} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:22,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {259#false} is VALID [2022-04-07 11:00:22,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {259#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {259#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {259#false} is VALID [2022-04-07 11:00:22,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {259#false} is VALID [2022-04-07 11:00:22,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:22,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {259#false} is VALID [2022-04-07 11:00:22,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {259#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {259#false} is VALID [2022-04-07 11:00:22,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#false} assume !(0 != #t~mem7);havoc #t~mem7; {259#false} is VALID [2022-04-07 11:00:22,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {259#false} ~nc_B~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {259#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {259#false} is VALID [2022-04-07 11:00:22,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {259#false} assume !(0 != #t~mem9);havoc #t~mem9; {259#false} is VALID [2022-04-07 11:00:22,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {259#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {259#false} is VALID [2022-04-07 11:00:22,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {259#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {259#false} is VALID [2022-04-07 11:00:22,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {259#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {259#false} is VALID [2022-04-07 11:00:22,612 INFO L272 TraceCheckUtils]: 24: Hoare triple {259#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {259#false} is VALID [2022-04-07 11:00:22,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {259#false} ~cond := #in~cond; {259#false} is VALID [2022-04-07 11:00:22,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {259#false} assume 0 == ~cond; {259#false} is VALID [2022-04-07 11:00:22,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-07 11:00:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 11:00:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:22,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669732355] [2022-04-07 11:00:22,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669732355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:00:22,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086171644] [2022-04-07 11:00:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:22,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 11:00:22,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 11:00:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:22,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 11:00:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:22,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:00:22,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2022-04-07 11:00:22,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#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(11, 2); {258#true} is VALID [2022-04-07 11:00:22,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:22,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:22,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret15 := main(); {258#true} is VALID [2022-04-07 11:00:22,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {284#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:22,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {284#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:22,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {264#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:22,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= main_~i~0 1)} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:22,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {259#false} is VALID [2022-04-07 11:00:22,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {259#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {259#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {259#false} is VALID [2022-04-07 11:00:22,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {259#false} is VALID [2022-04-07 11:00:22,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:22,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {259#false} is VALID [2022-04-07 11:00:22,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {259#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {259#false} is VALID [2022-04-07 11:00:22,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#false} assume !(0 != #t~mem7);havoc #t~mem7; {259#false} is VALID [2022-04-07 11:00:22,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {259#false} ~nc_B~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {259#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {259#false} is VALID [2022-04-07 11:00:22,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {259#false} assume !(0 != #t~mem9);havoc #t~mem9; {259#false} is VALID [2022-04-07 11:00:22,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {259#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {259#false} is VALID [2022-04-07 11:00:22,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {259#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {259#false} is VALID [2022-04-07 11:00:22,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {259#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {259#false} is VALID [2022-04-07 11:00:22,832 INFO L272 TraceCheckUtils]: 24: Hoare triple {259#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {259#false} is VALID [2022-04-07 11:00:22,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {259#false} ~cond := #in~cond; {259#false} is VALID [2022-04-07 11:00:22,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {259#false} assume 0 == ~cond; {259#false} is VALID [2022-04-07 11:00:22,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-07 11:00:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 11:00:22,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:00:22,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-07 11:00:22,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {259#false} assume 0 == ~cond; {259#false} is VALID [2022-04-07 11:00:22,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {259#false} ~cond := #in~cond; {259#false} is VALID [2022-04-07 11:00:22,925 INFO L272 TraceCheckUtils]: 24: Hoare triple {259#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {259#false} is VALID [2022-04-07 11:00:22,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {259#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {259#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {259#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 20: Hoare triple {259#false} assume !(0 != #t~mem9);havoc #t~mem9; {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 19: Hoare triple {259#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {259#false} ~nc_B~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#false} assume !(0 != #t~mem7);havoc #t~mem7; {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {259#false} is VALID [2022-04-07 11:00:22,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {259#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {259#false} is VALID [2022-04-07 11:00:22,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:22,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {259#false} is VALID [2022-04-07 11:00:22,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {259#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {259#false} is VALID [2022-04-07 11:00:22,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {259#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {259#false} is VALID [2022-04-07 11:00:22,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {259#false} is VALID [2022-04-07 11:00:22,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {408#(< main_~i~0 5)} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:22,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {412#(< main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {408#(< main_~i~0 5)} is VALID [2022-04-07 11:00:22,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {412#(< main_~i~0 4)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {412#(< main_~i~0 4)} is VALID [2022-04-07 11:00:22,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {412#(< main_~i~0 4)} is VALID [2022-04-07 11:00:22,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret15 := main(); {258#true} is VALID [2022-04-07 11:00:22,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:22,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:22,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#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(11, 2); {258#true} is VALID [2022-04-07 11:00:22,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2022-04-07 11:00:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 11:00:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086171644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:00:22,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:00:22,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 11:00:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444726353] [2022-04-07 11:00:22,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:00:22,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-07 11:00:22,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:22,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:22,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:22,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 11:00:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 11:00:22,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 11:00:22,957 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:23,148 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-07 11:00:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:00:23,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-07 11:00:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-07 11:00:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-07 11:00:23,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-07 11:00:23,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:23,229 INFO L225 Difference]: With dead ends: 79 [2022-04-07 11:00:23,230 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 11:00:23,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-07 11:00:23,231 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:00:23,231 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 32 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:00:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 11:00:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-04-07 11:00:23,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:23,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,243 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,244 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:23,248 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-07 11:00:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-07 11:00:23,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:23,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:23,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-07 11:00:23,251 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-07 11:00:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:23,257 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-07 11:00:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-07 11:00:23,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:23,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:23,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:23,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-07 11:00:23,264 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2022-04-07 11:00:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:23,264 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-07 11:00:23,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-07 11:00:23,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 11:00:23,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:23,265 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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-04-07 11:00:23,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 11:00:23,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:23,495 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:23,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 173558265, now seen corresponding path program 2 times [2022-04-07 11:00:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:23,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686798623] [2022-04-07 11:00:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:23,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:23,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {734#true} is VALID [2022-04-07 11:00:23,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {734#true} assume true; {734#true} is VALID [2022-04-07 11:00:23,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {734#true} {734#true} #124#return; {734#true} is VALID [2022-04-07 11:00:23,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {734#true} call ULTIMATE.init(); {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:00:23,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {734#true} is VALID [2022-04-07 11:00:23,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {734#true} assume true; {734#true} is VALID [2022-04-07 11:00:23,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {734#true} {734#true} #124#return; {734#true} is VALID [2022-04-07 11:00:23,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {734#true} call #t~ret15 := main(); {734#true} is VALID [2022-04-07 11:00:23,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {734#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {739#(= main_~i~0 0)} is VALID [2022-04-07 11:00:23,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {739#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {739#(= main_~i~0 0)} is VALID [2022-04-07 11:00:23,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {739#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {740#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:23,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {740#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {740#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:23,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {740#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {741#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:23,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {741#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {741#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:23,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {741#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {742#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:23,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {742#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {742#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:23,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {742#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {743#(<= main_~i~0 4)} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(<= main_~i~0 4)} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {735#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {735#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {735#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {735#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {735#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {735#false} is VALID [2022-04-07 11:00:23,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {735#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {735#false} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {735#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {735#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {735#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {735#false} assume !(0 != #t~mem7);havoc #t~mem7; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {735#false} ~nc_B~0 := 0; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {735#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {735#false} assume !(0 != #t~mem9);havoc #t~mem9; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {735#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {735#false} is VALID [2022-04-07 11:00:23,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {735#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {735#false} is VALID [2022-04-07 11:00:23,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {735#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {735#false} is VALID [2022-04-07 11:00:23,666 INFO L272 TraceCheckUtils]: 36: Hoare triple {735#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {735#false} is VALID [2022-04-07 11:00:23,666 INFO L290 TraceCheckUtils]: 37: Hoare triple {735#false} ~cond := #in~cond; {735#false} is VALID [2022-04-07 11:00:23,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {735#false} assume 0 == ~cond; {735#false} is VALID [2022-04-07 11:00:23,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {735#false} assume !false; {735#false} is VALID [2022-04-07 11:00:23,666 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 11:00:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:23,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686798623] [2022-04-07 11:00:23,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686798623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:00:23,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350002311] [2022-04-07 11:00:23,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:00:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:23,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 11:00:23,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 11:00:23,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 11:00:23,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:00:23,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 11:00:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:23,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:00:24,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {734#true} call ULTIMATE.init(); {734#true} is VALID [2022-04-07 11:00:24,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {734#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(11, 2); {734#true} is VALID [2022-04-07 11:00:24,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {734#true} assume true; {734#true} is VALID [2022-04-07 11:00:24,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {734#true} {734#true} #124#return; {734#true} is VALID [2022-04-07 11:00:24,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {734#true} call #t~ret15 := main(); {734#true} is VALID [2022-04-07 11:00:24,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {734#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {734#true} is VALID [2022-04-07 11:00:24,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {734#true} is VALID [2022-04-07 11:00:24,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#true} is VALID [2022-04-07 11:00:24,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {734#true} is VALID [2022-04-07 11:00:24,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#true} is VALID [2022-04-07 11:00:24,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {734#true} is VALID [2022-04-07 11:00:24,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#true} is VALID [2022-04-07 11:00:24,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {734#true} is VALID [2022-04-07 11:00:24,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {734#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {734#true} is VALID [2022-04-07 11:00:24,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {734#true} assume !(~i~0 < 5); {734#true} is VALID [2022-04-07 11:00:24,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {734#true} is VALID [2022-04-07 11:00:24,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {734#true} is VALID [2022-04-07 11:00:24,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {734#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {734#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {734#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {734#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {734#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {734#true} is VALID [2022-04-07 11:00:24,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {734#true} assume !(~i~0 < 5); {734#true} is VALID [2022-04-07 11:00:24,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {734#true} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {734#true} is VALID [2022-04-07 11:00:24,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {734#true} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {734#true} is VALID [2022-04-07 11:00:24,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {734#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {734#true} is VALID [2022-04-07 11:00:24,036 INFO L290 TraceCheckUtils]: 29: Hoare triple {734#true} assume !(0 != #t~mem7);havoc #t~mem7; {734#true} is VALID [2022-04-07 11:00:24,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {734#true} ~nc_B~0 := 0; {838#(<= main_~nc_B~0 0)} is VALID [2022-04-07 11:00:24,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {838#(<= main_~nc_B~0 0)} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {838#(<= main_~nc_B~0 0)} is VALID [2022-04-07 11:00:24,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {838#(<= main_~nc_B~0 0)} assume !(0 != #t~mem9);havoc #t~mem9; {838#(<= main_~nc_B~0 0)} is VALID [2022-04-07 11:00:24,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {838#(<= main_~nc_B~0 0)} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {848#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} is VALID [2022-04-07 11:00:24,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {848#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {848#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} is VALID [2022-04-07 11:00:24,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {848#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {855#(= 1 main_~found~0)} is VALID [2022-04-07 11:00:24,040 INFO L272 TraceCheckUtils]: 36: Hoare triple {855#(= 1 main_~found~0)} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {859#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:00:24,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {859#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {863#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:00:24,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {863#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {735#false} is VALID [2022-04-07 11:00:24,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {735#false} assume !false; {735#false} is VALID [2022-04-07 11:00:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-07 11:00:24,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 11:00:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350002311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:00:24,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 11:00:24,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-04-07 11:00:24,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538352422] [2022-04-07 11:00:24,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:00:24,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-07 11:00:24,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:24,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:24,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 11:00:24,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 11:00:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-07 11:00:24,062 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:24,212 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-04-07 11:00:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:00:24,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-07 11:00:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-07 11:00:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-07 11:00:24,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-07 11:00:24,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:24,252 INFO L225 Difference]: With dead ends: 58 [2022-04-07 11:00:24,252 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 11:00:24,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-07 11:00:24,253 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:00:24,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 11:00:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 11:00:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 11:00:24,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:24,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,264 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,264 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:24,265 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-07 11:00:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-07 11:00:24,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:24,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:24,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-07 11:00:24,266 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-07 11:00:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:24,267 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-07 11:00:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-07 11:00:24,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:24,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:24,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:24,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-07 11:00:24,268 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2022-04-07 11:00:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:24,268 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-07 11:00:24,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-07 11:00:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 11:00:24,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:24,269 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:00:24,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 11:00:24,480 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 11:00:24,481 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash 680255764, now seen corresponding path program 1 times [2022-04-07 11:00:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:24,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969289959] [2022-04-07 11:00:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:24,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {1109#true} is VALID [2022-04-07 11:00:24,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-04-07 11:00:24,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1109#true} {1109#true} #124#return; {1109#true} is VALID [2022-04-07 11:00:24,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {1109#true} call ULTIMATE.init(); {1119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:00:24,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {1109#true} is VALID [2022-04-07 11:00:24,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-04-07 11:00:24,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1109#true} {1109#true} #124#return; {1109#true} is VALID [2022-04-07 11:00:24,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {1109#true} call #t~ret15 := main(); {1109#true} is VALID [2022-04-07 11:00:24,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {1109#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1114#(= main_~i~0 0)} is VALID [2022-04-07 11:00:24,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {1114#(= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1114#(= main_~i~0 0)} is VALID [2022-04-07 11:00:24,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {1114#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:24,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1115#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:24,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1116#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:24,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {1116#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1116#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:24,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1117#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:24,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {1117#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1117#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {1117#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1118#(<= main_~i~0 4)} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {1118#(<= main_~i~0 4)} assume !(~i~0 < 5); {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {1110#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1110#false} assume !(~i~0 < 5); {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {1110#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {1110#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {1110#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {1110#false} assume !(0 != #t~mem7);havoc #t~mem7; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {1110#false} ~nc_B~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {1110#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {1110#false} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {1110#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {1110#false} assume !(0 != #t~mem9);havoc #t~mem9; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {1110#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1110#false} is VALID [2022-04-07 11:00:24,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {1110#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1110#false} is VALID [2022-04-07 11:00:24,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {1110#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1110#false} is VALID [2022-04-07 11:00:24,592 INFO L272 TraceCheckUtils]: 38: Hoare triple {1110#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1110#false} is VALID [2022-04-07 11:00:24,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {1110#false} ~cond := #in~cond; {1110#false} is VALID [2022-04-07 11:00:24,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {1110#false} assume 0 == ~cond; {1110#false} is VALID [2022-04-07 11:00:24,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2022-04-07 11:00:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 11:00:24,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:24,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969289959] [2022-04-07 11:00:24,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969289959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:00:24,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414264199] [2022-04-07 11:00:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:24,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:24,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:24,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 11:00:24,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 11:00:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:24,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 11:00:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:24,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:00:24,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {1109#true} call ULTIMATE.init(); {1109#true} is VALID [2022-04-07 11:00:24,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#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(11, 2); {1109#true} is VALID [2022-04-07 11:00:24,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-04-07 11:00:24,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1109#true} {1109#true} #124#return; {1109#true} is VALID [2022-04-07 11:00:24,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {1109#true} call #t~ret15 := main(); {1109#true} is VALID [2022-04-07 11:00:24,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {1109#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1138#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:24,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1138#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:24,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:24,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1115#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:24,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1116#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:24,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {1116#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1116#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:24,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1117#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:24,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {1117#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1117#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:24,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {1117#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1118#(<= main_~i~0 4)} is VALID [2022-04-07 11:00:24,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {1118#(<= main_~i~0 4)} assume !(~i~0 < 5); {1110#false} is VALID [2022-04-07 11:00:24,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1110#false} is VALID [2022-04-07 11:00:24,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {1110#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {1110#false} assume !(~i~0 < 5); {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {1110#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {1110#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {1110#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {1110#false} assume !(0 != #t~mem7);havoc #t~mem7; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {1110#false} ~nc_B~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {1110#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {1110#false} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {1110#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {1110#false} assume !(0 != #t~mem9);havoc #t~mem9; {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {1110#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {1110#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {1110#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L272 TraceCheckUtils]: 38: Hoare triple {1110#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {1110#false} ~cond := #in~cond; {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {1110#false} assume 0 == ~cond; {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2022-04-07 11:00:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 11:00:24,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:00:24,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2022-04-07 11:00:24,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {1110#false} assume 0 == ~cond; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {1110#false} ~cond := #in~cond; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L272 TraceCheckUtils]: 38: Hoare triple {1110#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {1110#false} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {1110#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {1110#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {1110#false} assume !(0 != #t~mem9);havoc #t~mem9; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {1110#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {1110#false} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {1110#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {1110#false} ~nc_B~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {1110#false} assume !(0 != #t~mem7);havoc #t~mem7; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 28: Hoare triple {1110#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {1110#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {1110#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1110#false} is VALID [2022-04-07 11:00:24,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {1110#false} assume !(~i~0 < 5); {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {1110#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {1110#false} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {1110#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1110#false} is VALID [2022-04-07 11:00:24,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {1110#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1110#false} is VALID [2022-04-07 11:00:24,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {1118#(<= main_~i~0 4)} assume !(~i~0 < 5); {1110#false} is VALID [2022-04-07 11:00:24,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {1117#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1118#(<= main_~i~0 4)} is VALID [2022-04-07 11:00:24,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {1117#(<= main_~i~0 3)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1117#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:24,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1117#(<= main_~i~0 3)} is VALID [2022-04-07 11:00:24,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {1116#(<= main_~i~0 2)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1116#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:24,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1116#(<= main_~i~0 2)} is VALID [2022-04-07 11:00:24,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {1115#(<= main_~i~0 1)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1115#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:24,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#(<= main_~i~0 1)} is VALID [2022-04-07 11:00:24,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#(<= main_~i~0 0)} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1138#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:24,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {1109#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1138#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:24,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {1109#true} call #t~ret15 := main(); {1109#true} is VALID [2022-04-07 11:00:24,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1109#true} {1109#true} #124#return; {1109#true} is VALID [2022-04-07 11:00:24,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {1109#true} assume true; {1109#true} is VALID [2022-04-07 11:00:24,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#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(11, 2); {1109#true} is VALID [2022-04-07 11:00:24,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {1109#true} call ULTIMATE.init(); {1109#true} is VALID [2022-04-07 11:00:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 11:00:24,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414264199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:00:24,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:00:24,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-07 11:00:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264377569] [2022-04-07 11:00:24,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:00:24,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-07 11:00:24,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:24,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:25,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 11:00:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 11:00:25,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-07 11:00:25,026 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:25,355 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-04-07 11:00:25,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:00:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-07 11:00:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-07 11:00:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-07 11:00:25,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-07 11:00:25,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:25,436 INFO L225 Difference]: With dead ends: 97 [2022-04-07 11:00:25,436 INFO L226 Difference]: Without dead ends: 68 [2022-04-07 11:00:25,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 11:00:25,437 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 67 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:00:25,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 52 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:00:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-07 11:00:25,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2022-04-07 11:00:25,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:25,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,455 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,455 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:25,457 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-04-07 11:00:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-07 11:00:25,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:25,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:25,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-07 11:00:25,457 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-07 11:00:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:25,459 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-04-07 11:00:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-07 11:00:25,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:25,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:25,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:25,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-04-07 11:00:25,460 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 42 [2022-04-07 11:00:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:25,460 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-04-07 11:00:25,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-07 11:00:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-07 11:00:25,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:25,461 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 11:00:25,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 11:00:25,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:25,677 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1421983316, now seen corresponding path program 2 times [2022-04-07 11:00:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740937269] [2022-04-07 11:00:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:25,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:25,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {1740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {1728#true} is VALID [2022-04-07 11:00:25,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-07 11:00:25,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1728#true} {1728#true} #124#return; {1728#true} is VALID [2022-04-07 11:00:25,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 11:00:25,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(11, 2); {1728#true} is VALID [2022-04-07 11:00:25,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-07 11:00:25,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #124#return; {1728#true} is VALID [2022-04-07 11:00:25,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret15 := main(); {1728#true} is VALID [2022-04-07 11:00:25,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1728#true} is VALID [2022-04-07 11:00:25,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:25,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:25,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:25,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:25,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:25,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:25,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:25,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:25,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:25,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:25,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {1728#true} assume !(~i~0 < 5); {1728#true} is VALID [2022-04-07 11:00:25,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {1728#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1728#true} is VALID [2022-04-07 11:00:25,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {1728#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1728#true} is VALID [2022-04-07 11:00:25,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:25,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {1728#true} assume !(~i~0 < 5); {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {1728#true} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1728#true} is VALID [2022-04-07 11:00:25,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {1728#true} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1728#true} is VALID [2022-04-07 11:00:25,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {1728#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1728#true} is VALID [2022-04-07 11:00:25,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {1728#true} assume !(0 != #t~mem7);havoc #t~mem7; {1728#true} is VALID [2022-04-07 11:00:25,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {1728#true} ~nc_B~0 := 0; {1733#(= main_~nc_B~0 0)} is VALID [2022-04-07 11:00:25,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {1733#(= main_~nc_B~0 0)} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1733#(= main_~nc_B~0 0)} is VALID [2022-04-07 11:00:25,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#(= main_~nc_B~0 0)} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1734#(<= 1 main_~nc_B~0)} is VALID [2022-04-07 11:00:25,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {1734#(<= 1 main_~nc_B~0)} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1734#(<= 1 main_~nc_B~0)} is VALID [2022-04-07 11:00:25,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {1734#(<= 1 main_~nc_B~0)} assume !(0 != #t~mem9);havoc #t~mem9; {1734#(<= 1 main_~nc_B~0)} is VALID [2022-04-07 11:00:25,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {1734#(<= 1 main_~nc_B~0)} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1735#(and (<= 1 main_~nc_B~0) (= (+ (* (- 1) main_~i~0) main_~j~0) 0) (= main_~i~0 0))} is VALID [2022-04-07 11:00:25,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {1735#(and (<= 1 main_~nc_B~0) (= (+ (* (- 1) main_~i~0) main_~j~0) 0) (= main_~i~0 0))} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1736#(<= (+ main_~j~0 1) main_~nc_B~0)} is VALID [2022-04-07 11:00:25,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {1736#(<= (+ main_~j~0 1) main_~nc_B~0)} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1737#(= 0 main_~found~0)} is VALID [2022-04-07 11:00:25,840 INFO L272 TraceCheckUtils]: 42: Hoare triple {1737#(= 0 main_~found~0)} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 11:00:25,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {1738#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1739#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 11:00:25,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {1739#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1729#false} is VALID [2022-04-07 11:00:25,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-07 11:00:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-07 11:00:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740937269] [2022-04-07 11:00:25,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740937269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:00:25,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329273584] [2022-04-07 11:00:25,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:00:25,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:25,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:25,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 11:00:25,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 11:00:25,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 11:00:25,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:00:25,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 11:00:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:25,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:00:26,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {1728#true} call ULTIMATE.init(); {1728#true} is VALID [2022-04-07 11:00:26,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#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(11, 2); {1728#true} is VALID [2022-04-07 11:00:26,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume true; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1728#true} {1728#true} #124#return; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {1728#true} call #t~ret15 := main(); {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} call ~#string_A~0.base, ~#string_A~0.offset := #Ultimate.allocOnStack(5);call ~#string_B~0.base, ~#string_B~0.offset := #Ultimate.allocOnStack(5);havoc ~i~0;havoc ~j~0;havoc ~nc_A~0;havoc ~nc_B~0;~found~0 := 0;~i~0 := 0; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {1728#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {1728#true} assume !(~i~0 < 5); {1728#true} is VALID [2022-04-07 11:00:26,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {1728#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {1728#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {1728#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet5 && #t~nondet5 <= 127;call write~int(#t~nondet5, ~#string_B~0.base, ~#string_B~0.offset + ~i~0, 1);havoc #t~nondet5; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {1728#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {1728#true} assume !(~i~0 < 5); {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {1728#true} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {1728#true} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {1728#true} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1728#true} is VALID [2022-04-07 11:00:26,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {1728#true} assume !(0 != #t~mem7);havoc #t~mem7; {1728#true} is VALID [2022-04-07 11:00:26,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {1728#true} ~nc_B~0 := 0; {1728#true} is VALID [2022-04-07 11:00:26,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {1728#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1728#true} is VALID [2022-04-07 11:00:26,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {1728#true} assume !!(0 != #t~mem9);havoc #t~mem9;#t~post10 := ~nc_B~0;~nc_B~0 := 1 + #t~post10;havoc #t~post10; {1728#true} is VALID [2022-04-07 11:00:26,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {1728#true} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1728#true} is VALID [2022-04-07 11:00:26,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {1728#true} assume !(0 != #t~mem9);havoc #t~mem9; {1728#true} is VALID [2022-04-07 11:00:26,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {1728#true} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1728#true} is VALID [2022-04-07 11:00:26,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {1728#true} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1728#true} is VALID [2022-04-07 11:00:26,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {1728#true} ~found~0 := (if ~j~0 > ~nc_B~0 - 1 then 1 else 0); {1867#(or (= 1 main_~found~0) (= 0 main_~found~0))} is VALID [2022-04-07 11:00:26,098 INFO L272 TraceCheckUtils]: 42: Hoare triple {1867#(or (= 1 main_~found~0) (= 0 main_~found~0))} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 11:00:26,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {1871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 11:00:26,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {1875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1729#false} is VALID [2022-04-07 11:00:26,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {1729#false} assume !false; {1729#false} is VALID [2022-04-07 11:00:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-07 11:00:26,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 11:00:26,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329273584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:00:26,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 11:00:26,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-04-07 11:00:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615206180] [2022-04-07 11:00:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:00:26,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-07 11:00:26,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:26,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:26,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:26,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 11:00:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 11:00:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-07 11:00:26,115 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:26,185 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-07 11:00:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 11:00:26,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-07 11:00:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-07 11:00:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-07 11:00:26,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-07 11:00:26,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:26,208 INFO L225 Difference]: With dead ends: 48 [2022-04-07 11:00:26,208 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 11:00:26,208 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-07 11:00:26,209 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 11:00:26,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 11:00:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 11:00:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 11:00:26,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:26,209 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-04-07 11:00:26,209 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-04-07 11:00:26,209 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-04-07 11:00:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:26,210 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 11:00:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:00:26,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:26,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:26,210 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-04-07 11:00:26,210 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-04-07 11:00:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:26,210 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 11:00:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:00:26,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:26,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:26,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:26,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:26,210 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-04-07 11:00:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 11:00:26,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2022-04-07 11:00:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:26,210 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 11:00:26,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 11:00:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 11:00:26,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:26,213 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 11:00:26,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 11:00:26,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:26,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 11:00:26,524 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 28 72) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L878 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L53-2(lines 53 65) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L37-2(lines 37 38) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L878 garLoopResultBuilder]: At program point L37-3(lines 37 38) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L37-4(lines 37 38) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L33-2(lines 33 34) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 34) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L33-4(lines 33 34) no Hoare annotation was computed. [2022-04-07 11:00:26,525 INFO L882 garLoopResultBuilder]: For program point L46-1(lines 46 47) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 28 72) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L878 garLoopResultBuilder]: At program point L46-3(lines 46 47) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point L46-4(lines 29 72) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point L42-1(lines 42 43) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L878 garLoopResultBuilder]: At program point L42-3(lines 42 43) the Hoare annotation is: (or (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point L42-4(lines 42 43) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 28 72) the Hoare annotation is: true [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L878 garLoopResultBuilder]: At program point L55-2(lines 53 65) the Hoare annotation is: (or (and (<= main_~nc_B~0 0) (<= 0 main_~j~0)) (= 1 main_~found~0) (= 0 main_~found~0)) [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 11:00:26,526 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L882 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2022-04-07 11:00:26,526 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 23) the Hoare annotation is: true [2022-04-07 11:00:26,527 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2022-04-07 11:00:26,527 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-07 11:00:26,527 INFO L882 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2022-04-07 11:00:26,527 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-04-07 11:00:26,529 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2022-04-07 11:00:26,529 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 11:00:26,532 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 11:00:26,532 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 11:00:26,532 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 11:00:26,532 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 11:00:26,533 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-07 11:00:26,534 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-07 11:00:26,534 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 11:00:26,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:00:26 BoogieIcfgContainer [2022-04-07 11:00:26,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 11:00:26,541 INFO L158 Benchmark]: Toolchain (without parser) took 5325.45ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 137.3MB in the beginning and 140.0MB in the end (delta: -2.7MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2022-04-07 11:00:26,542 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 11:00:26,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.24ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 163.5MB in the end (delta: -26.4MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-04-07 11:00:26,542 INFO L158 Benchmark]: Boogie Preprocessor took 45.80ms. Allocated memory is still 189.8MB. Free memory was 163.5MB in the beginning and 161.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 11:00:26,542 INFO L158 Benchmark]: RCFGBuilder took 329.96ms. Allocated memory is still 189.8MB. Free memory was 161.6MB in the beginning and 147.7MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 11:00:26,542 INFO L158 Benchmark]: TraceAbstraction took 4710.65ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 147.3MB in the beginning and 140.0MB in the end (delta: 7.3MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. [2022-04-07 11:00:26,543 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.09ms. Allocated memory is still 189.8MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.24ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 163.5MB in the end (delta: -26.4MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.80ms. Allocated memory is still 189.8MB. Free memory was 163.5MB in the beginning and 161.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 329.96ms. Allocated memory is still 189.8MB. Free memory was 161.6MB in the beginning and 147.7MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4710.65ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 147.3MB in the beginning and 140.0MB in the end (delta: 7.3MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. * 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: 20]: 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 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 307 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 143 mSDtfsCounter, 307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 34 NumberOfFragments, 60 HoareAnnotationTreeSize, 16 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 131 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 584 SizeOfPredicates, 6 NumberOfNonLiveVariables, 527 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 207/276 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: 53]: Loop Invariant Derived loop invariant: ((nc_B <= 0 && 0 <= j) || 1 == found) || 0 == found - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: 1 == found || 0 == found - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 == found || 0 == found RESULT: Ultimate proved your program to be correct! [2022-04-07 11:00:26,572 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...