/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:42:29,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:42:29,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:42:29,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:42:29,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:42:29,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:42:29,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:42:29,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:42:29,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:42:29,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:42:29,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:42:29,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:42:29,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:42:29,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:42:29,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:42:29,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:42:29,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:42:29,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:42:29,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:42:29,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:42:29,859 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:42:29,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:42:29,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:42:29,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:42:29,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:42:29,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:42:29,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:42:29,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:42:29,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:42:29,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:42:29,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:42:29,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:42:29,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:42:29,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:42:29,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:42:29,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:42:29,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:42:29,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:42:29,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:42:29,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:42:29,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:42:29,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:42:29,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:42:29,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:42:29,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:42:29,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:42:29,884 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:42:29,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:42:29,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:42:29,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:42:29,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:29,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:42:29,886 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:42:29,886 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 05:42:30,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:42:30,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:42:30,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:42:30,138 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:42:30,138 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:42:30,140 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 05:42:30,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788bf0910/cf05d3066b3045be8cb0182834b371ab/FLAG0d87e927a [2022-04-15 05:42:30,573 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:42:30,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2022-04-15 05:42:30,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788bf0910/cf05d3066b3045be8cb0182834b371ab/FLAG0d87e927a [2022-04-15 05:42:30,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788bf0910/cf05d3066b3045be8cb0182834b371ab [2022-04-15 05:42:30,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:42:30,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:42:30,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:30,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:42:30,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:42:30,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6429735c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30, skipping insertion in model container [2022-04-15 05:42:30,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:42:30,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:42:30,751 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 05:42:30,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:30,770 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:42:30,779 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 05:42:30,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:42:30,794 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:42:30,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30 WrapperNode [2022-04-15 05:42:30,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:42:30,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:42:30,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:42:30,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:42:30,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:42:30,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:42:30,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:42:30,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:42:30,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (1/1) ... [2022-04-15 05:42:30,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:42:30,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:30,876 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 05:42:30,882 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 05:42:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:42:30,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:42:30,903 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:42:30,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 05:42:30,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:42:30,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:42:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:42:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:42:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:42:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:42:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:42:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:42:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 05:42:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:42:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 05:42:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:42:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:42:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:42:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:42:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:42:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:42:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:42:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:42:30,952 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:42:30,953 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:42:31,162 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:42:31,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:42:31,167 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 05:42:31,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:31 BoogieIcfgContainer [2022-04-15 05:42:31,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:42:31,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:42:31,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:42:31,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:42:31,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:42:30" (1/3) ... [2022-04-15 05:42:31,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acac9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:31, skipping insertion in model container [2022-04-15 05:42:31,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:42:30" (2/3) ... [2022-04-15 05:42:31,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acac9d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:42:31, skipping insertion in model container [2022-04-15 05:42:31,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:42:31" (3/3) ... [2022-04-15 05:42:31,180 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2022-04-15 05:42:31,185 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:42:31,185 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:42:31,214 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:42:31,218 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 05:42:31,218 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:42:31,229 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 05:42:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:42:31,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:31,234 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 05:42:31,235 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:31,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:31,238 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 1 times [2022-04-15 05:42:31,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:31,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [165208069] [2022-04-15 05:42:31,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:42:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash 739829093, now seen corresponding path program 2 times [2022-04-15 05:42:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:31,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461526058] [2022-04-15 05:42:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:31,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:31,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:31,396 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 05:42:31,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 05:42:31,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-15 05:42:31,398 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 05:42:31,399 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 05:42:31,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-15 05:42:31,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #124#return; {38#true} is VALID [2022-04-15 05:42:31,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret15 := main(); {38#true} is VALID [2022-04-15 05:42:31,400 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 05:42:31,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(= main_~i~0 0)} assume !(~i~0 < 5); {39#false} is VALID [2022-04-15 05:42:31,401 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 05:42:31,402 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 05:42:31,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume !(~i~0 < 5); {39#false} is VALID [2022-04-15 05:42:31,402 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 05:42:31,402 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 05:42:31,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:42:31,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} ~nc_B~0 := 0; {39#false} is VALID [2022-04-15 05:42:31,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:42:31,404 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 05:42:31,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-15 05:42:31,404 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 05:42:31,404 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 05:42:31,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-15 05:42:31,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-15 05:42:31,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-15 05:42:31,405 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 05:42:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:31,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461526058] [2022-04-15 05:42:31,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461526058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:31,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:31,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:31,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [165208069] [2022-04-15 05:42:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [165208069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:31,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:31,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:42:31,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055614251] [2022-04-15 05:42:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:31,414 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 05:42:31,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:31,418 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 05:42:31,440 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 05:42:31,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:42:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:31,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:42:31,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:42:31,466 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 05:42:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,679 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2022-04-15 05:42:31,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:42:31,680 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 05:42:31,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:31,681 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 05:42:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 05:42:31,693 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 05:42:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-15 05:42:31,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-15 05:42:31,791 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 05:42:31,798 INFO L225 Difference]: With dead ends: 73 [2022-04-15 05:42:31,799 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 05:42:31,801 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 05:42:31,805 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 05:42:31,806 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 05:42:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 05:42:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-15 05:42:31,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:31,832 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 05:42:31,832 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 05:42:31,833 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 05:42:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,836 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 05:42:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 05:42:31,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:31,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:31,837 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 05:42:31,838 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 05:42:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:31,843 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-15 05:42:31,847 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 05:42:31,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:31,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:31,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:31,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:31,848 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 05:42:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-15 05:42:31,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2022-04-15 05:42:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:31,851 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-15 05:42:31,852 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 05:42:31,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-15 05:42:31,892 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 05:42:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-15 05:42:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 05:42:31,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:31,893 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 05:42:31,893 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:42:31,893 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 1 times [2022-04-15 05:42:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:31,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [447420622] [2022-04-15 05:42:31,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:31,907 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:31,907 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1075962823, now seen corresponding path program 2 times [2022-04-15 05:42:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:31,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914793603] [2022-04-15 05:42:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:31,969 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 05:42:31,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 05:42:31,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 05:42:31,970 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 05:42:31,970 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 05:42:31,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 05:42:31,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 05:42:31,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 05:42:31,971 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 05:42:31,971 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 05:42:31,972 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 05:42:31,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(<= main_~i~0 1)} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:31,973 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 05:42:31,973 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 05:42:31,973 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 05:42:31,973 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 05:42:31,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:31,973 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 05:42:31,974 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 05:42:31,974 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 05:42:31,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume !(0 != #t~mem7);havoc #t~mem7; {328#false} is VALID [2022-04-15 05:42:31,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} ~nc_B~0 := 0; {328#false} is VALID [2022-04-15 05:42:31,974 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 05:42:31,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume !(0 != #t~mem9);havoc #t~mem9; {328#false} is VALID [2022-04-15 05:42:31,974 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 05:42:31,975 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 05:42:31,975 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 05:42:31,975 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 05:42:31,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2022-04-15 05:42:31,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2022-04-15 05:42:31,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 05:42:31,976 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 05:42:31,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:31,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914793603] [2022-04-15 05:42:31,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914793603] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:31,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256551424] [2022-04-15 05:42:31,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:31,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:31,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:31,978 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 05:42:32,003 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 05:42:32,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:32,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:32,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:42:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:32,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-15 05:42:32,155 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 05:42:32,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 05:42:32,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 05:42:32,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 05:42:32,156 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 05:42:32,156 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 05:42:32,157 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 05:42:32,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(<= main_~i~0 1)} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:32,157 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 05:42:32,157 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 05:42:32,158 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 05:42:32,158 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 05:42:32,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:32,158 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 05:42:32,158 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 05:42:32,158 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 05:42:32,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume !(0 != #t~mem7);havoc #t~mem7; {328#false} is VALID [2022-04-15 05:42:32,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} ~nc_B~0 := 0; {328#false} is VALID [2022-04-15 05:42:32,159 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 05:42:32,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume !(0 != #t~mem9);havoc #t~mem9; {328#false} is VALID [2022-04-15 05:42:32,159 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 05:42:32,159 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 05:42:32,159 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 05:42:32,160 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 05:42:32,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2022-04-15 05:42:32,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2022-04-15 05:42:32,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 05:42:32,160 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 05:42:32,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:32,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 05:42:32,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {328#false} assume 0 == ~cond; {328#false} is VALID [2022-04-15 05:42:32,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2022-04-15 05:42:32,275 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 05:42:32,275 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 05:42:32,276 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 05:42:32,276 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 05:42:32,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#false} assume !(0 != #t~mem9);havoc #t~mem9; {328#false} is VALID [2022-04-15 05:42:32,276 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 05:42:32,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {328#false} ~nc_B~0 := 0; {328#false} is VALID [2022-04-15 05:42:32,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {328#false} assume !(0 != #t~mem7);havoc #t~mem7; {328#false} is VALID [2022-04-15 05:42:32,277 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 05:42:32,277 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 05:42:32,277 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 05:42:32,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#false} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:32,277 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 05:42:32,277 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 05:42:32,277 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 05:42:32,278 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 05:42:32,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#(< main_~i~0 5)} assume !(~i~0 < 5); {328#false} is VALID [2022-04-15 05:42:32,281 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 05:42:32,282 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 05:42:32,283 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 05:42:32,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret15 := main(); {327#true} is VALID [2022-04-15 05:42:32,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #124#return; {327#true} is VALID [2022-04-15 05:42:32,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 05:42:32,284 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 05:42:32,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2022-04-15 05:42:32,284 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 05:42:32,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256551424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:32,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:32,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:42:32,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:32,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [447420622] [2022-04-15 05:42:32,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [447420622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:32,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:32,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:42:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805396145] [2022-04-15 05:42:32,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:32,286 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 05:42:32,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:32,287 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 05:42:32,310 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 05:42:32,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:42:32,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:32,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:42:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:42:32,311 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 05:42:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:32,477 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-15 05:42:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:42:32,477 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 05:42:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:32,478 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 05:42:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-15 05:42:32,479 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 05:42:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-04-15 05:42:32,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2022-04-15 05:42:32,550 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 05:42:32,552 INFO L225 Difference]: With dead ends: 65 [2022-04-15 05:42:32,552 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 05:42:32,552 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 05:42:32,553 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 05:42:32,553 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 05:42:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 05:42:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-04-15 05:42:32,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:32,562 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 05:42:32,563 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 05:42:32,563 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 05:42:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:32,565 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 05:42:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-15 05:42:32,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:32,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:32,565 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 05:42:32,565 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 05:42:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:32,567 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 05:42:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-04-15 05:42:32,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:32,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:32,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:32,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:32,568 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 05:42:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-04-15 05:42:32,569 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 28 [2022-04-15 05:42:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:32,569 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-04-15 05:42:32,569 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 05:42:32,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 39 transitions. [2022-04-15 05:42:32,601 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 05:42:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-15 05:42:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:42:32,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:32,602 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 05:42:32,623 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 05:42:32,818 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 05:42:32,818 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash 875420793, now seen corresponding path program 3 times [2022-04-15 05:42:32,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:32,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201155854] [2022-04-15 05:42:32,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:32,825 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:32,825 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 875420793, now seen corresponding path program 4 times [2022-04-15 05:42:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:32,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853287712] [2022-04-15 05:42:32,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:32,963 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 05:42:32,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 05:42:32,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 05:42:32,964 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 05:42:32,964 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 05:42:32,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 05:42:32,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 05:42:32,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret15 := main(); {795#true} is VALID [2022-04-15 05:42:32,965 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 05:42:32,965 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 05:42:32,966 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 05:42:32,966 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 05:42:32,967 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 05:42:32,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#(<= main_~i~0 2)} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 05:42:32,967 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 05:42:32,967 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 05:42:32,967 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 05:42:32,967 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 05:42:32,968 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 05:42:32,968 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 05:42:32,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {796#false} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 05:42:32,968 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 05:42:32,968 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 05:42:32,968 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 05:42:32,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {796#false} assume !(0 != #t~mem7);havoc #t~mem7; {796#false} is VALID [2022-04-15 05:42:32,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {796#false} ~nc_B~0 := 0; {796#false} is VALID [2022-04-15 05:42:32,968 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 05:42:32,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {796#false} assume !(0 != #t~mem9);havoc #t~mem9; {796#false} is VALID [2022-04-15 05:42:32,969 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 05:42:32,969 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 05:42:32,969 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 05:42:32,969 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 05:42:32,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#false} ~cond := #in~cond; {796#false} is VALID [2022-04-15 05:42:32,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {796#false} assume 0 == ~cond; {796#false} is VALID [2022-04-15 05:42:32,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {796#false} assume !false; {796#false} is VALID [2022-04-15 05:42:32,969 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 05:42:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853287712] [2022-04-15 05:42:32,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853287712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050158047] [2022-04-15 05:42:32,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:42:32,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:32,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:32,984 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 05:42:32,987 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 05:42:33,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:42:33,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:33,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:42:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:33,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:33,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {795#true} is VALID [2022-04-15 05:42:33,106 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 05:42:33,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 05:42:33,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 05:42:33,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret15 := main(); {795#true} is VALID [2022-04-15 05:42:33,107 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 05:42:33,107 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 05:42:33,107 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 05:42:33,108 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 05:42:33,108 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 05:42:33,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {802#(<= main_~i~0 2)} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 05:42:33,109 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 05:42:33,109 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 05:42:33,109 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 05:42:33,109 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 05:42:33,109 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 05:42:33,109 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 05:42:33,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {796#false} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 05:42:33,109 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 05:42:33,110 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 05:42:33,110 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 05:42:33,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {796#false} assume !(0 != #t~mem7);havoc #t~mem7; {796#false} is VALID [2022-04-15 05:42:33,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {796#false} ~nc_B~0 := 0; {796#false} is VALID [2022-04-15 05:42:33,110 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 05:42:33,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {796#false} assume !(0 != #t~mem9);havoc #t~mem9; {796#false} is VALID [2022-04-15 05:42:33,110 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 05:42:33,110 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 05:42:33,110 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 05:42:33,111 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 05:42:33,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#false} ~cond := #in~cond; {796#false} is VALID [2022-04-15 05:42:33,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {796#false} assume 0 == ~cond; {796#false} is VALID [2022-04-15 05:42:33,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {796#false} assume !false; {796#false} is VALID [2022-04-15 05:42:33,111 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 05:42:33,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:33,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {796#false} assume !false; {796#false} is VALID [2022-04-15 05:42:33,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {796#false} assume 0 == ~cond; {796#false} is VALID [2022-04-15 05:42:33,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#false} ~cond := #in~cond; {796#false} is VALID [2022-04-15 05:42:33,202 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 05:42:33,202 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 05:42:33,202 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 05:42:33,202 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 05:42:33,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {796#false} assume !(0 != #t~mem9);havoc #t~mem9; {796#false} is VALID [2022-04-15 05:42:33,203 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 05:42:33,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {796#false} ~nc_B~0 := 0; {796#false} is VALID [2022-04-15 05:42:33,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {796#false} assume !(0 != #t~mem7);havoc #t~mem7; {796#false} is VALID [2022-04-15 05:42:33,203 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 05:42:33,203 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 05:42:33,203 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 05:42:33,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {796#false} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 05:42:33,203 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 05:42:33,203 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 05:42:33,204 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 05:42:33,204 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 05:42:33,204 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 05:42:33,204 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 05:42:33,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {964#(< main_~i~0 5)} assume !(~i~0 < 5); {796#false} is VALID [2022-04-15 05:42:33,205 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 05:42:33,205 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 05:42:33,206 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 05:42:33,206 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 05:42:33,206 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 05:42:33,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {795#true} call #t~ret15 := main(); {795#true} is VALID [2022-04-15 05:42:33,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {795#true} {795#true} #124#return; {795#true} is VALID [2022-04-15 05:42:33,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {795#true} assume true; {795#true} is VALID [2022-04-15 05:42:33,207 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 05:42:33,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {795#true} call ULTIMATE.init(); {795#true} is VALID [2022-04-15 05:42:33,207 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 05:42:33,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050158047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:33,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:33,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-15 05:42:33,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:33,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201155854] [2022-04-15 05:42:33,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201155854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:33,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:33,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:42:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260357142] [2022-04-15 05:42:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:33,209 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 05:42:33,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:33,209 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 05:42:33,225 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 05:42:33,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:42:33,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:33,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:42:33,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:42:33,226 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 05:42:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:33,414 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-04-15 05:42:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:42:33,414 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 05:42:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:33,414 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 05:42:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 05:42:33,415 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 05:42:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 05:42:33,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-04-15 05:42:33,485 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 05:42:33,487 INFO L225 Difference]: With dead ends: 75 [2022-04-15 05:42:33,487 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 05:42:33,488 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 05:42:33,489 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 05:42:33,489 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 05:42:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 05:42:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2022-04-15 05:42:33,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:33,502 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 05:42:33,502 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 05:42:33,502 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 05:42:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:33,503 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-15 05:42:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-15 05:42:33,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:33,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:33,504 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 05:42:33,504 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 05:42:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:33,506 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-15 05:42:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-15 05:42:33,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:33,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:33,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:33,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:33,506 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 05:42:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-04-15 05:42:33,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 32 [2022-04-15 05:42:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:33,508 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-04-15 05:42:33,508 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 05:42:33,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 43 transitions. [2022-04-15 05:42:33,538 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 05:42:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-04-15 05:42:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:42:33,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:33,539 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 05:42:33,573 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 05:42:33,774 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 05:42:33,774 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 133934009, now seen corresponding path program 5 times [2022-04-15 05:42:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:33,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587086629] [2022-04-15 05:42:33,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:33,780 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:33,780 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash 133934009, now seen corresponding path program 6 times [2022-04-15 05:42:33,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:33,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985839411] [2022-04-15 05:42:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:33,851 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 05:42:33,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:42:33,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 05:42:33,852 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 05:42:33,852 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 05:42:33,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:42:33,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 05:42:33,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret15 := main(); {1334#true} is VALID [2022-04-15 05:42:33,853 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 05:42:33,853 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 05:42:33,853 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 05:42:33,854 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 05:42:33,854 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 05:42:33,854 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 05:42:33,855 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 05:42:33,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {1342#(<= main_~i~0 3)} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 05:42:33,855 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 05:42:33,855 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 05:42:33,855 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 05:42:33,856 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 05:42:33,856 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 05:42:33,856 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 05:42:33,856 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 05:42:33,856 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 05:42:33,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {1335#false} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 05:42:33,856 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 05:42:33,856 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 05:42:33,856 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 05:42:33,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !(0 != #t~mem7);havoc #t~mem7; {1335#false} is VALID [2022-04-15 05:42:33,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} ~nc_B~0 := 0; {1335#false} is VALID [2022-04-15 05:42:33,857 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 05:42:33,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(0 != #t~mem9);havoc #t~mem9; {1335#false} is VALID [2022-04-15 05:42:33,857 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 05:42:33,857 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 05:42:33,857 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 05:42:33,857 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 05:42:33,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 05:42:33,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 05:42:33,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 05:42:33,858 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 05:42:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985839411] [2022-04-15 05:42:33,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985839411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074731456] [2022-04-15 05:42:33,858 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:42:33,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:33,876 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 05:42:33,880 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 05:42:33,931 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 05:42:33,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:33,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:42:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:33,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:34,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2022-04-15 05:42:34,023 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 05:42:34,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:42:34,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 05:42:34,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret15 := main(); {1334#true} is VALID [2022-04-15 05:42:34,023 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 05:42:34,023 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 05:42:34,023 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 05:42:34,023 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 05:42:34,024 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 05:42:34,024 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 05:42:34,024 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 05:42:34,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#true} assume !(~i~0 < 5); {1334#true} is VALID [2022-04-15 05:42:34,024 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 05:42:34,024 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 05:42:34,025 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 05:42:34,025 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 05:42:34,025 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 05:42:34,026 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 05:42:34,026 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 05:42:34,026 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 05:42:34,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {1342#(<= main_~i~0 3)} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 05:42:34,027 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 05:42:34,027 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 05:42:34,027 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 05:42:34,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !(0 != #t~mem7);havoc #t~mem7; {1335#false} is VALID [2022-04-15 05:42:34,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} ~nc_B~0 := 0; {1335#false} is VALID [2022-04-15 05:42:34,027 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 05:42:34,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(0 != #t~mem9);havoc #t~mem9; {1335#false} is VALID [2022-04-15 05:42:34,028 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 05:42:34,028 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 05:42:34,028 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 05:42:34,028 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 05:42:34,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 05:42:34,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 05:42:34,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 05:42:34,028 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 05:42:34,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:34,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 05:42:34,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 05:42:34,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 05:42:34,125 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 05:42:34,125 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 05:42:34,125 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 05:42:34,125 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 05:42:34,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(0 != #t~mem9);havoc #t~mem9; {1335#false} is VALID [2022-04-15 05:42:34,126 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 05:42:34,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} ~nc_B~0 := 0; {1335#false} is VALID [2022-04-15 05:42:34,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !(0 != #t~mem7);havoc #t~mem7; {1335#false} is VALID [2022-04-15 05:42:34,126 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 05:42:34,126 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 05:42:34,126 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 05:42:34,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {1495#(< main_~i~0 5)} assume !(~i~0 < 5); {1335#false} is VALID [2022-04-15 05:42:34,127 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 05:42:34,127 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 05:42:34,127 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 05:42:34,128 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 05:42:34,128 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 05:42:34,128 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 05:42:34,129 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 05:42:34,129 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 05:42:34,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#true} assume !(~i~0 < 5); {1334#true} is VALID [2022-04-15 05:42:34,129 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 05:42:34,129 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 05:42:34,129 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 05:42:34,129 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 05:42:34,130 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 05:42:34,130 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 05:42:34,130 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 05:42:34,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret15 := main(); {1334#true} is VALID [2022-04-15 05:42:34,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #124#return; {1334#true} is VALID [2022-04-15 05:42:34,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:42:34,130 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 05:42:34,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2022-04-15 05:42:34,131 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 05:42:34,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074731456] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:34,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:34,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 05:42:34,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:34,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587086629] [2022-04-15 05:42:34,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587086629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:34,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:34,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:42:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706374369] [2022-04-15 05:42:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:34,132 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 05:42:34,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:34,132 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 05:42:34,150 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 05:42:34,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:42:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:42:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:42:34,151 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 05:42:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:34,385 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-04-15 05:42:34,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:42:34,385 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 05:42:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:34,386 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 05:42:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 05:42:34,387 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 05:42:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-15 05:42:34,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-15 05:42:34,504 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 05:42:34,506 INFO L225 Difference]: With dead ends: 85 [2022-04-15 05:42:34,506 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 05:42:34,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:42:34,507 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 05:42:34,507 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 05:42:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 05:42:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2022-04-15 05:42:34,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:34,534 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 05:42:34,534 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 05:42:34,535 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 05:42:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:34,536 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-15 05:42:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-04-15 05:42:34,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:34,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:34,539 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 05:42:34,539 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 05:42:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:34,541 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-04-15 05:42:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-04-15 05:42:34,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:34,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:34,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:34,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:34,541 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 05:42:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-15 05:42:34,542 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2022-04-15 05:42:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:34,543 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-15 05:42:34,543 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 05:42:34,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-15 05:42:34,588 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 05:42:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 05:42:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 05:42:34,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:34,589 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 05:42:34,607 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 05:42:34,805 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 05:42:34,805 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 173558265, now seen corresponding path program 7 times [2022-04-15 05:42:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:34,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [66371102] [2022-04-15 05:42:34,816 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:34,816 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:34,816 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 173558265, now seen corresponding path program 8 times [2022-04-15 05:42:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:34,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093371487] [2022-04-15 05:42:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:34,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:42:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:34,939 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 05:42:34,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 05:42:34,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 05:42:34,940 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 05:42:34,940 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 05:42:34,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 05:42:34,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 05:42:34,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 05:42:34,940 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 05:42:34,941 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 05:42:34,941 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 05:42:34,941 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 05:42:34,942 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 05:42:34,942 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 05:42:34,942 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 05:42:34,943 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 05:42:34,943 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 05:42:34,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(<= main_~i~0 4)} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 05:42:34,943 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 05:42:34,943 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#false} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 05:42:34,944 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 05:42:34,944 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 05:42:34,944 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 05:42:34,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#false} assume !(0 != #t~mem7);havoc #t~mem7; {1944#false} is VALID [2022-04-15 05:42:34,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#false} ~nc_B~0 := 0; {1944#false} is VALID [2022-04-15 05:42:34,945 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 05:42:34,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#false} assume !(0 != #t~mem9);havoc #t~mem9; {1944#false} is VALID [2022-04-15 05:42:34,945 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 05:42:34,945 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 05:42:34,945 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 05:42:34,945 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 05:42:34,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 05:42:34,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 05:42:34,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 05:42:34,945 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 05:42:34,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:42:34,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093371487] [2022-04-15 05:42:34,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093371487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:42:34,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545499621] [2022-04-15 05:42:34,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:42:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:42:34,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:42:34,950 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 05:42:34,951 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 05:42:35,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:42:35,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:42:35,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:42:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:42:35,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:42:35,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 05:42:35,105 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 05:42:35,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 05:42:35,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 05:42:35,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 05:42:35,106 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 05:42:35,106 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 05:42:35,107 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 05:42:35,107 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 05:42:35,107 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 05:42:35,108 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 05:42:35,108 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 05:42:35,108 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 05:42:35,109 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 05:42:35,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(<= main_~i~0 4)} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 05:42:35,109 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 05:42:35,109 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 05:42:35,109 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 05:42:35,109 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 05:42:35,110 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 05:42:35,110 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 05:42:35,110 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 05:42:35,110 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 05:42:35,110 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 05:42:35,110 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 05:42:35,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#false} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 05:42:35,110 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 05:42:35,110 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 05:42:35,110 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 05:42:35,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#false} assume !(0 != #t~mem7);havoc #t~mem7; {1944#false} is VALID [2022-04-15 05:42:35,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#false} ~nc_B~0 := 0; {1944#false} is VALID [2022-04-15 05:42:35,111 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 05:42:35,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#false} assume !(0 != #t~mem9);havoc #t~mem9; {1944#false} is VALID [2022-04-15 05:42:35,111 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 05:42:35,111 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 05:42:35,111 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 05:42:35,111 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 05:42:35,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 05:42:35,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 05:42:35,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 05:42:35,111 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 05:42:35,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:42:35,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-15 05:42:35,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {1944#false} assume 0 == ~cond; {1944#false} is VALID [2022-04-15 05:42:35,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {1944#false} ~cond := #in~cond; {1944#false} is VALID [2022-04-15 05:42:35,219 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 05:42:35,219 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 05:42:35,219 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 05:42:35,219 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 05:42:35,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {1944#false} assume !(0 != #t~mem9);havoc #t~mem9; {1944#false} is VALID [2022-04-15 05:42:35,219 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 05:42:35,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {1944#false} ~nc_B~0 := 0; {1944#false} is VALID [2022-04-15 05:42:35,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {1944#false} assume !(0 != #t~mem7);havoc #t~mem7; {1944#false} is VALID [2022-04-15 05:42:35,220 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 05:42:35,220 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 05:42:35,220 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 05:42:35,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {1944#false} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 05:42:35,220 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 05:42:35,220 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 05:42:35,220 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 05:42:35,220 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 05:42:35,220 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 05:42:35,220 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 05:42:35,220 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 05:42:35,221 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 05:42:35,221 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 05:42:35,221 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 05:42:35,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {1952#(<= main_~i~0 4)} assume !(~i~0 < 5); {1944#false} is VALID [2022-04-15 05:42:35,221 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 05:42:35,222 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 05:42:35,222 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 05:42:35,222 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 05:42:35,223 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 05:42:35,223 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 05:42:35,223 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 05:42:35,224 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 05:42:35,224 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 05:42:35,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret15 := main(); {1943#true} is VALID [2022-04-15 05:42:35,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #124#return; {1943#true} is VALID [2022-04-15 05:42:35,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-15 05:42:35,225 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 05:42:35,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-15 05:42:35,225 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 05:42:35,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545499621] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:42:35,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:42:35,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-15 05:42:35,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:42:35,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [66371102] [2022-04-15 05:42:35,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [66371102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:42:35,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:42:35,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:42:35,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926913512] [2022-04-15 05:42:35,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:42:35,226 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 05:42:35,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:42:35,226 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 05:42:35,245 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 05:42:35,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:42:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:42:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:42:35,246 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 05:42:35,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:35,521 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-04-15 05:42:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:42:35,522 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 05:42:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:42:35,522 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 05:42:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 05:42:35,524 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 05:42:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 05:42:35,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-15 05:42:35,603 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 05:42:35,604 INFO L225 Difference]: With dead ends: 93 [2022-04-15 05:42:35,604 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 05:42:35,605 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 05:42:35,605 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 05:42:35,606 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 05:42:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 05:42:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-04-15 05:42:35,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:42:35,632 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 05:42:35,632 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 05:42:35,633 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 05:42:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:35,634 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-15 05:42:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-15 05:42:35,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:35,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:35,635 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 05:42:35,635 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 05:42:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:42:35,636 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-15 05:42:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-15 05:42:35,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:42:35,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:42:35,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:42:35,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:42:35,637 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 05:42:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-15 05:42:35,638 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2022-04-15 05:42:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:42:35,638 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-15 05:42:35,638 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 05:42:35,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-15 05:42:35,690 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 05:42:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 05:42:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 05:42:35,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:42:35,691 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 05:42:35,707 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 05:42:35,891 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 05:42:35,891 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:42:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:42:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1461422279, now seen corresponding path program 9 times [2022-04-15 05:42:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:42:35,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1956027366] [2022-04-15 05:42:35,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:42:35,906 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:42:35,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:42:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1461422279, now seen corresponding path program 10 times [2022-04-15 05:42:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:42:35,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40096982] [2022-04-15 05:42:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:42:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:42:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:35,973 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 05:42:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 05:42:36,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 05:42:36,030 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 05:42:36,030 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 05:42:36,032 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:42:36,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 05:42:36,035 INFO L719 BasicCegarLoop]: Path program histogram: [10, 2] [2022-04-15 05:42:36,037 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 05:42:36,051 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 05:42:36,052 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 05:42:36,053 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 05:42:36,053 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 05:42:36,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:42:36 BoogieIcfgContainer [2022-04-15 05:42:36,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:42:36,057 INFO L158 Benchmark]: Toolchain (without parser) took 5469.48ms. Allocated memory was 253.8MB in the beginning and 309.3MB in the end (delta: 55.6MB). Free memory was 200.9MB in the beginning and 148.4MB in the end (delta: 52.5MB). Peak memory consumption was 108.4MB. Max. memory is 8.0GB. [2022-04-15 05:42:36,057 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 253.8MB. Free memory is still 217.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:42:36,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.51ms. Allocated memory is still 253.8MB. Free memory was 200.7MB in the beginning and 224.6MB in the end (delta: -24.0MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-15 05:42:36,058 INFO L158 Benchmark]: Boogie Preprocessor took 26.67ms. Allocated memory is still 253.8MB. Free memory was 224.6MB in the beginning and 222.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 05:42:36,058 INFO L158 Benchmark]: RCFGBuilder took 345.32ms. Allocated memory is still 253.8MB. Free memory was 222.5MB in the beginning and 208.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 05:42:36,060 INFO L158 Benchmark]: TraceAbstraction took 4887.37ms. Allocated memory was 253.8MB in the beginning and 309.3MB in the end (delta: 55.6MB). Free memory was 207.9MB in the beginning and 148.4MB in the end (delta: 59.5MB). Peak memory consumption was 114.8MB. Max. memory is 8.0GB. [2022-04-15 05:42:36,060 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.12ms. Allocated memory is still 253.8MB. Free memory is still 217.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.51ms. Allocated memory is still 253.8MB. Free memory was 200.7MB in the beginning and 224.6MB in the end (delta: -24.0MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.67ms. Allocated memory is still 253.8MB. Free memory was 224.6MB in the beginning and 222.8MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 345.32ms. Allocated memory is still 253.8MB. Free memory was 222.5MB in the beginning and 208.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4887.37ms. Allocated memory was 253.8MB in the beginning and 309.3MB in the end (delta: 55.6MB). Free memory was 207.9MB in the beginning and 148.4MB in the end (delta: 59.5MB). Peak memory consumption was 114.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)<