/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:02:55,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:02:55,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:02:55,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:02:55,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:02:55,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:02:55,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:02:55,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:02:55,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:02:55,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:02:55,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:02:55,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:02:55,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:02:55,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:02:55,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:02:55,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:02:55,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:02:55,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:02:55,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:02:55,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:02:55,543 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:02:55,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:02:55,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:02:55,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:02:55,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:02:55,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:02:55,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:02:55,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:02:55,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:02:55,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:02:55,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:02:55,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:02:55,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:02:55,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:02:55,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:02:55,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:02:55,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:02:55,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:02:55,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:02:55,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:02:55,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:02:55,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:02:55,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:02:55,587 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:02:55,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:02:55,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:02:55,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:02:55,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:02:55,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:02:55,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:02:55,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:02:55,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:02:55,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:02:55,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:02:55,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:02:55,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:02:55,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:02:55,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:02:55,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:02:55,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:02:55,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:02:55,603 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:02:55,603 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:02:55,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:02:55,604 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:02:55,604 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 12:02:56,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:02:56,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:02:56,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:02:56,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:02:56,051 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:02:56,053 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-15 12:02:56,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc30851a/e75c0f9b01894965ba35f531a4dd416f/FLAG69e2c2e08 [2022-04-15 12:02:56,696 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:02:56,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2022-04-15 12:02:56,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc30851a/e75c0f9b01894965ba35f531a4dd416f/FLAG69e2c2e08 [2022-04-15 12:02:56,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc30851a/e75c0f9b01894965ba35f531a4dd416f [2022-04-15 12:02:56,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:02:56,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:02:56,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:02:56,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:02:56,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:02:56,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:02:56" (1/1) ... [2022-04-15 12:02:56,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de8a89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:56, skipping insertion in model container [2022-04-15 12:02:56,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:02:56" (1/1) ... [2022-04-15 12:02:56,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:02:56,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:02:57,048 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-15 12:02:57,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:02:57,110 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:02:57,129 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-15 12:02:57,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:02:57,172 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:02:57,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57 WrapperNode [2022-04-15 12:02:57,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:02:57,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:02:57,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:02:57,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:02:57,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:02:57,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:02:57,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:02:57,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:02:57,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (1/1) ... [2022-04-15 12:02:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:02:57,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:57,268 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-15 12:02:57,294 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-15 12:02:57,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:02:57,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:02:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:02:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:02:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:02:57,339 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:02:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:02:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:02:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:02:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:02:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:02:57,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:02:57,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:02:57,400 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:02:57,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:02:57,861 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:02:57,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:02:57,867 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 12:02:57,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:02:57 BoogieIcfgContainer [2022-04-15 12:02:57,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:02:57,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:02:57,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:02:57,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:02:57,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:02:56" (1/3) ... [2022-04-15 12:02:57,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a47250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:02:57, skipping insertion in model container [2022-04-15 12:02:57,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:02:57" (2/3) ... [2022-04-15 12:02:57,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a47250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:02:57, skipping insertion in model container [2022-04-15 12:02:57,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:02:57" (3/3) ... [2022-04-15 12:02:57,888 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2022-04-15 12:02:57,892 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:02:57,892 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:02:57,936 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:02:57,943 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-15 12:02:57,947 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:02:57,974 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-15 12:02:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:02:57,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:57,987 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-15 12:02:57,989 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 1 times [2022-04-15 12:02:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:58,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61537946] [2022-04-15 12:02:58,013 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:02:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 2 times [2022-04-15 12:02:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:58,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836668746] [2022-04-15 12:02:58,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:58,467 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-15 12:02:58,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 12:02:58,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-15 12:02:58,484 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-15 12:02:58,484 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-15 12:02:58,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 12:02:58,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-15 12:02:58,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2022-04-15 12:02:58,486 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-15 12:02:58,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(= main_~i~0 0)} assume !(~i~0 < 5); {39#false} is VALID [2022-04-15 12:02:58,488 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-15 12:02:58,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {39#false} is VALID [2022-04-15 12:02:58,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2022-04-15 12:02:58,489 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-15 12:02:58,489 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-15 12:02:58,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 12:02:58,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2022-04-15 12:02:58,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 12:02:58,493 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-15 12:02:58,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 12:02:58,493 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-15 12:02:58,494 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-15 12:02:58,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-15 12:02:58,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-15 12:02:58,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-15 12:02:58,495 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-15 12:02:58,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:58,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836668746] [2022-04-15 12:02:58,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836668746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:58,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:58,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:02:58,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:02:58,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61537946] [2022-04-15 12:02:58,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61537946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:02:58,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:02:58,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:02:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198948058] [2022-04-15 12:02:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:02:58,519 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-15 12:02:58,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:02:58,530 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-15 12:02:58,570 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-15 12:02:58,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:02:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:58,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:02:58,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:02:58,603 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-15 12:02:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:59,062 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2022-04-15 12:02:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:02:59,063 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-15 12:02:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:02:59,064 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-15 12:02:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 12:02:59,079 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-15 12:02:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 12:02:59,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-15 12:02:59,217 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-15 12:02:59,227 INFO L225 Difference]: With dead ends: 73 [2022-04-15 12:02:59,227 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 12:02:59,230 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-15 12:02:59,249 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-15 12:02:59,251 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-15 12:02:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 12:02:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-15 12:02:59,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:02:59,294 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-15 12:02:59,295 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-15 12:02:59,295 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-15 12:02:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:59,298 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 12:02:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 12:02:59,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:59,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:59,299 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-15 12:02:59,303 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-15 12:02:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:02:59,306 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 12:02:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 12:02:59,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:02:59,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:02:59,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:02:59,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:02:59,320 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-15 12:02:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-15 12:02:59,328 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2022-04-15 12:02:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:02:59,328 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-15 12:02:59,329 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-15 12:02:59,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-15 12:02:59,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:02:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-15 12:02:59,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 12:02:59,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:02:59,404 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-15 12:02:59,404 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:02:59,405 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:02:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:02:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 1 times [2022-04-15 12:02:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:02:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1518180098] [2022-04-15 12:02:59,421 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:02:59,421 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:02:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 2 times [2022-04-15 12:02:59,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:02:59,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823379138] [2022-04-15 12:02:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:02:59,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:02:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:02:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:59,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {334#(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); {327#true} is VALID [2022-04-15 12:02:59,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 12:02:59,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 12:02:59,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:02:59,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#(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); {327#true} is VALID [2022-04-15 12:02:59,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 12:02:59,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 12:02:59,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 12:02:59,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#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; {332#(= main_~i~0 0)} is VALID [2022-04-15 12:02:59,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(= 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; {332#(= main_~i~0 0)} is VALID [2022-04-15 12:02:59,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {333#(<= main_~i~0 1)} is VALID [2022-04-15 12:02:59,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(<= main_~i~0 1)} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 12:02:59,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {328#false} is VALID [2022-04-15 12:02:59,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {328#false} is VALID [2022-04-15 12:02:59,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#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; {328#false} is VALID [2022-04-15 12:02:59,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {328#false} is VALID [2022-04-15 12:02:59,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 12:02:59,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {328#false} is VALID [2022-04-15 12:02:59,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {328#false} is VALID [2022-04-15 12:02:59,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {328#false} is VALID [2022-04-15 12:02:59,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume !(0 != #t~mem7);havoc #t~mem7; {328#false} is VALID [2022-04-15 12:02:59,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} ~nc_B~0 := 0; {328#false} is VALID [2022-04-15 12:02:59,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {328#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {328#false} is VALID [2022-04-15 12:02:59,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume !(0 != #t~mem9);havoc #t~mem9; {328#false} is VALID [2022-04-15 12:02:59,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {328#false} is VALID [2022-04-15 12:02:59,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {328#false} is VALID [2022-04-15 12:02:59,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {328#false} is VALID [2022-04-15 12:02:59,593 INFO L272 TraceCheckUtils]: 24: Hoare triple {328#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {328#false} is VALID [2022-04-15 12:02:59,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2022-04-15 12:02:59,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2022-04-15 12:02:59,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 12:02:59,595 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-15 12:02:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:02:59,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823379138] [2022-04-15 12:02:59,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823379138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:02:59,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165410514] [2022-04-15 12:02:59,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:02:59,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:02:59,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:02:59,598 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-15 12:02:59,652 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-15 12:02:59,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:02:59,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:02:59,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 12:02:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:02:59,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:02:59,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-15 12:02:59,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#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); {327#true} is VALID [2022-04-15 12:02:59,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 12:02:59,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 12:02:59,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 12:02:59,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#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; {353#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:59,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {353#(<= 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; {353#(<= main_~i~0 0)} is VALID [2022-04-15 12:02:59,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {333#(<= main_~i~0 1)} is VALID [2022-04-15 12:02:59,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(<= main_~i~0 1)} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 12:02:59,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {328#false} is VALID [2022-04-15 12:02:59,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {328#false} is VALID [2022-04-15 12:02:59,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#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; {328#false} is VALID [2022-04-15 12:02:59,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {328#false} is VALID [2022-04-15 12:02:59,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 12:02:59,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {328#false} is VALID [2022-04-15 12:02:59,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {328#false} is VALID [2022-04-15 12:02:59,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {328#false} is VALID [2022-04-15 12:02:59,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume !(0 != #t~mem7);havoc #t~mem7; {328#false} is VALID [2022-04-15 12:02:59,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} ~nc_B~0 := 0; {328#false} is VALID [2022-04-15 12:02:59,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {328#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {328#false} is VALID [2022-04-15 12:02:59,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume !(0 != #t~mem9);havoc #t~mem9; {328#false} is VALID [2022-04-15 12:02:59,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {328#false} is VALID [2022-04-15 12:02:59,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {328#false} is VALID [2022-04-15 12:02:59,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {328#false} is VALID [2022-04-15 12:02:59,903 INFO L272 TraceCheckUtils]: 24: Hoare triple {328#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {328#false} is VALID [2022-04-15 12:02:59,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2022-04-15 12:02:59,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2022-04-15 12:02:59,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 12:02:59,904 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-15 12:02:59,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:00,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 12:03:00,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2022-04-15 12:03:00,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2022-04-15 12:03:00,057 INFO L272 TraceCheckUtils]: 24: Hoare triple {328#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {328#false} is VALID [2022-04-15 12:03:00,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {328#false} is VALID [2022-04-15 12:03:00,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {328#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {328#false} is VALID [2022-04-15 12:03:00,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {328#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {328#false} is VALID [2022-04-15 12:03:00,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume !(0 != #t~mem9);havoc #t~mem9; {328#false} is VALID [2022-04-15 12:03:00,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {328#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {328#false} is VALID [2022-04-15 12:03:00,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} ~nc_B~0 := 0; {328#false} is VALID [2022-04-15 12:03:00,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume !(0 != #t~mem7);havoc #t~mem7; {328#false} is VALID [2022-04-15 12:03:00,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {328#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {328#false} is VALID [2022-04-15 12:03:00,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {328#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {328#false} is VALID [2022-04-15 12:03:00,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {328#false} is VALID [2022-04-15 12:03:00,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 12:03:00,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {328#false} is VALID [2022-04-15 12:03:00,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#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; {328#false} is VALID [2022-04-15 12:03:00,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {328#false} is VALID [2022-04-15 12:03:00,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {328#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {328#false} is VALID [2022-04-15 12:03:00,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#(< main_~i~0 5)} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 12:03:00,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(< main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {477#(< main_~i~0 5)} is VALID [2022-04-15 12:03:00,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {481#(< 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; {481#(< main_~i~0 4)} is VALID [2022-04-15 12:03:00,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#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; {481#(< main_~i~0 4)} is VALID [2022-04-15 12:03:00,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 12:03:00,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 12:03:00,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 12:03:00,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#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); {327#true} is VALID [2022-04-15 12:03:00,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-15 12:03:00,079 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-15 12:03:00,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165410514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:00,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:00,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 12:03:00,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:00,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1518180098] [2022-04-15 12:03:00,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1518180098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:00,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:00,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:00,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104691724] [2022-04-15 12:03:00,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:00,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 28 [2022-04-15 12:03:00,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:00,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-15 12:03:00,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:00,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:03:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:03:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:03:00,148 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-15 12:03:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:00,438 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-15 12:03:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:03:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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 28 [2022-04-15 12:03:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-15 12:03:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-15 12:03:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-15 12:03:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-15 12:03:00,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2022-04-15 12:03:00,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:00,524 INFO L225 Difference]: With dead ends: 65 [2022-04-15 12:03:00,524 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:03:00,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:03:00,527 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:00,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 37 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:03:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-04-15 12:03:00,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:00,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-15 12:03:00,547 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-15 12:03:00,548 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-15 12:03:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:00,551 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 12:03:00,551 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-15 12:03:00,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:00,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:00,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:03:00,553 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 12:03:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:00,560 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 12:03:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-15 12:03:00,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:00,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:00,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:00,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-15 12:03:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-04-15 12:03:00,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2022-04-15 12:03:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:00,569 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-04-15 12:03:00,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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-15 12:03:00,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 39 transitions. [2022-04-15 12:03:00,631 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-15 12:03:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-15 12:03:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:03:00,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:00,637 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:00,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:03:00,855 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-15 12:03:00,856 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:00,856 INFO L85 PathProgramCache]: Analyzing trace with hash 875420793, now seen corresponding path program 3 times [2022-04-15 12:03:00,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:00,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [603336209] [2022-04-15 12:03:00,864 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:00,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash 875420793, now seen corresponding path program 4 times [2022-04-15 12:03:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:00,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906611650] [2022-04-15 12:03:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:01,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:01,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {803#(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); {795#true} is VALID [2022-04-15 12:03:01,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 12:03:01,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 12:03:01,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {803#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:01,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {803#(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); {795#true} is VALID [2022-04-15 12:03:01,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 12:03:01,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 12:03:01,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret15 := main(); {795#true} is VALID [2022-04-15 12:03:01,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {795#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; {800#(= main_~i~0 0)} is VALID [2022-04-15 12:03:01,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#(= 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; {800#(= main_~i~0 0)} is VALID [2022-04-15 12:03:01,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {801#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:01,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#(<= 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; {801#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:01,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {802#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:01,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#(<= main_~i~0 2)} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 12:03:01,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {796#false} is VALID [2022-04-15 12:03:01,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {796#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {796#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; {796#false} is VALID [2022-04-15 12:03:01,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {796#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {796#false} is VALID [2022-04-15 12:03:01,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#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; {796#false} is VALID [2022-04-15 12:03:01,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {796#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {796#false} is VALID [2022-04-15 12:03:01,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {796#false} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 12:03:01,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {796#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {796#false} is VALID [2022-04-15 12:03:01,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {796#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {796#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {796#false} is VALID [2022-04-15 12:03:01,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {796#false} assume !(0 != #t~mem7);havoc #t~mem7; {796#false} is VALID [2022-04-15 12:03:01,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {796#false} ~nc_B~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {796#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {796#false} is VALID [2022-04-15 12:03:01,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {796#false} assume !(0 != #t~mem9);havoc #t~mem9; {796#false} is VALID [2022-04-15 12:03:01,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {796#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {796#false} is VALID [2022-04-15 12:03:01,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {796#false} is VALID [2022-04-15 12:03:01,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {796#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {796#false} is VALID [2022-04-15 12:03:01,061 INFO L272 TraceCheckUtils]: 28: Hoare triple {796#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {796#false} is VALID [2022-04-15 12:03:01,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#false} ~cond := #in~cond; {796#false} is VALID [2022-04-15 12:03:01,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {796#false} assume 0 == ~cond; {796#false} is VALID [2022-04-15 12:03:01,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {796#false} assume !false; {796#false} is VALID [2022-04-15 12:03:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:03:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:01,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906611650] [2022-04-15 12:03:01,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906611650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:03:01,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575846992] [2022-04-15 12:03:01,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:03:01,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:01,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:01,064 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-15 12:03:01,065 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-15 12:03:01,122 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:03:01,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:03:01,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:03:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:01,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:03:01,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {795#true} is VALID [2022-04-15 12:03:01,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#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); {795#true} is VALID [2022-04-15 12:03:01,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 12:03:01,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 12:03:01,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret15 := main(); {795#true} is VALID [2022-04-15 12:03:01,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {795#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; {822#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:01,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {822#(<= 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; {822#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:01,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {801#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:01,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {801#(<= 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; {801#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:01,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {801#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {802#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:01,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#(<= main_~i~0 2)} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 12:03:01,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {796#false} is VALID [2022-04-15 12:03:01,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {796#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {796#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; {796#false} is VALID [2022-04-15 12:03:01,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {796#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {796#false} is VALID [2022-04-15 12:03:01,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#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; {796#false} is VALID [2022-04-15 12:03:01,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {796#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {796#false} is VALID [2022-04-15 12:03:01,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {796#false} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 12:03:01,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {796#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {796#false} is VALID [2022-04-15 12:03:01,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {796#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {796#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {796#false} is VALID [2022-04-15 12:03:01,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {796#false} assume !(0 != #t~mem7);havoc #t~mem7; {796#false} is VALID [2022-04-15 12:03:01,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {796#false} ~nc_B~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {796#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {796#false} is VALID [2022-04-15 12:03:01,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {796#false} assume !(0 != #t~mem9);havoc #t~mem9; {796#false} is VALID [2022-04-15 12:03:01,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {796#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {796#false} is VALID [2022-04-15 12:03:01,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {796#false} is VALID [2022-04-15 12:03:01,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {796#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {796#false} is VALID [2022-04-15 12:03:01,232 INFO L272 TraceCheckUtils]: 28: Hoare triple {796#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {796#false} is VALID [2022-04-15 12:03:01,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#false} ~cond := #in~cond; {796#false} is VALID [2022-04-15 12:03:01,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {796#false} assume 0 == ~cond; {796#false} is VALID [2022-04-15 12:03:01,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {796#false} assume !false; {796#false} is VALID [2022-04-15 12:03:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:03:01,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:01,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {796#false} assume !false; {796#false} is VALID [2022-04-15 12:03:01,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {796#false} assume 0 == ~cond; {796#false} is VALID [2022-04-15 12:03:01,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#false} ~cond := #in~cond; {796#false} is VALID [2022-04-15 12:03:01,381 INFO L272 TraceCheckUtils]: 28: Hoare triple {796#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {796#false} is VALID [2022-04-15 12:03:01,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {796#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {796#false} is VALID [2022-04-15 12:03:01,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {796#false} is VALID [2022-04-15 12:03:01,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {796#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {796#false} is VALID [2022-04-15 12:03:01,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {796#false} assume !(0 != #t~mem9);havoc #t~mem9; {796#false} is VALID [2022-04-15 12:03:01,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {796#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {796#false} is VALID [2022-04-15 12:03:01,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {796#false} ~nc_B~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {796#false} assume !(0 != #t~mem7);havoc #t~mem7; {796#false} is VALID [2022-04-15 12:03:01,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {796#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {796#false} is VALID [2022-04-15 12:03:01,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {796#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {796#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {796#false} is VALID [2022-04-15 12:03:01,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {796#false} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 12:03:01,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {796#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {796#false} is VALID [2022-04-15 12:03:01,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {796#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; {796#false} is VALID [2022-04-15 12:03:01,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {796#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {796#false} is VALID [2022-04-15 12:03:01,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {796#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; {796#false} is VALID [2022-04-15 12:03:01,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {796#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {796#false} is VALID [2022-04-15 12:03:01,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {796#false} is VALID [2022-04-15 12:03:01,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {964#(< main_~i~0 5)} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 12:03:01,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {968#(< main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {964#(< main_~i~0 5)} is VALID [2022-04-15 12:03:01,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(< 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; {968#(< main_~i~0 4)} is VALID [2022-04-15 12:03:01,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {802#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {968#(< main_~i~0 4)} is VALID [2022-04-15 12:03:01,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {802#(<= 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; {802#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:01,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {795#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; {802#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:01,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret15 := main(); {795#true} is VALID [2022-04-15 12:03:01,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 12:03:01,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 12:03:01,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#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); {795#true} is VALID [2022-04-15 12:03:01,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {795#true} is VALID [2022-04-15 12:03:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:03:01,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575846992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:01,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:01,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-15 12:03:01,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:01,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [603336209] [2022-04-15 12:03:01,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [603336209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:01,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:01,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:03:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481425317] [2022-04-15 12:03:01,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 32 [2022-04-15 12:03:01,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:01,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-15 12:03:01,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:01,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:03:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:03:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:03:01,414 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-15 12:03:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:01,755 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-15 12:03:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:03:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 32 [2022-04-15 12:03:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-15 12:03:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 12:03:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-15 12:03:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 12:03:01,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-04-15 12:03:01,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:01,896 INFO L225 Difference]: With dead ends: 75 [2022-04-15 12:03:01,896 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 12:03:01,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:03:01,897 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:01,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 37 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 12:03:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2022-04-15 12:03:01,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:01,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-15 12:03:01,928 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-15 12:03:01,928 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-15 12:03:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:01,930 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-15 12:03:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-15 12:03:01,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:01,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:01,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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 52 states. [2022-04-15 12:03:01,931 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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 52 states. [2022-04-15 12:03:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:01,933 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-15 12:03:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-15 12:03:01,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:01,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:01,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:01,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 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-15 12:03:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-04-15 12:03:01,940 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2022-04-15 12:03:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:01,940 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-04-15 12:03:01,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-15 12:03:01,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2022-04-15 12:03:01,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 12:03:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:03:01,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:01,995 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-15 12:03:02,021 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-15 12:03:02,215 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-15 12:03:02,216 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash 133934009, now seen corresponding path program 5 times [2022-04-15 12:03:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:02,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728115457] [2022-04-15 12:03:02,222 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:02,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:02,223 INFO L85 PathProgramCache]: Analyzing trace with hash 133934009, now seen corresponding path program 6 times [2022-04-15 12:03:02,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:02,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785033135] [2022-04-15 12:03:02,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:02,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:02,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:02,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {1343#(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); {1334#true} is VALID [2022-04-15 12:03:02,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 12:03:02,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 12:03:02,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:02,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#(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); {1334#true} is VALID [2022-04-15 12:03:02,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 12:03:02,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 12:03:02,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret15 := main(); {1334#true} is VALID [2022-04-15 12:03:02,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#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; {1339#(= main_~i~0 0)} is VALID [2022-04-15 12:03:02,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {1339#(= 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; {1339#(= main_~i~0 0)} is VALID [2022-04-15 12:03:02,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {1339#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1340#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:02,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(<= 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; {1340#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:02,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {1340#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1341#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:02,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#(<= 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; {1341#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:02,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {1341#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1342#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:02,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {1342#(<= main_~i~0 3)} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 12:03:02,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {1335#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1335#false} is VALID [2022-04-15 12:03:02,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {1335#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1335#false} is VALID [2022-04-15 12:03:02,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {1335#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; {1335#false} is VALID [2022-04-15 12:03:02,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {1335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1335#false} is VALID [2022-04-15 12:03:02,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {1335#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; {1335#false} is VALID [2022-04-15 12:03:02,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {1335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1335#false} is VALID [2022-04-15 12:03:02,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {1335#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; {1335#false} is VALID [2022-04-15 12:03:02,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {1335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1335#false} is VALID [2022-04-15 12:03:02,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {1335#false} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 12:03:02,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {1335#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1335#false} is VALID [2022-04-15 12:03:02,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {1335#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1335#false} is VALID [2022-04-15 12:03:02,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {1335#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1335#false} is VALID [2022-04-15 12:03:02,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !(0 != #t~mem7);havoc #t~mem7; {1335#false} is VALID [2022-04-15 12:03:02,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} ~nc_B~0 := 0; {1335#false} is VALID [2022-04-15 12:03:02,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {1335#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1335#false} is VALID [2022-04-15 12:03:02,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(0 != #t~mem9);havoc #t~mem9; {1335#false} is VALID [2022-04-15 12:03:02,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {1335#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1335#false} is VALID [2022-04-15 12:03:02,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {1335#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1335#false} is VALID [2022-04-15 12:03:02,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {1335#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1335#false} is VALID [2022-04-15 12:03:02,402 INFO L272 TraceCheckUtils]: 32: Hoare triple {1335#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1335#false} is VALID [2022-04-15 12:03:02,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 12:03:02,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 12:03:02,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 12:03:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:03:02,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:02,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785033135] [2022-04-15 12:03:02,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785033135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:03:02,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858189184] [2022-04-15 12:03:02,403 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:03:02,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:02,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:03:02,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:03:02,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:03:02,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:03:02,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:03:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:02,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:03:02,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2022-04-15 12:03:02,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#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); {1334#true} is VALID [2022-04-15 12:03:02,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 12:03:02,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 12:03:02,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret15 := main(); {1334#true} is VALID [2022-04-15 12:03:02,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#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; {1334#true} is VALID [2022-04-15 12:03:02,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {1334#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1334#true} is VALID [2022-04-15 12:03:02,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {1334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#true} is VALID [2022-04-15 12:03:02,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {1334#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1334#true} is VALID [2022-04-15 12:03:02,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {1334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#true} is VALID [2022-04-15 12:03:02,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {1334#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1334#true} is VALID [2022-04-15 12:03:02,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#true} is VALID [2022-04-15 12:03:02,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#true} assume !(~i~0 < 5); {1334#true} is VALID [2022-04-15 12:03:02,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1334#true} is VALID [2022-04-15 12:03:02,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {1334#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1389#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:02,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {1389#(<= main_~i~0 0)} 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; {1389#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:02,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {1389#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1340#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:02,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {1340#(<= main_~i~0 1)} 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; {1340#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:02,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {1340#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1341#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:02,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {1341#(<= main_~i~0 2)} 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; {1341#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:02,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {1341#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1342#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:02,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {1342#(<= main_~i~0 3)} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 12:03:02,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {1335#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1335#false} is VALID [2022-04-15 12:03:02,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {1335#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1335#false} is VALID [2022-04-15 12:03:02,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {1335#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1335#false} is VALID [2022-04-15 12:03:02,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !(0 != #t~mem7);havoc #t~mem7; {1335#false} is VALID [2022-04-15 12:03:02,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} ~nc_B~0 := 0; {1335#false} is VALID [2022-04-15 12:03:02,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {1335#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(0 != #t~mem9);havoc #t~mem9; {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {1335#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {1335#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {1335#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L272 TraceCheckUtils]: 32: Hoare triple {1335#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 12:03:02,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 12:03:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:03:02,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:02,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 12:03:02,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 12:03:02,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 12:03:02,869 INFO L272 TraceCheckUtils]: 32: Hoare triple {1335#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1335#false} is VALID [2022-04-15 12:03:02,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {1335#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1335#false} is VALID [2022-04-15 12:03:02,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {1335#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1335#false} is VALID [2022-04-15 12:03:02,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {1335#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1335#false} is VALID [2022-04-15 12:03:02,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(0 != #t~mem9);havoc #t~mem9; {1335#false} is VALID [2022-04-15 12:03:02,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {1335#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1335#false} is VALID [2022-04-15 12:03:02,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} ~nc_B~0 := 0; {1335#false} is VALID [2022-04-15 12:03:02,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !(0 != #t~mem7);havoc #t~mem7; {1335#false} is VALID [2022-04-15 12:03:02,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {1335#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1335#false} is VALID [2022-04-15 12:03:02,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {1335#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1335#false} is VALID [2022-04-15 12:03:02,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {1335#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1335#false} is VALID [2022-04-15 12:03:02,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {1495#(< main_~i~0 5)} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 12:03:02,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {1342#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1495#(< main_~i~0 5)} is VALID [2022-04-15 12:03:02,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {1342#(<= main_~i~0 3)} 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; {1342#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:02,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {1341#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1342#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:02,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {1341#(<= main_~i~0 2)} 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; {1341#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:02,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {1340#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1341#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:02,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {1340#(<= main_~i~0 1)} 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; {1340#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:02,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1334#true} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1340#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:02,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#true} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1334#true} is VALID [2022-04-15 12:03:02,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#true} assume !(~i~0 < 5); {1334#true} is VALID [2022-04-15 12:03:02,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {1334#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {1334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {1334#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {1334#true} assume !!(~i~0 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#string_A~0.base, ~#string_A~0.offset + ~i~0, 1);havoc #t~nondet2; {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#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; {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret15 := main(); {1334#true} is VALID [2022-04-15 12:03:02,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 12:03:02,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 12:03:02,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#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); {1334#true} is VALID [2022-04-15 12:03:02,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2022-04-15 12:03:02,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 12:03:02,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858189184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:02,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:02,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 12:03:02,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:02,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728115457] [2022-04-15 12:03:02,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728115457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:02,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:02,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:03:02,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989449816] [2022-04-15 12:03:02,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:02,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 36 [2022-04-15 12:03:02,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:02,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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-15 12:03:02,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:02,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:03:02,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:02,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:03:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:03:02,920 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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-15 12:03:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:03,338 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-04-15 12:03:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:03:03,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 36 [2022-04-15 12:03:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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-15 12:03:03,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 12:03:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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-15 12:03:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 12:03:03,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-15 12:03:03,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:03,475 INFO L225 Difference]: With dead ends: 85 [2022-04-15 12:03:03,475 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 12:03:03,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:03:03,477 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:03,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 37 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:03,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 12:03:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2022-04-15 12:03:03,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:03,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 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-15 12:03:03,521 INFO L74 IsIncluded]: Start isIncluded. First operand 60 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-15 12:03:03,521 INFO L87 Difference]: Start difference. First operand 60 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-15 12:03:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:03,523 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-15 12:03:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-04-15 12:03:03,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:03,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:03,524 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 60 states. [2022-04-15 12:03:03,524 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 60 states. [2022-04-15 12:03:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:03,541 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-15 12:03:03,541 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-04-15 12:03:03,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:03,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:03,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:03,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:03,542 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-15 12:03:03,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-15 12:03:03,543 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2022-04-15 12:03:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:03,544 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-15 12:03:03,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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-15 12:03:03,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-15 12:03:03,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 12:03:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 12:03:03,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:03,642 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-15 12:03:03,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:03:03,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:03,856 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 173558265, now seen corresponding path program 7 times [2022-04-15 12:03:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:03,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [339832470] [2022-04-15 12:03:03,862 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:03,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 173558265, now seen corresponding path program 8 times [2022-04-15 12:03:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:03,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790842618] [2022-04-15 12:03:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:04,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:04,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {1953#(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); {1943#true} is VALID [2022-04-15 12:03:04,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:03:04,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 12:03:04,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1953#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:04,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1953#(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); {1943#true} is VALID [2022-04-15 12:03:04,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:03:04,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 12:03:04,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 12:03:04,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#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; {1948#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {1948#(= 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; {1948#(= main_~i~0 0)} is VALID [2022-04-15 12:03:04,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {1948#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1949#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:04,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1949#(<= 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; {1949#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:04,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1949#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1950#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:04,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {1950#(<= 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; {1950#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:04,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {1950#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1951#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:04,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {1951#(<= 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; {1951#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:04,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {1951#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1952#(<= main_~i~0 4)} is VALID [2022-04-15 12:03:04,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(<= main_~i~0 4)} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 12:03:04,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1944#false} is VALID [2022-04-15 12:03:04,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#false} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {1944#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {1944#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {1944#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1944#false} is VALID [2022-04-15 12:03:04,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#false} assume !(0 != #t~mem7);havoc #t~mem7; {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#false} ~nc_B~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {1944#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#false} assume !(0 != #t~mem9);havoc #t~mem9; {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {1944#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {1944#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {1944#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L272 TraceCheckUtils]: 36: Hoare triple {1944#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 12:03:04,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 12:03:04,044 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-15 12:03:04,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:04,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790842618] [2022-04-15 12:03:04,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790842618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:03:04,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340485167] [2022-04-15 12:03:04,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:03:04,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:04,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:04,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:03:04,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:03:04,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:03:04,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:03:04,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:03:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:04,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:03:04,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 12:03:04,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#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); {1943#true} is VALID [2022-04-15 12:03:04,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:03:04,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 12:03:04,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 12:03:04,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#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; {1972#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:04,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {1972#(<= 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; {1972#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:04,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1949#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:04,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {1949#(<= 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; {1949#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:04,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {1949#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1950#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:04,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {1950#(<= 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; {1950#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:04,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {1950#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1951#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:04,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {1951#(<= 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; {1951#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:04,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {1951#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1952#(<= main_~i~0 4)} is VALID [2022-04-15 12:03:04,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(<= main_~i~0 4)} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 12:03:04,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1944#false} is VALID [2022-04-15 12:03:04,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#false} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {1944#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {1944#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {1944#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#false} assume !(0 != #t~mem7);havoc #t~mem7; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#false} ~nc_B~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {1944#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#false} assume !(0 != #t~mem9);havoc #t~mem9; {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {1944#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {1944#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {1944#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L272 TraceCheckUtils]: 36: Hoare triple {1944#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 12:03:04,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 12:03:04,487 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-15 12:03:04,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:03:04,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 12:03:04,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 12:03:04,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 12:03:04,708 INFO L272 TraceCheckUtils]: 36: Hoare triple {1944#false} call __VERIFIER_assert((if 0 == ~found~0 || 1 == ~found~0 then 1 else 0)); {1944#false} is VALID [2022-04-15 12:03:04,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {1944#false} ~found~0 := ~shiftLeft((if ~j~0 > ~nc_B~0 - 1 then 1 else 0), ~i~0); {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {1944#false} assume !(~i~0 < ~nc_A~0 && ~j~0 < ~nc_B~0); {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {1944#false} assume !!(~nc_B~0 >= ~nc_A~0);~j~0 := 0;~i~0 := ~j~0; {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#false} assume !(0 != #t~mem9);havoc #t~mem9; {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {1944#false} call #t~mem9 := read~int(~#string_B~0.base, ~#string_B~0.offset + ~nc_B~0, 1); {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#false} ~nc_B~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#false} assume !(0 != #t~mem7);havoc #t~mem7; {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {1944#false} call #t~mem7 := read~int(~#string_A~0.base, ~#string_A~0.offset + ~nc_A~0, 1); {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {1944#false} assume !!(0 == #t~mem6);havoc #t~mem6;~nc_A~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {1944#false} call #t~mem6 := read~int(~#string_B~0.base, 4 + ~#string_B~0.offset, 1); {1944#false} is VALID [2022-04-15 12:03:04,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#false} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {1944#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#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; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#false} assume !!(0 == #t~mem3);havoc #t~mem3;~i~0 := 0; {1944#false} is VALID [2022-04-15 12:03:04,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {1944#false} call #t~mem3 := read~int(~#string_A~0.base, 4 + ~#string_A~0.offset, 1); {1944#false} is VALID [2022-04-15 12:03:04,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(<= main_~i~0 4)} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 12:03:04,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1951#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1952#(<= main_~i~0 4)} is VALID [2022-04-15 12:03:04,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {1951#(<= 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; {1951#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:04,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {1950#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1951#(<= main_~i~0 3)} is VALID [2022-04-15 12:03:04,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {1950#(<= 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; {1950#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:04,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {1949#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1950#(<= main_~i~0 2)} is VALID [2022-04-15 12:03:04,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {1949#(<= 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; {1949#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:04,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {1972#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1949#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:04,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {1972#(<= 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; {1972#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:04,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#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; {1972#(<= main_~i~0 0)} is VALID [2022-04-15 12:03:04,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 12:03:04,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 12:03:04,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 12:03:04,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#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); {1943#true} is VALID [2022-04-15 12:03:04,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 12:03:04,717 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-15 12:03:04,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340485167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:03:04,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:03:04,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-15 12:03:04,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:04,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [339832470] [2022-04-15 12:03:04,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [339832470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:04,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:04,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:03:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556987266] [2022-04-15 12:03:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 40 [2022-04-15 12:03:04,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:04,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-15 12:03:04,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:04,754 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:03:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:04,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:03:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:03:04,755 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-15 12:03:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:05,198 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-04-15 12:03:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:03:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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 40 [2022-04-15 12:03:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-15 12:03:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 12:03:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-15 12:03:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 12:03:05,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-15 12:03:05,327 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-15 12:03:05,328 INFO L225 Difference]: With dead ends: 93 [2022-04-15 12:03:05,328 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 12:03:05,329 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-15 12:03:05,329 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 79 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:05,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 37 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 12:03:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-04-15 12:03:05,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:05,373 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-15 12:03:05,373 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-15 12:03:05,373 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-15 12:03:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:05,376 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-15 12:03:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-15 12:03:05,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:05,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:05,377 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-15 12:03:05,377 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-15 12:03:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:05,380 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-15 12:03:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-15 12:03:05,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:05,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:05,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:05,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:05,381 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-15 12:03:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-15 12:03:05,383 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2022-04-15 12:03:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:05,383 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-15 12:03:05,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 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-15 12:03:05,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-15 12:03:05,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 12:03:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:03:05,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:05,462 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-15 12:03:05,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:03:05,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:03:05,684 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1461422279, now seen corresponding path program 9 times [2022-04-15 12:03:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:05,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [387191408] [2022-04-15 12:03:05,690 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:03:05,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:03:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1461422279, now seen corresponding path program 10 times [2022-04-15 12:03:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:05,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415278875] [2022-04-15 12:03:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:03:05,788 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:03:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:03:05,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:03:05,904 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 12:03:05,905 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 12:03:05,907 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:03:05,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:03:05,923 INFO L719 BasicCegarLoop]: Path program histogram: [10, 2] [2022-04-15 12:03:05,926 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 12:03:05,951 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 12:03:05,952 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-15 12:03:05,953 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-15 12:03:05,954 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-15 12:03:05,954 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-04-15 12:03:05,954 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 12:03:05,954 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 12:03:05,954 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 12:03:05,954 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 12:03:05,954 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-15 12:03:05,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:03:05 BoogieIcfgContainer [2022-04-15 12:03:05,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:03:05,956 INFO L158 Benchmark]: Toolchain (without parser) took 9204.47ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 169.7MB in the beginning and 115.4MB in the end (delta: 54.3MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. [2022-04-15 12:03:05,956 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 194.0MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:05,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.55ms. Allocated memory is still 194.0MB. Free memory was 168.9MB in the beginning and 164.3MB in the end (delta: 4.6MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-15 12:03:05,957 INFO L158 Benchmark]: Boogie Preprocessor took 59.72ms. Allocated memory is still 194.0MB. Free memory was 164.0MB in the beginning and 162.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:03:05,957 INFO L158 Benchmark]: RCFGBuilder took 634.55ms. Allocated memory is still 194.0MB. Free memory was 162.2MB in the beginning and 147.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-15 12:03:05,957 INFO L158 Benchmark]: TraceAbstraction took 8085.17ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 147.2MB in the beginning and 115.9MB in the end (delta: 31.3MB). Peak memory consumption was 99.8MB. Max. memory is 8.0GB. [2022-04-15 12:03:05,971 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.17ms. Allocated memory is still 194.0MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 403.55ms. Allocated memory is still 194.0MB. Free memory was 168.9MB in the beginning and 164.3MB in the end (delta: 4.6MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.72ms. Allocated memory is still 194.0MB. Free memory was 164.0MB in the beginning and 162.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 634.55ms. Allocated memory is still 194.0MB. Free memory was 162.2MB in the beginning and 147.7MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8085.17ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 147.2MB in the beginning and 115.9MB in the end (delta: 31.3MB). Peak memory consumption was 99.8MB. 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 [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ [L35] COND FALSE !(i<5) [L37] EXPR string_A[5 -1] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ [L39] COND FALSE !(i<5) [L41] EXPR string_B[5 -1] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 [L44] EXPR string_A[nc_A] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 [L48] EXPR string_B[nc_B] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 [L55] COND FALSE !((inc_B-1)<