/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 11:00:29,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 11:00:29,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 11:00:29,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 11:00:29,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 11:00:29,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 11:00:29,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 11:00:29,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 11:00:29,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 11:00:29,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 11:00:29,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 11:00:29,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 11:00:29,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 11:00:29,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 11:00:29,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 11:00:29,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 11:00:29,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 11:00:29,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 11:00:29,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 11:00:29,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 11:00:29,531 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 11:00:29,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 11:00:29,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 11:00:29,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 11:00:29,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 11:00:29,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 11:00:29,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 11:00:29,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 11:00:29,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 11:00:29,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 11:00:29,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 11:00:29,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 11:00:29,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 11:00:29,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 11:00:29,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 11:00:29,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 11:00:29,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 11:00:29,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 11:00:29,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 11:00:29,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 11:00:29,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 11:00:29,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 11:00:29,549 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:29,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 11:00:29,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 11:00:29,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 11:00:29,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 11:00:29,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 11:00:29,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 11:00:29,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 11:00:29,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 11:00:29,579 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 11:00:29,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 11:00:29,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 11:00:29,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:00:29,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 11:00:29,581 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 11:00:29,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 11:00:29,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 11:00:29,582 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:29,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 11:00:29,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 11:00:29,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 11:00:29,826 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 11:00:29,826 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 11:00:29,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2022-04-07 11:00:29,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac57599f/934845c5b96344739c4c3b8ead34f5d3/FLAG93c8b33ed [2022-04-07 11:00:30,281 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 11:00:30,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2022-04-07 11:00:30,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac57599f/934845c5b96344739c4c3b8ead34f5d3/FLAG93c8b33ed [2022-04-07 11:00:30,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac57599f/934845c5b96344739c4c3b8ead34f5d3 [2022-04-07 11:00:30,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 11:00:30,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 11:00:30,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 11:00:30,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 11:00:30,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 11:00:30,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:00:30" (1/1) ... [2022-04-07 11:00:30,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a70f0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:30, skipping insertion in model container [2022-04-07 11:00:30,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:00:30" (1/1) ... [2022-04-07 11:00:30,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 11:00:30,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 11:00:30,460 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-2.i[896,909] [2022-04-07 11:00:30,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:00:30,496 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 11:00:30,506 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-2.i[896,909] [2022-04-07 11:00:30,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 11:00:30,536 INFO L208 MainTranslator]: Completed translation [2022-04-07 11:00:30,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:30 WrapperNode [2022-04-07 11:00:30,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 11:00:30,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 11:00:30,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 11:00:30,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 11:00:30,546 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:30" (1/1) ... [2022-04-07 11:00:30,546 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:30" (1/1) ... [2022-04-07 11:00:30,557 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:30" (1/1) ... [2022-04-07 11:00:30,557 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:30" (1/1) ... [2022-04-07 11:00:30,575 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:30" (1/1) ... [2022-04-07 11:00:30,578 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:30" (1/1) ... [2022-04-07 11:00:30,579 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:30" (1/1) ... [2022-04-07 11:00:30,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 11:00:30,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 11:00:30,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 11:00:30,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 11:00:30,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:30" (1/1) ... [2022-04-07 11:00:30,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 11:00:30,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:30,603 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:30,620 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:30,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 11:00:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 11:00:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 11:00:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 11:00:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 11:00:30,645 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 11:00:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 11:00:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 11:00:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 11:00:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 11:00:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 11:00:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 11:00:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 11:00:30,700 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 11:00:30,702 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 11:00:30,895 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 11:00:30,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 11:00:30,899 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-07 11:00:30,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:00:30 BoogieIcfgContainer [2022-04-07 11:00:30,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 11:00:30,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 11:00:30,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 11:00:30,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 11:00:30,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:00:30" (1/3) ... [2022-04-07 11:00:30,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5358a8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:00:30, skipping insertion in model container [2022-04-07 11:00:30,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:00:30" (2/3) ... [2022-04-07 11:00:30,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5358a8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:00:30, skipping insertion in model container [2022-04-07 11:00:30,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:00:30" (3/3) ... [2022-04-07 11:00:30,906 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2022-04-07 11:00:30,916 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 11:00:30,916 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 11:00:30,943 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 11:00:30,947 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:30,947 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 11:00:30,959 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:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 11:00:30,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:30,962 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:30,963 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:30,966 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 1 times [2022-04-07 11:00:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:30,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553619397] [2022-04-07 11:00:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:31,199 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:31,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-07 11:00:31,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-07 11:00:31,201 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:31,202 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:31,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-07 11:00:31,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-07 11:00:31,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2022-04-07 11:00:31,203 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:31,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(= main_~i~0 0)} assume !(~i~0 < 5); {39#false} is VALID [2022-04-07 11:00:31,204 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:31,205 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:31,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2022-04-07 11:00:31,205 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:31,205 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:31,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-07 11:00:31,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2022-04-07 11:00:31,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-07 11:00:31,206 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:31,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-07 11:00:31,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {39#false} is VALID [2022-04-07 11:00:31,207 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:31,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-07 11:00:31,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-07 11:00:31,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-07 11:00:31,208 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:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553619397] [2022-04-07 11:00:31,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553619397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 11:00:31,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 11:00:31,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 11:00:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948421625] [2022-04-07 11:00:31,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 11:00:31,215 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:31,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:31,218 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:31,243 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:31,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 11:00:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 11:00:31,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 11:00:31,263 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:31,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:31,505 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2022-04-07 11:00:31,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 11:00:31,506 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:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:31,507 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:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-07 11:00:31,518 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:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-07 11:00:31,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-07 11:00:31,627 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:31,633 INFO L225 Difference]: With dead ends: 73 [2022-04-07 11:00:31,633 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 11:00:31,635 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:31,638 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:31,639 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:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 11:00:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-07 11:00:31,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:31,662 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:31,662 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:31,663 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:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:31,667 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-07 11:00:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 11:00:31,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:31,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:31,668 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:31,669 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:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:31,676 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-07 11:00:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 11:00:31,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:31,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:31,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:31,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:31,683 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:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-07 11:00:31,687 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2022-04-07 11:00:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:31,687 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-07 11:00:31,688 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:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-07 11:00:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 11:00:31,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:31,689 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:31,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 11:00:31,691 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:31,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 1 times [2022-04-07 11:00:31,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:31,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086908372] [2022-04-07 11:00:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:31,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:31,780 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:31,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:31,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:31,781 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:31,782 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:31,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:31,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:31,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret15 := main(); {258#true} is VALID [2022-04-07 11:00:31,782 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:31,783 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:31,783 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:31,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= main_~i~0 1)} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:31,784 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:31,784 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:31,784 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:31,784 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:31,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:31,785 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:31,785 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:31,785 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:31,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#false} assume !(0 != #t~mem7);havoc #t~mem7; {259#false} is VALID [2022-04-07 11:00:31,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {259#false} ~nc_B~0 := 0; {259#false} is VALID [2022-04-07 11:00:31,786 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:31,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {259#false} assume !(0 != #t~mem9);havoc #t~mem9; {259#false} is VALID [2022-04-07 11:00:31,786 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:31,788 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:31,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {259#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {259#false} is VALID [2022-04-07 11:00:31,788 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:31,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {259#false} ~cond := #in~cond; {259#false} is VALID [2022-04-07 11:00:31,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {259#false} assume 0 == ~cond; {259#false} is VALID [2022-04-07 11:00:31,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-07 11:00:31,789 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:31,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:31,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086908372] [2022-04-07 11:00:31,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086908372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:00:31,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528576416] [2022-04-07 11:00:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:31,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:31,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:31,791 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:31,795 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:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:31,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 11:00:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:31,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:00:32,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2022-04-07 11:00:32,019 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:32,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:32,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:32,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret15 := main(); {258#true} is VALID [2022-04-07 11:00:32,021 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:32,021 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:32,021 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:32,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= main_~i~0 1)} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:32,022 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:32,022 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:32,022 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:32,022 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:32,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:32,023 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:32,023 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:32,023 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:32,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#false} assume !(0 != #t~mem7);havoc #t~mem7; {259#false} is VALID [2022-04-07 11:00:32,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {259#false} ~nc_B~0 := 0; {259#false} is VALID [2022-04-07 11:00:32,024 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:32,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {259#false} assume !(0 != #t~mem9);havoc #t~mem9; {259#false} is VALID [2022-04-07 11:00:32,024 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:32,024 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:32,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {259#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {259#false} is VALID [2022-04-07 11:00:32,025 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:32,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {259#false} ~cond := #in~cond; {259#false} is VALID [2022-04-07 11:00:32,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {259#false} assume 0 == ~cond; {259#false} is VALID [2022-04-07 11:00:32,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-07 11:00:32,025 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:32,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:00:32,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {259#false} assume !false; {259#false} is VALID [2022-04-07 11:00:32,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {259#false} assume 0 == ~cond; {259#false} is VALID [2022-04-07 11:00:32,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {259#false} ~cond := #in~cond; {259#false} is VALID [2022-04-07 11:00:32,129 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:32,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {259#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {259#false} is VALID [2022-04-07 11:00:32,129 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:32,129 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:32,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {259#false} assume !(0 != #t~mem9);havoc #t~mem9; {259#false} is VALID [2022-04-07 11:00:32,130 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:32,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {259#false} ~nc_B~0 := 0; {259#false} is VALID [2022-04-07 11:00:32,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#false} assume !(0 != #t~mem7);havoc #t~mem7; {259#false} is VALID [2022-04-07 11:00:32,130 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:32,130 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:32,130 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:32,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {259#false} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:32,130 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:32,130 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:32,131 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:32,131 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:32,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {408#(< main_~i~0 5)} assume !(~i~0 < 5); {259#false} is VALID [2022-04-07 11:00:32,134 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:32,134 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:32,135 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:32,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {258#true} call #t~ret15 := main(); {258#true} is VALID [2022-04-07 11:00:32,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {258#true} {258#true} #124#return; {258#true} is VALID [2022-04-07 11:00:32,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#true} assume true; {258#true} is VALID [2022-04-07 11:00:32,139 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:32,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {258#true} call ULTIMATE.init(); {258#true} is VALID [2022-04-07 11:00:32,140 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:32,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528576416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:00:32,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:00:32,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 11:00:32,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858991338] [2022-04-07 11:00:32,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:00:32,145 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:32,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:32,146 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:32,168 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:32,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 11:00:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:32,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 11:00:32,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 11:00:32,171 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:32,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:32,388 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-07 11:00:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 11:00:32,388 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:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:32,388 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:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-07 11:00:32,390 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:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-07 11:00:32,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-07 11:00:32,467 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:32,468 INFO L225 Difference]: With dead ends: 79 [2022-04-07 11:00:32,468 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 11:00:32,469 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:32,469 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:32,470 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:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 11:00:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-04-07 11:00:32,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:32,479 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:32,480 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:32,480 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:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:32,482 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-07 11:00:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-07 11:00:32,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:32,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:32,483 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:32,483 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:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:32,485 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-07 11:00:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-07 11:00:32,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:32,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:32,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:32,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:32,486 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:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-07 11:00:32,487 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2022-04-07 11:00:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:32,487 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-07 11:00:32,487 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:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-07 11:00:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-07 11:00:32,488 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:32,488 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:32,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 11:00:32,707 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:32,708 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:32,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:32,709 INFO L85 PathProgramCache]: Analyzing trace with hash 173558265, now seen corresponding path program 2 times [2022-04-07 11:00:32,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:32,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046128428] [2022-04-07 11:00:32,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:32,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:32,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 11:00:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:32,873 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:32,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {734#true} assume true; {734#true} is VALID [2022-04-07 11:00:32,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {734#true} {734#true} #124#return; {734#true} is VALID [2022-04-07 11:00:32,875 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:32,875 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:32,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {734#true} assume true; {734#true} is VALID [2022-04-07 11:00:32,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {734#true} {734#true} #124#return; {734#true} is VALID [2022-04-07 11:00:32,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {734#true} call #t~ret15 := main(); {734#true} is VALID [2022-04-07 11:00:32,876 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:32,876 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:32,876 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:32,877 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:32,877 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:32,878 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:32,878 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:32,878 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:32,879 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:32,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(<= main_~i~0 4)} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:32,879 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:32,879 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:32,879 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:32,880 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:32,880 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:32,880 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:32,880 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:32,880 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:32,880 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:32,880 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:32,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {735#false} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:32,880 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:32,881 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:32,881 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:32,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {735#false} assume !(0 != #t~mem7);havoc #t~mem7; {735#false} is VALID [2022-04-07 11:00:32,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {735#false} ~nc_B~0 := 0; {735#false} is VALID [2022-04-07 11:00:32,881 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:32,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {735#false} assume !(0 != #t~mem9);havoc #t~mem9; {735#false} is VALID [2022-04-07 11:00:32,881 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:32,881 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:32,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {735#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {735#false} is VALID [2022-04-07 11:00:32,881 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:32,882 INFO L290 TraceCheckUtils]: 37: Hoare triple {735#false} ~cond := #in~cond; {735#false} is VALID [2022-04-07 11:00:32,882 INFO L290 TraceCheckUtils]: 38: Hoare triple {735#false} assume 0 == ~cond; {735#false} is VALID [2022-04-07 11:00:32,882 INFO L290 TraceCheckUtils]: 39: Hoare triple {735#false} assume !false; {735#false} is VALID [2022-04-07 11:00:32,882 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:32,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 11:00:32,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046128428] [2022-04-07 11:00:32,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046128428] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 11:00:32,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260639656] [2022-04-07 11:00:32,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 11:00:32,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 11:00:32,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 11:00:32,892 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:32,928 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:32,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 11:00:32,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 11:00:32,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 11:00:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 11:00:32,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 11:00:33,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {734#true} call ULTIMATE.init(); {734#true} is VALID [2022-04-07 11:00:33,093 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:33,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {734#true} assume true; {734#true} is VALID [2022-04-07 11:00:33,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {734#true} {734#true} #124#return; {734#true} is VALID [2022-04-07 11:00:33,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {734#true} call #t~ret15 := main(); {734#true} is VALID [2022-04-07 11:00:33,094 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; {763#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:33,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {763#(<= 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; {763#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:33,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#(<= 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:33,096 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:33,097 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:33,097 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:33,098 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:33,098 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:33,098 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:33,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(<= main_~i~0 4)} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:33,099 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:33,099 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:33,099 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:33,099 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:33,099 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:33,099 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:33,099 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:33,100 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:33,100 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:33,100 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:33,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {735#false} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:33,100 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:33,100 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:33,100 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:33,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {735#false} assume !(0 != #t~mem7);havoc #t~mem7; {735#false} is VALID [2022-04-07 11:00:33,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {735#false} ~nc_B~0 := 0; {735#false} is VALID [2022-04-07 11:00:33,100 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:33,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {735#false} assume !(0 != #t~mem9);havoc #t~mem9; {735#false} is VALID [2022-04-07 11:00:33,101 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:33,101 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:33,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {735#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {735#false} is VALID [2022-04-07 11:00:33,101 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:33,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {735#false} ~cond := #in~cond; {735#false} is VALID [2022-04-07 11:00:33,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {735#false} assume 0 == ~cond; {735#false} is VALID [2022-04-07 11:00:33,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {735#false} assume !false; {735#false} is VALID [2022-04-07 11:00:33,102 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:33,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 11:00:33,246 INFO L290 TraceCheckUtils]: 39: Hoare triple {735#false} assume !false; {735#false} is VALID [2022-04-07 11:00:33,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {735#false} assume 0 == ~cond; {735#false} is VALID [2022-04-07 11:00:33,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {735#false} ~cond := #in~cond; {735#false} is VALID [2022-04-07 11:00:33,246 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:33,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {735#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {735#false} is VALID [2022-04-07 11:00:33,246 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:33,246 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:33,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {735#false} assume !(0 != #t~mem9);havoc #t~mem9; {735#false} is VALID [2022-04-07 11:00:33,247 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:33,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {735#false} ~nc_B~0 := 0; {735#false} is VALID [2022-04-07 11:00:33,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {735#false} assume !(0 != #t~mem7);havoc #t~mem7; {735#false} is VALID [2022-04-07 11:00:33,247 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:33,247 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:33,247 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:33,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {735#false} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:33,247 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:33,247 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:33,248 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:33,248 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:33,248 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:33,248 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:33,248 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:33,248 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:33,248 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:33,248 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:33,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(<= main_~i~0 4)} assume !(~i~0 < 5); {735#false} is VALID [2022-04-07 11:00:33,250 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:33,251 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:33,251 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:33,251 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:33,252 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:33,252 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:33,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#(<= 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:33,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {763#(<= 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; {763#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:33,253 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; {763#(<= main_~i~0 0)} is VALID [2022-04-07 11:00:33,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {734#true} call #t~ret15 := main(); {734#true} is VALID [2022-04-07 11:00:33,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {734#true} {734#true} #124#return; {734#true} is VALID [2022-04-07 11:00:33,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {734#true} assume true; {734#true} is VALID [2022-04-07 11:00:33,254 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:33,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {734#true} call ULTIMATE.init(); {734#true} is VALID [2022-04-07 11:00:33,254 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:33,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260639656] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 11:00:33,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 11:00:33,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-07 11:00:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432154718] [2022-04-07 11:00:33,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 11:00:33,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 40 [2022-04-07 11:00:33,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 11:00:33,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:33,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 11:00:33,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 11:00:33,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 11:00:33,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 11:00:33,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-07 11:00:33,278 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:33,580 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-04-07 11:00:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 11:00:33,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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 40 [2022-04-07 11:00:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 11:00:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-07 11:00:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-07 11:00:33,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-07 11:00:33,667 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:33,668 INFO L225 Difference]: With dead ends: 93 [2022-04-07 11:00:33,668 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 11:00:33,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 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:33,670 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 71 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 11:00:33,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 42 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 11:00:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 11:00:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-04-07 11:00:33,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 11:00:33,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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:33,688 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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:33,688 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:33,690 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-07 11:00:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-07 11:00:33,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:33,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:33,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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 66 states. [2022-04-07 11:00:33,692 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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 66 states. [2022-04-07 11:00:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 11:00:33,694 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-07 11:00:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-07 11:00:33,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 11:00:33,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 11:00:33,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 11:00:33,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 11:00:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 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:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-07 11:00:33,696 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2022-04-07 11:00:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 11:00:33,696 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-07 11:00:33,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-07 11:00:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 11:00:33,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 11:00:33,698 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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:33,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 11:00:33,911 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:33,911 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 11:00:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 11:00:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1461422279, now seen corresponding path program 3 times [2022-04-07 11:00:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 11:00:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448550745] [2022-04-07 11:00:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 11:00:33,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 11:00:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 11:00:33,997 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 11:00:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 11:00:34,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 11:00:34,041 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 11:00:34,042 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 11:00:34,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 11:00:34,045 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1] [2022-04-07 11:00:34,046 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 11:00:34,079 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-07 11:00:34,080 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-04-07 11:00:34,081 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-07 11:00:34,082 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-07 11:00:34,082 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-07 11:00:34,082 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-07 11:00:34,082 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 11:00:34,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:00:34 BoogieIcfgContainer [2022-04-07 11:00:34,082 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 11:00:34,083 INFO L158 Benchmark]: Toolchain (without parser) took 3783.25ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 147.3MB in the beginning and 110.7MB in the end (delta: 36.5MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2022-04-07 11:00:34,083 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 11:00:34,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.01ms. Allocated memory is still 198.2MB. Free memory was 147.2MB in the beginning and 171.4MB in the end (delta: -24.2MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-04-07 11:00:34,084 INFO L158 Benchmark]: Boogie Preprocessor took 41.00ms. Allocated memory is still 198.2MB. Free memory was 171.4MB in the beginning and 169.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 11:00:34,084 INFO L158 Benchmark]: RCFGBuilder took 320.07ms. Allocated memory is still 198.2MB. Free memory was 169.3MB in the beginning and 154.9MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-07 11:00:34,085 INFO L158 Benchmark]: TraceAbstraction took 3180.72ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 154.3MB in the beginning and 110.7MB in the end (delta: 43.5MB). Peak memory consumption was 83.7MB. Max. memory is 8.0GB. [2022-04-07 11:00:34,086 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 198.2MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.01ms. Allocated memory is still 198.2MB. Free memory was 147.2MB in the beginning and 171.4MB in the end (delta: -24.2MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.00ms. Allocated memory is still 198.2MB. Free memory was 171.4MB in the beginning and 169.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.07ms. Allocated memory is still 198.2MB. Free memory was 169.3MB in the beginning and 154.9MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3180.72ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 154.3MB in the beginning and 110.7MB in the end (delta: 43.5MB). Peak memory consumption was 83.7MB. 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 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L37] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={6:0}, string_A[5 -1]=0, string_B={7:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L41] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={6:0}, string_B={7:0}, string_B[5 -1]=0] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_A[nc_A]=0, string_B={7:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}, string_B[nc_B]=0] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L55] COND FALSE !((inc_B-1)<