/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/sum04-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:43:20,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:43:20,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:43:20,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:43:20,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:43:20,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:43:20,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:43:20,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:43:20,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:43:20,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:43:20,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:43:20,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:43:20,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:43:20,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:43:20,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:43:20,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:43:20,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:43:20,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:43:20,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:43:20,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:43:20,811 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:43:20,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:43:20,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:43:20,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:43:20,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:43:20,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:43:20,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:43:20,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:43:20,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:43:20,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:43:20,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:43:20,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:43:20,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:43:20,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:43:20,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:43:20,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:43:20,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:43:20,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:43:20,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:43:20,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:43:20,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:43:20,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:43:20,827 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:43:20,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:43:20,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:43:20,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:43:20,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:43:20,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:43:20,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:43:20,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:43:20,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:43:20,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:43:20,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:43:20,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:43:20,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:43:20,838 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:43:20,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:43:20,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:43:20,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:43:20,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:43:20,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:43:20,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:43:20,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:43:20,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:43:20,839 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:43:20,839 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:43:20,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:43:20,839 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:43:20,839 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:43:21,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:43:21,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:43:21,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:43:21,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:43:21,074 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:43:21,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2022-04-15 05:43:21,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1ca7b59/ee862a87fe7e405891eb42bd47e6b62b/FLAG25c9ddb9a [2022-04-15 05:43:21,490 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:43:21,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2022-04-15 05:43:21,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1ca7b59/ee862a87fe7e405891eb42bd47e6b62b/FLAG25c9ddb9a [2022-04-15 05:43:21,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab1ca7b59/ee862a87fe7e405891eb42bd47e6b62b [2022-04-15 05:43:21,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:43:21,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:43:21,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:43:21,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:43:21,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:43:21,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:43:21" (1/1) ... [2022-04-15 05:43:21,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f270822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:21, skipping insertion in model container [2022-04-15 05:43:21,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:43:21" (1/1) ... [2022-04-15 05:43:21,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:43:21,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:43:22,116 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/sum04-1.i[808,821] [2022-04-15 05:43:22,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:43:22,144 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:43:22,151 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/sum04-1.i[808,821] [2022-04-15 05:43:22,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:43:22,165 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:43:22,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22 WrapperNode [2022-04-15 05:43:22,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:43:22,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:43:22,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:43:22,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:43:22,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:43:22,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:43:22,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:43:22,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:43:22,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (1/1) ... [2022-04-15 05:43:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:43:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:22,230 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:43:22,232 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:43:22,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:43:22,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:43:22,254 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:43:22,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:43:22,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:43:22,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:43:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:43:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:43:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:43:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:43:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:43:22,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:43:22,306 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:43:22,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:43:22,428 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:43:22,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:43:22,433 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 05:43:22,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:43:22 BoogieIcfgContainer [2022-04-15 05:43:22,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:43:22,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:43:22,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:43:22,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:43:22,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:43:21" (1/3) ... [2022-04-15 05:43:22,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5f053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:43:22, skipping insertion in model container [2022-04-15 05:43:22,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:43:22" (2/3) ... [2022-04-15 05:43:22,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df5f053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:43:22, skipping insertion in model container [2022-04-15 05:43:22,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:43:22" (3/3) ... [2022-04-15 05:43:22,439 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2022-04-15 05:43:22,453 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:43:22,453 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:43:22,494 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:43:22,501 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:43:22,501 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:43:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:43:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:43:22,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:22,529 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:22,529 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-15 05:43:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:22,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939858428] [2022-04-15 05:43:22,550 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:43:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-15 05:43:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:22,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703743853] [2022-04-15 05:43:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:22,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(10, 2); {23#true} is VALID [2022-04-15 05:43:22,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 05:43:22,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 05:43:22,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:22,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(10, 2); {23#true} is VALID [2022-04-15 05:43:22,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 05:43:22,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 05:43:22,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-15 05:43:22,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-15 05:43:22,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 05:43:22,713 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-15 05:43:22,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 05:43:22,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 05:43:22,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 05:43:22,718 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:43:22,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:22,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703743853] [2022-04-15 05:43:22,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703743853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:22,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:22,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:43:22,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:22,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939858428] [2022-04-15 05:43:22,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939858428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:22,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:22,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:43:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244116390] [2022-04-15 05:43:22,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:22,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 05:43:22,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:22,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:43:22,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:22,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:43:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:22,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:43:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:43:22,768 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:43:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:22,852 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 05:43:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:43:22,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 05:43:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:43:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 05:43:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:43:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 05:43:22,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 05:43:22,911 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:43:22,916 INFO L225 Difference]: With dead ends: 31 [2022-04-15 05:43:22,916 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 05:43:22,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:43:22,920 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:22,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:43:22,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 05:43:22,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 05:43:22,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:22,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:43:22,941 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:43:22,942 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:43:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:22,943 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 05:43:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:43:22,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:22,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:22,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-15 05:43:22,944 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-15 05:43:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:22,946 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 05:43:22,946 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:43:22,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:22,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:22,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:22,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:43:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 05:43:22,949 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 05:43:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:22,949 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 05:43:22,949 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:43:22,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 05:43:22,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 05:43:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 05:43:22,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:22,964 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:22,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:43:22,964 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-15 05:43:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:22,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141313044] [2022-04-15 05:43:22,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:43:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-15 05:43:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:22,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650309240] [2022-04-15 05:43:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:23,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#(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(10, 2); {149#true} is VALID [2022-04-15 05:43:23,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 05:43:23,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-15 05:43:23,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:23,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#(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(10, 2); {149#true} is VALID [2022-04-15 05:43:23,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 05:43:23,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-15 05:43:23,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret2 := main(); {149#true} is VALID [2022-04-15 05:43:23,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {154#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:43:23,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 <= 8); {150#false} is VALID [2022-04-15 05:43:23,019 INFO L272 TraceCheckUtils]: 7: Hoare triple {150#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {150#false} is VALID [2022-04-15 05:43:23,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#false} ~cond := #in~cond; {150#false} is VALID [2022-04-15 05:43:23,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#false} assume 0 == ~cond; {150#false} is VALID [2022-04-15 05:43:23,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-15 05:43:23,019 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:43:23,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:23,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650309240] [2022-04-15 05:43:23,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650309240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:23,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:23,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:43:23,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:23,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141313044] [2022-04-15 05:43:23,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141313044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:23,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:23,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:43:23,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909725195] [2022-04-15 05:43:23,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 05:43:23,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:23,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:43:23,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:23,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:43:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:23,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:43:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:43:23,056 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:43:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:23,149 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 05:43:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:43:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 05:43:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:43:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 05:43:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:43:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 05:43:23,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-15 05:43:23,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:23,181 INFO L225 Difference]: With dead ends: 25 [2022-04-15 05:43:23,181 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 05:43:23,181 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:43:23,182 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:23,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:43:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 05:43:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 05:43:23,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:23,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:43:23,186 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:43:23,187 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:43:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:23,188 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:43:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:43:23,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:23,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:23,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-15 05:43:23,191 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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 17 states. [2022-04-15 05:43:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:23,192 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:43:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:43:23,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:23,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:23,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:23,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:43:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 05:43:23,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-15 05:43:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:23,194 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 05:43:23,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:43:23,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 05:43:23,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 05:43:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:43:23,210 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:23,211 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:23,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:43:23,211 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-15 05:43:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:23,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93320053] [2022-04-15 05:43:27,407 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:43:27,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:27,571 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash -994786162, now seen corresponding path program 1 times [2022-04-15 05:43:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:27,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236389197] [2022-04-15 05:43:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:27,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:27,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#(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(10, 2); {276#true} is VALID [2022-04-15 05:43:27,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-15 05:43:27,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #47#return; {276#true} is VALID [2022-04-15 05:43:27,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:27,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#(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(10, 2); {276#true} is VALID [2022-04-15 05:43:27,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#true} assume true; {276#true} is VALID [2022-04-15 05:43:27,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {276#true} {276#true} #47#return; {276#true} is VALID [2022-04-15 05:43:27,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {276#true} call #t~ret2 := main(); {276#true} is VALID [2022-04-15 05:43:27,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {276#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {281#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:43:27,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#(= (+ (- 1) main_~i~0) 0)} [51] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_11 v_main_~i~0_10)) (.cse1 (= v_main_~sn~0_7 v_main_~sn~0_6)) (.cse2 (= |v_main_#t~post1_4| |v_main_#t~post1_3|))) (or (and (< v_main_~i~0_11 v_main_~i~0_10) (< v_main_~i~0_10 5) (= (+ v_main_~sn~0_6 (* v_main_~i~0_11 2)) (+ v_main_~sn~0_7 (* v_main_~i~0_10 2)))) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= 4 v_main_~i~0_11) .cse2))) InVars {main_~i~0=v_main_~i~0_11, main_~sn~0=v_main_~sn~0_7, main_#t~post1=|v_main_#t~post1_4|} OutVars{main_~i~0=v_main_~i~0_10, main_~sn~0=v_main_~sn~0_6, main_#t~post1=|v_main_#t~post1_3|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {282#(<= main_~i~0 4)} is VALID [2022-04-15 05:43:27,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= main_~i~0 4)} [50] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {277#false} is VALID [2022-04-15 05:43:27,623 INFO L272 TraceCheckUtils]: 8: Hoare triple {277#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {277#false} is VALID [2022-04-15 05:43:27,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#false} ~cond := #in~cond; {277#false} is VALID [2022-04-15 05:43:27,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {277#false} assume 0 == ~cond; {277#false} is VALID [2022-04-15 05:43:27,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#false} assume !false; {277#false} is VALID [2022-04-15 05:43:27,624 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:43:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:27,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236389197] [2022-04-15 05:43:27,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236389197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:27,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:27,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:43:27,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:27,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93320053] [2022-04-15 05:43:27,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93320053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:27,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:27,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:43:27,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263816675] [2022-04-15 05:43:27,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 05:43:27,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:27,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:43:27,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:27,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:43:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:43:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:43:27,712 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:43:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:27,841 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 05:43:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:43:27,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-15 05:43:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:27,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:43:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 05:43:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:43:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-15 05:43:27,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-15 05:43:27,867 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:43:27,868 INFO L225 Difference]: With dead ends: 26 [2022-04-15 05:43:27,868 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 05:43:27,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-15 05:43:27,869 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:27,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:43:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 05:43:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-15 05:43:27,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:27,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:43:27,880 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:43:27,880 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:43:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:27,881 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 05:43:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 05:43:27,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:27,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:27,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 21 states. [2022-04-15 05:43:27,882 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 21 states. [2022-04-15 05:43:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:27,883 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 05:43:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 05:43:27,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:27,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:27,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:27,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:43:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 05:43:27,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-15 05:43:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:27,885 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 05:43:27,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:43:27,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 05:43:27,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 05:43:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:43:27,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:27,904 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:27,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 05:43:27,904 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2046664786, now seen corresponding path program 1 times [2022-04-15 05:43:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:27,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322318248] [2022-04-15 05:43:28,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:31,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:31,012 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:31,014 INFO L85 PathProgramCache]: Analyzing trace with hash 566608365, now seen corresponding path program 1 times [2022-04-15 05:43:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:31,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598100120] [2022-04-15 05:43:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:31,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:31,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#(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(10, 2); {427#true} is VALID [2022-04-15 05:43:31,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume true; {427#true} is VALID [2022-04-15 05:43:31,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {427#true} {427#true} #47#return; {427#true} is VALID [2022-04-15 05:43:31,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {436#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:31,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#(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(10, 2); {427#true} is VALID [2022-04-15 05:43:31,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2022-04-15 05:43:31,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} #47#return; {427#true} is VALID [2022-04-15 05:43:31,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {427#true} call #t~ret2 := main(); {427#true} is VALID [2022-04-15 05:43:31,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {432#(= main_~sn~0 0)} [53] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_18 v_main_~i~0_17)) (.cse1 (<= 4 v_main_~i~0_18))) (or (and (= |v_main_#t~post1_10| |v_main_#t~post1_8|) .cse0) (and .cse0 (= |v_main_#t~post1_8| |v_main_#t~post1_10|) (or (not .cse1) (not (<= v_main_~i~0_18 8)))) (and (< v_main_~i~0_18 v_main_~i~0_17) (<= v_main_~i~0_17 9) .cse1))) InVars {main_~i~0=v_main_~i~0_18, main_#t~post1=|v_main_#t~post1_10|} OutVars{main_~i~0=v_main_~i~0_17, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {432#(= main_~sn~0 0)} [54] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {432#(= main_~sn~0 0)} [55] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse1 (= v_main_~sn~0_14 v_main_~sn~0_13))) (or (and (= |v_main_#t~post1_9| |v_main_#t~post1_13|) (<= 4 v_main_~i~0_20) .cse0 .cse1) (and (< v_main_~i~0_20 v_main_~i~0_19) (< v_main_~i~0_19 5) (= (+ (* v_main_~i~0_19 2) v_main_~sn~0_14) (+ (* v_main_~i~0_20 2) v_main_~sn~0_13))) (and .cse0 (= |v_main_#t~post1_13| |v_main_#t~post1_9|) .cse1))) InVars {main_~i~0=v_main_~i~0_20, main_~sn~0=v_main_~sn~0_14, main_#t~post1=|v_main_#t~post1_13|} OutVars{main_~i~0=v_main_~i~0_19, main_~sn~0=v_main_~sn~0_13, main_#t~post1=|v_main_#t~post1_9|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {433#(or (= main_~sn~0 0) (<= main_~i~0 4))} is VALID [2022-04-15 05:43:31,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(or (= main_~sn~0 0) (<= main_~i~0 4))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,118 INFO L272 TraceCheckUtils]: 10: Hoare triple {432#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {434#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:43:31,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {434#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {435#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:43:31,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {435#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {428#false} is VALID [2022-04-15 05:43:31,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-04-15 05:43:31,121 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:43:31,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598100120] [2022-04-15 05:43:31,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598100120] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700516906] [2022-04-15 05:43:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:31,124 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:43:31,180 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:43:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:31,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:31,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:31,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {427#true} is VALID [2022-04-15 05:43:31,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#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(10, 2); {427#true} is VALID [2022-04-15 05:43:31,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2022-04-15 05:43:31,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} #47#return; {427#true} is VALID [2022-04-15 05:43:31,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {427#true} call #t~ret2 := main(); {427#true} is VALID [2022-04-15 05:43:31,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {432#(= main_~sn~0 0)} [53] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_18 v_main_~i~0_17)) (.cse1 (<= 4 v_main_~i~0_18))) (or (and (= |v_main_#t~post1_10| |v_main_#t~post1_8|) .cse0) (and .cse0 (= |v_main_#t~post1_8| |v_main_#t~post1_10|) (or (not .cse1) (not (<= v_main_~i~0_18 8)))) (and (< v_main_~i~0_18 v_main_~i~0_17) (<= v_main_~i~0_17 9) .cse1))) InVars {main_~i~0=v_main_~i~0_18, main_#t~post1=|v_main_#t~post1_10|} OutVars{main_~i~0=v_main_~i~0_17, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {432#(= main_~sn~0 0)} [54] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {432#(= main_~sn~0 0)} [55] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse1 (= v_main_~sn~0_14 v_main_~sn~0_13))) (or (and (= |v_main_#t~post1_9| |v_main_#t~post1_13|) (<= 4 v_main_~i~0_20) .cse0 .cse1) (and (< v_main_~i~0_20 v_main_~i~0_19) (< v_main_~i~0_19 5) (= (+ (* v_main_~i~0_19 2) v_main_~sn~0_14) (+ (* v_main_~i~0_20 2) v_main_~sn~0_13))) (and .cse0 (= |v_main_#t~post1_13| |v_main_#t~post1_9|) .cse1))) InVars {main_~i~0=v_main_~i~0_20, main_~sn~0=v_main_~sn~0_14, main_#t~post1=|v_main_#t~post1_13|} OutVars{main_~i~0=v_main_~i~0_19, main_~sn~0=v_main_~sn~0_13, main_#t~post1=|v_main_#t~post1_9|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {464#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:31,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {464#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {432#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:31,303 INFO L272 TraceCheckUtils]: 10: Hoare triple {432#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {471#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:31,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {475#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:31,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {428#false} is VALID [2022-04-15 05:43:31,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-04-15 05:43:31,304 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:43:31,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:31,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-04-15 05:43:31,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {475#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {428#false} is VALID [2022-04-15 05:43:31,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {475#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:31,495 INFO L272 TraceCheckUtils]: 10: Hoare triple {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {471#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:31,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [52] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:31,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [55] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse1 (= v_main_~sn~0_14 v_main_~sn~0_13))) (or (and (= |v_main_#t~post1_9| |v_main_#t~post1_13|) (<= 4 v_main_~i~0_20) .cse0 .cse1) (and (< v_main_~i~0_20 v_main_~i~0_19) (< v_main_~i~0_19 5) (= (+ (* v_main_~i~0_19 2) v_main_~sn~0_14) (+ (* v_main_~i~0_20 2) v_main_~sn~0_13))) (and .cse0 (= |v_main_#t~post1_13| |v_main_#t~post1_9|) .cse1))) InVars {main_~i~0=v_main_~i~0_20, main_~sn~0=v_main_~sn~0_14, main_#t~post1=|v_main_#t~post1_13|} OutVars{main_~i~0=v_main_~i~0_19, main_~sn~0=v_main_~sn~0_13, main_#t~post1=|v_main_#t~post1_9|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {495#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:31,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [54] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:31,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [53] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_18 v_main_~i~0_17)) (.cse1 (<= 4 v_main_~i~0_18))) (or (and (= |v_main_#t~post1_10| |v_main_#t~post1_8|) .cse0) (and .cse0 (= |v_main_#t~post1_8| |v_main_#t~post1_10|) (or (not .cse1) (not (<= v_main_~i~0_18 8)))) (and (< v_main_~i~0_18 v_main_~i~0_17) (<= v_main_~i~0_17 9) .cse1))) InVars {main_~i~0=v_main_~i~0_18, main_#t~post1=|v_main_#t~post1_10|} OutVars{main_~i~0=v_main_~i~0_17, main_#t~post1=|v_main_#t~post1_8|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:31,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {491#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:31,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {427#true} call #t~ret2 := main(); {427#true} is VALID [2022-04-15 05:43:31,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} #47#return; {427#true} is VALID [2022-04-15 05:43:31,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2022-04-15 05:43:31,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#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(10, 2); {427#true} is VALID [2022-04-15 05:43:31,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {427#true} is VALID [2022-04-15 05:43:31,498 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:43:31,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700516906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:31,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:31,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:43:31,606 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:31,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322318248] [2022-04-15 05:43:31,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322318248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:31,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:31,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:43:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69672499] [2022-04-15 05:43:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:31,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-15 05:43:31,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:31,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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:43:31,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:31,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:43:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:43:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-15 05:43:31,623 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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:43:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:31,912 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-15 05:43:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:43:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-15 05:43:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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:43:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-15 05:43:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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:43:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-15 05:43:31,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-15 05:43:31,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:31,942 INFO L225 Difference]: With dead ends: 34 [2022-04-15 05:43:31,943 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:43:31,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:43:31,943 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:31,944 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:43:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:43:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 05:43:31,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:31,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:43:31,962 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:43:31,962 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:43:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:31,963 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 05:43:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 05:43:31,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:31,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:31,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 26 states. [2022-04-15 05:43:31,964 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 26 states. [2022-04-15 05:43:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:31,965 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 05:43:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 05:43:31,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:31,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:31,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:31,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:43:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 05:43:31,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-15 05:43:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:31,967 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 05:43:31,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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:43:31,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 05:43:31,992 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:43:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 05:43:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 05:43:31,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:31,993 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:32,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 05:43:32,209 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:32,209 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:32,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:32,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1412427221, now seen corresponding path program 2 times [2022-04-15 05:43:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:32,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1563376260] [2022-04-15 05:43:32,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:36,516 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:43:36,593 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:36,594 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1678826771, now seen corresponding path program 1 times [2022-04-15 05:43:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049125945] [2022-04-15 05:43:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:36,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {717#(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(10, 2); {710#true} is VALID [2022-04-15 05:43:36,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#true} assume true; {710#true} is VALID [2022-04-15 05:43:36,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {710#true} {710#true} #47#return; {710#true} is VALID [2022-04-15 05:43:36,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:36,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {717#(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(10, 2); {710#true} is VALID [2022-04-15 05:43:36,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2022-04-15 05:43:36,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #47#return; {710#true} is VALID [2022-04-15 05:43:36,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret2 := main(); {710#true} is VALID [2022-04-15 05:43:36,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {715#(= main_~i~0 1)} is VALID [2022-04-15 05:43:36,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {715#(= main_~i~0 1)} [57] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_23| |v_main_#t~post1_21|)) (.cse1 (= v_main_~i~0_36 v_main_~i~0_35)) (.cse2 (<= 4 v_main_~i~0_36))) (or (and .cse0 .cse1) (and (or (not (<= v_main_~i~0_36 8)) (not .cse2)) .cse0 .cse1) (and (< v_main_~i~0_36 v_main_~i~0_35) (<= v_main_~i~0_35 9) .cse2))) InVars {main_~i~0=v_main_~i~0_36, main_#t~post1=|v_main_#t~post1_23|} OutVars{main_~i~0=v_main_~i~0_35, main_#t~post1=|v_main_#t~post1_21|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {715#(= main_~i~0 1)} is VALID [2022-04-15 05:43:36,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#(= main_~i~0 1)} [58] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {715#(= main_~i~0 1)} is VALID [2022-04-15 05:43:36,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#(= main_~i~0 1)} [59] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse1 (= |v_main_#t~post1_26| |v_main_#t~post1_22|)) (.cse2 (= v_main_~sn~0_24 v_main_~sn~0_23))) (or (and (< v_main_~i~0_38 v_main_~i~0_37) (= (+ (* v_main_~i~0_37 2) v_main_~sn~0_24) (+ (* v_main_~i~0_38 2) v_main_~sn~0_23)) (< v_main_~i~0_37 5)) (and .cse0 .cse1 .cse2) (and .cse0 (<= 4 v_main_~i~0_38) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_38, main_~sn~0=v_main_~sn~0_24, main_#t~post1=|v_main_#t~post1_26|} OutVars{main_~i~0=v_main_~i~0_37, main_~sn~0=v_main_~sn~0_23, main_#t~post1=|v_main_#t~post1_22|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {716#(<= main_~i~0 4)} is VALID [2022-04-15 05:43:36,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#(<= main_~i~0 4)} [56] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {711#false} is VALID [2022-04-15 05:43:36,658 INFO L272 TraceCheckUtils]: 10: Hoare triple {711#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {711#false} is VALID [2022-04-15 05:43:36,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {711#false} ~cond := #in~cond; {711#false} is VALID [2022-04-15 05:43:36,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {711#false} assume 0 == ~cond; {711#false} is VALID [2022-04-15 05:43:36,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-04-15 05:43:36,659 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:43:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049125945] [2022-04-15 05:43:36,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049125945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655069126] [2022-04-15 05:43:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:36,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:36,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:36,660 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:43:36,661 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:43:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:36,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:36,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:36,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2022-04-15 05:43:36,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#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(10, 2); {710#true} is VALID [2022-04-15 05:43:36,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2022-04-15 05:43:36,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #47#return; {710#true} is VALID [2022-04-15 05:43:36,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret2 := main(); {710#true} is VALID [2022-04-15 05:43:36,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {736#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:36,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {736#(= main_~sn~0 0)} [57] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_23| |v_main_#t~post1_21|)) (.cse1 (= v_main_~i~0_36 v_main_~i~0_35)) (.cse2 (<= 4 v_main_~i~0_36))) (or (and .cse0 .cse1) (and (or (not (<= v_main_~i~0_36 8)) (not .cse2)) .cse0 .cse1) (and (< v_main_~i~0_36 v_main_~i~0_35) (<= v_main_~i~0_35 9) .cse2))) InVars {main_~i~0=v_main_~i~0_36, main_#t~post1=|v_main_#t~post1_23|} OutVars{main_~i~0=v_main_~i~0_35, main_#t~post1=|v_main_#t~post1_21|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {736#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:36,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {736#(= main_~sn~0 0)} [58] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {736#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:36,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {736#(= main_~sn~0 0)} [59] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse1 (= |v_main_#t~post1_26| |v_main_#t~post1_22|)) (.cse2 (= v_main_~sn~0_24 v_main_~sn~0_23))) (or (and (< v_main_~i~0_38 v_main_~i~0_37) (= (+ (* v_main_~i~0_37 2) v_main_~sn~0_24) (+ (* v_main_~i~0_38 2) v_main_~sn~0_23)) (< v_main_~i~0_37 5)) (and .cse0 .cse1 .cse2) (and .cse0 (<= 4 v_main_~i~0_38) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_38, main_~sn~0=v_main_~sn~0_24, main_#t~post1=|v_main_#t~post1_26|} OutVars{main_~i~0=v_main_~i~0_37, main_~sn~0=v_main_~sn~0_23, main_#t~post1=|v_main_#t~post1_22|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {746#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:36,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {746#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} [56] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {736#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:36,802 INFO L272 TraceCheckUtils]: 10: Hoare triple {736#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {753#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:36,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {757#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:36,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {757#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {711#false} is VALID [2022-04-15 05:43:36,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-04-15 05:43:36,803 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:43:36,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:36,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {711#false} assume !false; {711#false} is VALID [2022-04-15 05:43:36,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {757#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {711#false} is VALID [2022-04-15 05:43:36,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {757#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:37,000 INFO L272 TraceCheckUtils]: 10: Hoare triple {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {753#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:37,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {777#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [56] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:37,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [59] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_38 v_main_~i~0_37)) (.cse1 (= |v_main_#t~post1_26| |v_main_#t~post1_22|)) (.cse2 (= v_main_~sn~0_24 v_main_~sn~0_23))) (or (and (< v_main_~i~0_38 v_main_~i~0_37) (= (+ (* v_main_~i~0_37 2) v_main_~sn~0_24) (+ (* v_main_~i~0_38 2) v_main_~sn~0_23)) (< v_main_~i~0_37 5)) (and .cse0 .cse1 .cse2) (and .cse0 (<= 4 v_main_~i~0_38) .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_38, main_~sn~0=v_main_~sn~0_24, main_#t~post1=|v_main_#t~post1_26|} OutVars{main_~i~0=v_main_~i~0_37, main_~sn~0=v_main_~sn~0_23, main_#t~post1=|v_main_#t~post1_22|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {777#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:37,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [58] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:37,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [57] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_23| |v_main_#t~post1_21|)) (.cse1 (= v_main_~i~0_36 v_main_~i~0_35)) (.cse2 (<= 4 v_main_~i~0_36))) (or (and .cse0 .cse1) (and (or (not (<= v_main_~i~0_36 8)) (not .cse2)) .cse0 .cse1) (and (< v_main_~i~0_36 v_main_~i~0_35) (<= v_main_~i~0_35 9) .cse2))) InVars {main_~i~0=v_main_~i~0_36, main_#t~post1=|v_main_#t~post1_23|} OutVars{main_~i~0=v_main_~i~0_35, main_#t~post1=|v_main_#t~post1_21|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:37,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {710#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {773#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:37,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret2 := main(); {710#true} is VALID [2022-04-15 05:43:37,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #47#return; {710#true} is VALID [2022-04-15 05:43:37,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2022-04-15 05:43:37,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#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(10, 2); {710#true} is VALID [2022-04-15 05:43:37,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2022-04-15 05:43:37,011 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:43:37,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655069126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:37,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:37,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-15 05:43:37,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:37,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1563376260] [2022-04-15 05:43:37,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1563376260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:37,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:37,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:43:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441607973] [2022-04-15 05:43:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:37,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2022-04-15 05:43:37,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:37,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:43:37,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:37,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:43:37,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:37,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:43:37,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:43:37,100 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:43:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:37,231 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 05:43:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:43:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2022-04-15 05:43:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:43:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 05:43:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:43:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 05:43:37,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 05:43:37,259 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:43:37,260 INFO L225 Difference]: With dead ends: 37 [2022-04-15 05:43:37,260 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 05:43:37,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:43:37,261 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:37,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:43:37,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 05:43:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 05:43:37,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:37,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:43:37,280 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:43:37,280 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:43:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:37,281 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 05:43:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 05:43:37,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:37,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:37,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-15 05:43:37,281 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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 26 states. [2022-04-15 05:43:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:37,282 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 05:43:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 05:43:37,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:37,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:37,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:37,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:43:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 05:43:37,283 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2022-04-15 05:43:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:37,283 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 05:43:37,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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:43:37,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 05:43:37,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 05:43:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:43:37,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:37,304 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:37,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 05:43:37,519 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:37,520 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash -402263410, now seen corresponding path program 3 times [2022-04-15 05:43:37,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:37,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1711757827] [2022-04-15 05:43:37,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:37,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:37,870 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:37,872 INFO L85 PathProgramCache]: Analyzing trace with hash 370705389, now seen corresponding path program 1 times [2022-04-15 05:43:37,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:37,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260311313] [2022-04-15 05:43:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:37,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:37,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {1000#(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(10, 2); {991#true} is VALID [2022-04-15 05:43:37,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {991#true} assume true; {991#true} is VALID [2022-04-15 05:43:37,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {991#true} {991#true} #47#return; {991#true} is VALID [2022-04-15 05:43:37,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {991#true} call ULTIMATE.init(); {1000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:37,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#(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(10, 2); {991#true} is VALID [2022-04-15 05:43:37,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {991#true} assume true; {991#true} is VALID [2022-04-15 05:43:37,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {991#true} {991#true} #47#return; {991#true} is VALID [2022-04-15 05:43:37,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {991#true} call #t~ret2 := main(); {991#true} is VALID [2022-04-15 05:43:37,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {991#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:37,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {996#(= main_~sn~0 0)} [61] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_54)) (.cse1 (= v_main_~i~0_54 v_main_~i~0_53))) (or (and (or (not (<= v_main_~i~0_54 8)) (not .cse0)) (= |v_main_#t~post1_34| |v_main_#t~post1_36|) .cse1) (and (<= v_main_~i~0_53 9) .cse0 (< v_main_~i~0_54 v_main_~i~0_53)) (and (= |v_main_#t~post1_36| |v_main_#t~post1_34|) .cse1))) InVars {main_~i~0=v_main_~i~0_54, main_#t~post1=|v_main_#t~post1_36|} OutVars{main_~i~0=v_main_~i~0_53, main_#t~post1=|v_main_#t~post1_34|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:37,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#(= main_~sn~0 0)} [62] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:37,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#(= main_~sn~0 0)} [63] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_39| |v_main_#t~post1_35|)) (.cse1 (= v_main_~sn~0_35 v_main_~sn~0_34)) (.cse2 (= v_main_~i~0_56 v_main_~i~0_55))) (or (and .cse0 .cse1 .cse2) (and (< v_main_~i~0_55 5) (< v_main_~i~0_56 v_main_~i~0_55) (= (+ (* v_main_~i~0_55 2) v_main_~sn~0_35) (+ (* v_main_~i~0_56 2) v_main_~sn~0_34))) (and .cse0 .cse1 (not (< v_main_~i~0_56 4)) .cse2))) InVars {main_~i~0=v_main_~i~0_56, main_~sn~0=v_main_~sn~0_35, main_#t~post1=|v_main_#t~post1_39|} OutVars{main_~i~0=v_main_~i~0_55, main_~sn~0=v_main_~sn~0_34, main_#t~post1=|v_main_#t~post1_35|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {997#(or (= main_~sn~0 0) (<= main_~i~0 4))} is VALID [2022-04-15 05:43:37,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#(or (= main_~sn~0 0) (<= main_~i~0 4))} [60] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:37,928 INFO L272 TraceCheckUtils]: 10: Hoare triple {996#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {998#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:43:37,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {998#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {999#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:43:37,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {992#false} is VALID [2022-04-15 05:43:37,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#false} assume !false; {992#false} is VALID [2022-04-15 05:43:37,929 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:43:37,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260311313] [2022-04-15 05:43:37,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260311313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:37,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852708305] [2022-04-15 05:43:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:37,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:37,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:37,931 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:43:37,932 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:43:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:38,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:38,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:38,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {991#true} call ULTIMATE.init(); {991#true} is VALID [2022-04-15 05:43:38,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {991#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(10, 2); {991#true} is VALID [2022-04-15 05:43:38,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {991#true} assume true; {991#true} is VALID [2022-04-15 05:43:38,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {991#true} {991#true} #47#return; {991#true} is VALID [2022-04-15 05:43:38,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {991#true} call #t~ret2 := main(); {991#true} is VALID [2022-04-15 05:43:38,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {991#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:38,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {996#(= main_~sn~0 0)} [61] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_54)) (.cse1 (= v_main_~i~0_54 v_main_~i~0_53))) (or (and (or (not (<= v_main_~i~0_54 8)) (not .cse0)) (= |v_main_#t~post1_34| |v_main_#t~post1_36|) .cse1) (and (<= v_main_~i~0_53 9) .cse0 (< v_main_~i~0_54 v_main_~i~0_53)) (and (= |v_main_#t~post1_36| |v_main_#t~post1_34|) .cse1))) InVars {main_~i~0=v_main_~i~0_54, main_#t~post1=|v_main_#t~post1_36|} OutVars{main_~i~0=v_main_~i~0_53, main_#t~post1=|v_main_#t~post1_34|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:38,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#(= main_~sn~0 0)} [62] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:38,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#(= main_~sn~0 0)} [63] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_39| |v_main_#t~post1_35|)) (.cse1 (= v_main_~sn~0_35 v_main_~sn~0_34)) (.cse2 (= v_main_~i~0_56 v_main_~i~0_55))) (or (and .cse0 .cse1 .cse2) (and (< v_main_~i~0_55 5) (< v_main_~i~0_56 v_main_~i~0_55) (= (+ (* v_main_~i~0_55 2) v_main_~sn~0_35) (+ (* v_main_~i~0_56 2) v_main_~sn~0_34))) (and .cse0 .cse1 (not (< v_main_~i~0_56 4)) .cse2))) InVars {main_~i~0=v_main_~i~0_56, main_~sn~0=v_main_~sn~0_35, main_#t~post1=|v_main_#t~post1_39|} OutVars{main_~i~0=v_main_~i~0_55, main_~sn~0=v_main_~sn~0_34, main_#t~post1=|v_main_#t~post1_35|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1028#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:38,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {1028#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} [60] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {996#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:38,111 INFO L272 TraceCheckUtils]: 10: Hoare triple {996#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:38,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:38,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {1039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {992#false} is VALID [2022-04-15 05:43:38,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#false} assume !false; {992#false} is VALID [2022-04-15 05:43:38,112 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:43:38,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:38,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {992#false} assume !false; {992#false} is VALID [2022-04-15 05:43:38,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {1039#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {992#false} is VALID [2022-04-15 05:43:38,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1039#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:38,254 INFO L272 TraceCheckUtils]: 10: Hoare triple {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1035#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:38,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {1059#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [60] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:38,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [63] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_39| |v_main_#t~post1_35|)) (.cse1 (= v_main_~sn~0_35 v_main_~sn~0_34)) (.cse2 (= v_main_~i~0_56 v_main_~i~0_55))) (or (and .cse0 .cse1 .cse2) (and (< v_main_~i~0_55 5) (< v_main_~i~0_56 v_main_~i~0_55) (= (+ (* v_main_~i~0_55 2) v_main_~sn~0_35) (+ (* v_main_~i~0_56 2) v_main_~sn~0_34))) (and .cse0 .cse1 (not (< v_main_~i~0_56 4)) .cse2))) InVars {main_~i~0=v_main_~i~0_56, main_~sn~0=v_main_~sn~0_35, main_#t~post1=|v_main_#t~post1_39|} OutVars{main_~i~0=v_main_~i~0_55, main_~sn~0=v_main_~sn~0_34, main_#t~post1=|v_main_#t~post1_35|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1059#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:38,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [62] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:38,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [61] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_54)) (.cse1 (= v_main_~i~0_54 v_main_~i~0_53))) (or (and (or (not (<= v_main_~i~0_54 8)) (not .cse0)) (= |v_main_#t~post1_34| |v_main_#t~post1_36|) .cse1) (and (<= v_main_~i~0_53 9) .cse0 (< v_main_~i~0_54 v_main_~i~0_53)) (and (= |v_main_#t~post1_36| |v_main_#t~post1_34|) .cse1))) InVars {main_~i~0=v_main_~i~0_54, main_#t~post1=|v_main_#t~post1_36|} OutVars{main_~i~0=v_main_~i~0_53, main_#t~post1=|v_main_#t~post1_34|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:38,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {991#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1055#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:38,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {991#true} call #t~ret2 := main(); {991#true} is VALID [2022-04-15 05:43:38,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {991#true} {991#true} #47#return; {991#true} is VALID [2022-04-15 05:43:38,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {991#true} assume true; {991#true} is VALID [2022-04-15 05:43:38,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {991#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(10, 2); {991#true} is VALID [2022-04-15 05:43:38,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {991#true} call ULTIMATE.init(); {991#true} is VALID [2022-04-15 05:43:38,256 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:43:38,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852708305] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:38,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:38,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:43:38,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:38,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1711757827] [2022-04-15 05:43:38,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1711757827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:38,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:38,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:43:38,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845316543] [2022-04-15 05:43:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:38,404 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-15 05:43:38,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:38,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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:43:38,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:38,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:43:38,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:38,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:43:38,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:43:38,420 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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:43:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:38,879 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-15 05:43:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:43:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-15 05:43:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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:43:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-15 05:43:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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:43:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 42 transitions. [2022-04-15 05:43:38,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 42 transitions. [2022-04-15 05:43:38,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:38,914 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:43:38,914 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 05:43:38,914 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2022-04-15 05:43:38,915 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:38,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 63 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:43:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 05:43:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-15 05:43:38,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:38,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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:43:38,940 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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:43:38,940 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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:43:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:38,941 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 05:43:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 05:43:38,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:38,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:38,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 32 states. [2022-04-15 05:43:38,941 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 32 states. [2022-04-15 05:43:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:38,942 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-15 05:43:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 05:43:38,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:38,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:38,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:38,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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:43:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 05:43:38,943 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-04-15 05:43:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:38,943 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 05:43:38,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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:43:38,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 05:43:38,973 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:43:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 05:43:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:43:38,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:38,973 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:38,990 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:43:39,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:39,183 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1448012981, now seen corresponding path program 4 times [2022-04-15 05:43:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:39,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [132555570] [2022-04-15 05:43:39,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:39,701 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:39,702 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1874729747, now seen corresponding path program 1 times [2022-04-15 05:43:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386915256] [2022-04-15 05:43:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:39,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {1331#(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(10, 2); {1322#true} is VALID [2022-04-15 05:43:39,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {1322#true} assume true; {1322#true} is VALID [2022-04-15 05:43:39,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1322#true} {1322#true} #47#return; {1322#true} is VALID [2022-04-15 05:43:39,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {1322#true} call ULTIMATE.init(); {1331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:39,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {1331#(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(10, 2); {1322#true} is VALID [2022-04-15 05:43:39,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {1322#true} assume true; {1322#true} is VALID [2022-04-15 05:43:39,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1322#true} {1322#true} #47#return; {1322#true} is VALID [2022-04-15 05:43:39,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {1322#true} call #t~ret2 := main(); {1322#true} is VALID [2022-04-15 05:43:39,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {1322#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#(= main_~sn~0 0)} [65] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_74 v_main_~i~0_73)) (.cse1 (= |v_main_#t~post1_49| |v_main_#t~post1_47|)) (.cse2 (<= 4 v_main_~i~0_74))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (<= v_main_~i~0_74 8))) .cse1) (and .cse2 (< v_main_~i~0_74 v_main_~i~0_73) (<= v_main_~i~0_73 9)))) InVars {main_~i~0=v_main_~i~0_74, main_#t~post1=|v_main_#t~post1_49|} OutVars{main_~i~0=v_main_~i~0_73, main_#t~post1=|v_main_#t~post1_47|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#(= main_~sn~0 0)} [66] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {1327#(= main_~sn~0 0)} [67] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_47 v_main_~sn~0_46)) (.cse1 (= v_main_~i~0_76 v_main_~i~0_75))) (or (and .cse0 (not (< v_main_~i~0_76 4)) (= |v_main_#t~post1_48| |v_main_#t~post1_52|) .cse1) (and .cse0 (= |v_main_#t~post1_52| |v_main_#t~post1_48|) .cse1) (and (= (+ (* v_main_~i~0_76 2) v_main_~sn~0_46) (+ (* v_main_~i~0_75 2) v_main_~sn~0_47)) (< v_main_~i~0_76 v_main_~i~0_75) (< v_main_~i~0_75 5)))) InVars {main_~i~0=v_main_~i~0_76, main_~sn~0=v_main_~sn~0_47, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~i~0=v_main_~i~0_75, main_~sn~0=v_main_~sn~0_46, main_#t~post1=|v_main_#t~post1_48|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1328#(or (= main_~sn~0 0) (<= main_~i~0 4))} is VALID [2022-04-15 05:43:39,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {1328#(or (= main_~sn~0 0) (<= main_~i~0 4))} [64] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,808 INFO L272 TraceCheckUtils]: 10: Hoare triple {1327#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:43:39,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1330#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:43:39,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1330#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1323#false} is VALID [2022-04-15 05:43:39,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {1323#false} assume !false; {1323#false} is VALID [2022-04-15 05:43:39,809 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:43:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:39,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386915256] [2022-04-15 05:43:39,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386915256] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:39,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139664024] [2022-04-15 05:43:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:39,819 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:43:39,820 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:43:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:39,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:39,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:39,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {1322#true} call ULTIMATE.init(); {1322#true} is VALID [2022-04-15 05:43:39,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1322#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(10, 2); {1322#true} is VALID [2022-04-15 05:43:39,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {1322#true} assume true; {1322#true} is VALID [2022-04-15 05:43:39,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1322#true} {1322#true} #47#return; {1322#true} is VALID [2022-04-15 05:43:39,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {1322#true} call #t~ret2 := main(); {1322#true} is VALID [2022-04-15 05:43:39,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {1322#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {1327#(= main_~sn~0 0)} [65] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_74 v_main_~i~0_73)) (.cse1 (= |v_main_#t~post1_49| |v_main_#t~post1_47|)) (.cse2 (<= 4 v_main_~i~0_74))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (<= v_main_~i~0_74 8))) .cse1) (and .cse2 (< v_main_~i~0_74 v_main_~i~0_73) (<= v_main_~i~0_73 9)))) InVars {main_~i~0=v_main_~i~0_74, main_#t~post1=|v_main_#t~post1_49|} OutVars{main_~i~0=v_main_~i~0_73, main_#t~post1=|v_main_#t~post1_47|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {1327#(= main_~sn~0 0)} [66] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {1327#(= main_~sn~0 0)} [67] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_47 v_main_~sn~0_46)) (.cse1 (= v_main_~i~0_76 v_main_~i~0_75))) (or (and .cse0 (not (< v_main_~i~0_76 4)) (= |v_main_#t~post1_48| |v_main_#t~post1_52|) .cse1) (and .cse0 (= |v_main_#t~post1_52| |v_main_#t~post1_48|) .cse1) (and (= (+ (* v_main_~i~0_76 2) v_main_~sn~0_46) (+ (* v_main_~i~0_75 2) v_main_~sn~0_47)) (< v_main_~i~0_76 v_main_~i~0_75) (< v_main_~i~0_75 5)))) InVars {main_~i~0=v_main_~i~0_76, main_~sn~0=v_main_~sn~0_47, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~i~0=v_main_~i~0_75, main_~sn~0=v_main_~sn~0_46, main_#t~post1=|v_main_#t~post1_48|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1359#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:39,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {1359#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} [64] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {1327#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:39,966 INFO L272 TraceCheckUtils]: 10: Hoare triple {1327#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:39,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:39,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {1370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1323#false} is VALID [2022-04-15 05:43:39,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {1323#false} assume !false; {1323#false} is VALID [2022-04-15 05:43:39,967 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:43:39,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:40,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {1323#false} assume !false; {1323#false} is VALID [2022-04-15 05:43:40,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1323#false} is VALID [2022-04-15 05:43:40,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:40,122 INFO L272 TraceCheckUtils]: 10: Hoare triple {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:40,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [64] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:40,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [67] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~sn~0_47 v_main_~sn~0_46)) (.cse1 (= v_main_~i~0_76 v_main_~i~0_75))) (or (and .cse0 (not (< v_main_~i~0_76 4)) (= |v_main_#t~post1_48| |v_main_#t~post1_52|) .cse1) (and .cse0 (= |v_main_#t~post1_52| |v_main_#t~post1_48|) .cse1) (and (= (+ (* v_main_~i~0_76 2) v_main_~sn~0_46) (+ (* v_main_~i~0_75 2) v_main_~sn~0_47)) (< v_main_~i~0_76 v_main_~i~0_75) (< v_main_~i~0_75 5)))) InVars {main_~i~0=v_main_~i~0_76, main_~sn~0=v_main_~sn~0_47, main_#t~post1=|v_main_#t~post1_52|} OutVars{main_~i~0=v_main_~i~0_75, main_~sn~0=v_main_~sn~0_46, main_#t~post1=|v_main_#t~post1_48|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1390#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:40,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [66] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:40,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [65] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_74 v_main_~i~0_73)) (.cse1 (= |v_main_#t~post1_49| |v_main_#t~post1_47|)) (.cse2 (<= 4 v_main_~i~0_74))) (or (and .cse0 .cse1) (and .cse0 (or (not .cse2) (not (<= v_main_~i~0_74 8))) .cse1) (and .cse2 (< v_main_~i~0_74 v_main_~i~0_73) (<= v_main_~i~0_73 9)))) InVars {main_~i~0=v_main_~i~0_74, main_#t~post1=|v_main_#t~post1_49|} OutVars{main_~i~0=v_main_~i~0_73, main_#t~post1=|v_main_#t~post1_47|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:40,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {1322#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1386#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:40,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {1322#true} call #t~ret2 := main(); {1322#true} is VALID [2022-04-15 05:43:40,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1322#true} {1322#true} #47#return; {1322#true} is VALID [2022-04-15 05:43:40,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {1322#true} assume true; {1322#true} is VALID [2022-04-15 05:43:40,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1322#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(10, 2); {1322#true} is VALID [2022-04-15 05:43:40,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {1322#true} call ULTIMATE.init(); {1322#true} is VALID [2022-04-15 05:43:40,125 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:43:40,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139664024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:40,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:40,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:43:40,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:40,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [132555570] [2022-04-15 05:43:40,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [132555570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:40,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:40,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:43:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311827757] [2022-04-15 05:43:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-15 05:43:40,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:40,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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:43:40,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:40,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:43:40,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:40,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:43:40,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:43:40,399 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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:43:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:41,033 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-15 05:43:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:43:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-15 05:43:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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:43:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-15 05:43:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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:43:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-15 05:43:41,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2022-04-15 05:43:41,068 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:43:41,068 INFO L225 Difference]: With dead ends: 46 [2022-04-15 05:43:41,068 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 05:43:41,069 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:43:41,069 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:41,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 68 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:43:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 05:43:41,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-04-15 05:43:41,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:41,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:43:41,097 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:43:41,097 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:43:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:41,098 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 05:43:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 05:43:41,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:41,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:41,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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 38 states. [2022-04-15 05:43:41,099 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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 38 states. [2022-04-15 05:43:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:41,104 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 05:43:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 05:43:41,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:41,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:41,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:41,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:43:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 05:43:41,106 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 26 [2022-04-15 05:43:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:41,106 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 05:43:41,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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:43:41,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 05:43:41,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 05:43:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:43:41,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:41,140 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:41,157 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:43:41,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:41,341 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1841039991, now seen corresponding path program 5 times [2022-04-15 05:43:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:41,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2030549167] [2022-04-15 05:43:41,544 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:41,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:41,703 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash 174802413, now seen corresponding path program 1 times [2022-04-15 05:43:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:41,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117450983] [2022-04-15 05:43:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:41,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:41,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {1697#(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(10, 2); {1689#true} is VALID [2022-04-15 05:43:41,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1689#true} assume true; {1689#true} is VALID [2022-04-15 05:43:41,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1689#true} {1689#true} #47#return; {1689#true} is VALID [2022-04-15 05:43:41,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {1689#true} call ULTIMATE.init(); {1697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:41,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1697#(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(10, 2); {1689#true} is VALID [2022-04-15 05:43:41,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1689#true} assume true; {1689#true} is VALID [2022-04-15 05:43:41,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1689#true} {1689#true} #47#return; {1689#true} is VALID [2022-04-15 05:43:41,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {1689#true} call #t~ret2 := main(); {1689#true} is VALID [2022-04-15 05:43:41,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1689#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1694#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:43:41,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {1694#(= (+ (- 1) main_~i~0) 0)} [69] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_95)) (.cse1 (= v_main_~i~0_95 v_main_~i~0_94)) (.cse2 (= |v_main_#t~post1_62| |v_main_#t~post1_60|))) (or (and (< v_main_~i~0_95 v_main_~i~0_94) .cse0 (<= v_main_~i~0_94 9)) (and .cse1 (or (not (<= v_main_~i~0_95 8)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_95, main_#t~post1=|v_main_#t~post1_62|} OutVars{main_~i~0=v_main_~i~0_94, main_#t~post1=|v_main_#t~post1_60|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1695#(<= main_~i~0 1)} is VALID [2022-04-15 05:43:41,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {1695#(<= main_~i~0 1)} [70] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1695#(<= main_~i~0 1)} is VALID [2022-04-15 05:43:41,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {1695#(<= main_~i~0 1)} [71] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_65| |v_main_#t~post1_61|)) (.cse1 (= v_main_~i~0_97 v_main_~i~0_96))) (or (and (= v_main_~sn~0_60 v_main_~sn~0_59) .cse0 .cse1) (and (< v_main_~i~0_97 v_main_~i~0_96) (= (+ (* v_main_~i~0_97 2) v_main_~sn~0_59) (+ (* v_main_~i~0_96 2) v_main_~sn~0_60)) (< v_main_~i~0_96 5)) (and (= v_main_~sn~0_59 v_main_~sn~0_60) (<= 4 v_main_~i~0_97) .cse0 .cse1))) InVars {main_~i~0=v_main_~i~0_97, main_~sn~0=v_main_~sn~0_60, main_#t~post1=|v_main_#t~post1_65|} OutVars{main_~i~0=v_main_~i~0_96, main_~sn~0=v_main_~sn~0_59, main_#t~post1=|v_main_#t~post1_61|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1696#(<= main_~i~0 4)} is VALID [2022-04-15 05:43:41,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1696#(<= main_~i~0 4)} [68] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {1690#false} is VALID [2022-04-15 05:43:41,776 INFO L272 TraceCheckUtils]: 10: Hoare triple {1690#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1690#false} is VALID [2022-04-15 05:43:41,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {1690#false} ~cond := #in~cond; {1690#false} is VALID [2022-04-15 05:43:41,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1690#false} assume 0 == ~cond; {1690#false} is VALID [2022-04-15 05:43:41,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {1690#false} assume !false; {1690#false} is VALID [2022-04-15 05:43:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:43:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117450983] [2022-04-15 05:43:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117450983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117516698] [2022-04-15 05:43:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:41,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:41,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:41,778 INFO L229 MonitoredProcess]: Starting monitored process 6 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:43:41,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 05:43:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:41,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:41,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:41,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {1689#true} call ULTIMATE.init(); {1689#true} is VALID [2022-04-15 05:43:41,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {1689#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(10, 2); {1689#true} is VALID [2022-04-15 05:43:41,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {1689#true} assume true; {1689#true} is VALID [2022-04-15 05:43:41,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1689#true} {1689#true} #47#return; {1689#true} is VALID [2022-04-15 05:43:41,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {1689#true} call #t~ret2 := main(); {1689#true} is VALID [2022-04-15 05:43:41,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {1689#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1716#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:41,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {1716#(= main_~sn~0 0)} [69] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_95)) (.cse1 (= v_main_~i~0_95 v_main_~i~0_94)) (.cse2 (= |v_main_#t~post1_62| |v_main_#t~post1_60|))) (or (and (< v_main_~i~0_95 v_main_~i~0_94) .cse0 (<= v_main_~i~0_94 9)) (and .cse1 (or (not (<= v_main_~i~0_95 8)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_95, main_#t~post1=|v_main_#t~post1_62|} OutVars{main_~i~0=v_main_~i~0_94, main_#t~post1=|v_main_#t~post1_60|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1716#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:41,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {1716#(= main_~sn~0 0)} [70] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1716#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:41,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {1716#(= main_~sn~0 0)} [71] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_65| |v_main_#t~post1_61|)) (.cse1 (= v_main_~i~0_97 v_main_~i~0_96))) (or (and (= v_main_~sn~0_60 v_main_~sn~0_59) .cse0 .cse1) (and (< v_main_~i~0_97 v_main_~i~0_96) (= (+ (* v_main_~i~0_97 2) v_main_~sn~0_59) (+ (* v_main_~i~0_96 2) v_main_~sn~0_60)) (< v_main_~i~0_96 5)) (and (= v_main_~sn~0_59 v_main_~sn~0_60) (<= 4 v_main_~i~0_97) .cse0 .cse1))) InVars {main_~i~0=v_main_~i~0_97, main_~sn~0=v_main_~sn~0_60, main_#t~post1=|v_main_#t~post1_65|} OutVars{main_~i~0=v_main_~i~0_96, main_~sn~0=v_main_~sn~0_59, main_#t~post1=|v_main_#t~post1_61|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1726#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:41,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {1726#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} [68] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {1716#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:41,915 INFO L272 TraceCheckUtils]: 10: Hoare triple {1716#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:41,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:41,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {1737#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1690#false} is VALID [2022-04-15 05:43:41,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {1690#false} assume !false; {1690#false} is VALID [2022-04-15 05:43:41,921 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:43:41,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:42,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1690#false} assume !false; {1690#false} is VALID [2022-04-15 05:43:42,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {1737#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1690#false} is VALID [2022-04-15 05:43:42,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1737#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:42,048 INFO L272 TraceCheckUtils]: 10: Hoare triple {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1733#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:42,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1757#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [68] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:42,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [71] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= |v_main_#t~post1_65| |v_main_#t~post1_61|)) (.cse1 (= v_main_~i~0_97 v_main_~i~0_96))) (or (and (= v_main_~sn~0_60 v_main_~sn~0_59) .cse0 .cse1) (and (< v_main_~i~0_97 v_main_~i~0_96) (= (+ (* v_main_~i~0_97 2) v_main_~sn~0_59) (+ (* v_main_~i~0_96 2) v_main_~sn~0_60)) (< v_main_~i~0_96 5)) (and (= v_main_~sn~0_59 v_main_~sn~0_60) (<= 4 v_main_~i~0_97) .cse0 .cse1))) InVars {main_~i~0=v_main_~i~0_97, main_~sn~0=v_main_~sn~0_60, main_#t~post1=|v_main_#t~post1_65|} OutVars{main_~i~0=v_main_~i~0_96, main_~sn~0=v_main_~sn~0_59, main_#t~post1=|v_main_#t~post1_61|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1757#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:42,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [70] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:42,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [69] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_95)) (.cse1 (= v_main_~i~0_95 v_main_~i~0_94)) (.cse2 (= |v_main_#t~post1_62| |v_main_#t~post1_60|))) (or (and (< v_main_~i~0_95 v_main_~i~0_94) .cse0 (<= v_main_~i~0_94 9)) (and .cse1 (or (not (<= v_main_~i~0_95 8)) (not .cse0)) .cse2) (and .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_95, main_#t~post1=|v_main_#t~post1_62|} OutVars{main_~i~0=v_main_~i~0_94, main_#t~post1=|v_main_#t~post1_60|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:42,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {1689#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1753#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:42,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {1689#true} call #t~ret2 := main(); {1689#true} is VALID [2022-04-15 05:43:42,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1689#true} {1689#true} #47#return; {1689#true} is VALID [2022-04-15 05:43:42,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {1689#true} assume true; {1689#true} is VALID [2022-04-15 05:43:42,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {1689#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(10, 2); {1689#true} is VALID [2022-04-15 05:43:42,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {1689#true} call ULTIMATE.init(); {1689#true} is VALID [2022-04-15 05:43:42,050 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:43:42,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117516698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:42,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:42,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-04-15 05:43:42,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:42,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2030549167] [2022-04-15 05:43:42,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2030549167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:42,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:42,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:43:42,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361945583] [2022-04-15 05:43:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-15 05:43:42,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:42,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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:43:42,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:42,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:43:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:43:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-04-15 05:43:42,225 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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:43:42,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:42,508 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-15 05:43:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:43:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-15 05:43:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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:43:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-15 05:43:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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:43:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-04-15 05:43:42,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2022-04-15 05:43:42,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:42,561 INFO L225 Difference]: With dead ends: 49 [2022-04-15 05:43:42,561 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 05:43:42,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-04-15 05:43:42,562 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:42,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:43:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 05:43:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-15 05:43:42,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:42,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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:43:42,582 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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:43:42,582 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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:43:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:42,583 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 05:43:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 05:43:42,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:42,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:42,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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 32 states. [2022-04-15 05:43:42,583 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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 32 states. [2022-04-15 05:43:42,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:42,584 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 05:43:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 05:43:42,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:42,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:42,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:42,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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:43:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 05:43:42,585 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2022-04-15 05:43:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:42,585 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 05:43:42,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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:43:42,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 05:43:42,620 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:43:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 05:43:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:43:42,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:42,621 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:42,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 05:43:42,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:42,836 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:42,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash -660550482, now seen corresponding path program 6 times [2022-04-15 05:43:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:42,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958983383] [2022-04-15 05:43:43,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:47,111 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:43:47,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:47,165 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2070632723, now seen corresponding path program 1 times [2022-04-15 05:43:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:47,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077367546] [2022-04-15 05:43:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:47,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:47,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {2036#(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(10, 2); {2028#true} is VALID [2022-04-15 05:43:47,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 05:43:47,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2028#true} {2028#true} #47#return; {2028#true} is VALID [2022-04-15 05:43:47,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2036#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:47,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {2036#(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(10, 2); {2028#true} is VALID [2022-04-15 05:43:47,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 05:43:47,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #47#return; {2028#true} is VALID [2022-04-15 05:43:47,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret2 := main(); {2028#true} is VALID [2022-04-15 05:43:47,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2033#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 05:43:47,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {2033#(= (+ (- 1) main_~i~0) 0)} [73] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_116 v_main_~i~0_115)) (.cse0 (<= 4 v_main_~i~0_116)) (.cse2 (= |v_main_#t~post1_75| |v_main_#t~post1_73|))) (or (and (<= v_main_~i~0_115 9) (< v_main_~i~0_116 v_main_~i~0_115) .cse0) (and .cse1 .cse2) (and .cse1 (or (not .cse0) (not (<= v_main_~i~0_116 8))) .cse2))) InVars {main_~i~0=v_main_~i~0_116, main_#t~post1=|v_main_#t~post1_75|} OutVars{main_~i~0=v_main_~i~0_115, main_#t~post1=|v_main_#t~post1_73|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2034#(<= main_~i~0 1)} is VALID [2022-04-15 05:43:47,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {2034#(<= main_~i~0 1)} [74] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2034#(<= main_~i~0 1)} is VALID [2022-04-15 05:43:47,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {2034#(<= main_~i~0 1)} [75] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_118 v_main_~i~0_117)) (.cse1 (= |v_main_#t~post1_78| |v_main_#t~post1_74|)) (.cse2 (= v_main_~sn~0_72 v_main_~sn~0_71))) (or (and .cse0 .cse1 .cse2) (and (< v_main_~i~0_118 v_main_~i~0_117) (= (+ (* 2 v_main_~i~0_117) v_main_~sn~0_72) (+ (* 2 v_main_~i~0_118) v_main_~sn~0_71)) (< v_main_~i~0_117 5)) (and (<= 4 v_main_~i~0_118) .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_118, main_~sn~0=v_main_~sn~0_72, main_#t~post1=|v_main_#t~post1_78|} OutVars{main_~i~0=v_main_~i~0_117, main_~sn~0=v_main_~sn~0_71, main_#t~post1=|v_main_#t~post1_74|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2035#(<= main_~i~0 4)} is VALID [2022-04-15 05:43:47,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2035#(<= main_~i~0 4)} [72] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2029#false} is VALID [2022-04-15 05:43:47,228 INFO L272 TraceCheckUtils]: 10: Hoare triple {2029#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2029#false} is VALID [2022-04-15 05:43:47,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {2029#false} ~cond := #in~cond; {2029#false} is VALID [2022-04-15 05:43:47,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {2029#false} assume 0 == ~cond; {2029#false} is VALID [2022-04-15 05:43:47,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-15 05:43:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:43:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:47,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077367546] [2022-04-15 05:43:47,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077367546] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:47,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337029832] [2022-04-15 05:43:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:47,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:47,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:47,240 INFO L229 MonitoredProcess]: Starting monitored process 7 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:43:47,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 05:43:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:47,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:47,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:47,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-15 05:43:47,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#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(10, 2); {2028#true} is VALID [2022-04-15 05:43:47,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 05:43:47,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #47#return; {2028#true} is VALID [2022-04-15 05:43:47,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret2 := main(); {2028#true} is VALID [2022-04-15 05:43:47,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2055#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:47,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {2055#(= main_~sn~0 0)} [73] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_116 v_main_~i~0_115)) (.cse0 (<= 4 v_main_~i~0_116)) (.cse2 (= |v_main_#t~post1_75| |v_main_#t~post1_73|))) (or (and (<= v_main_~i~0_115 9) (< v_main_~i~0_116 v_main_~i~0_115) .cse0) (and .cse1 .cse2) (and .cse1 (or (not .cse0) (not (<= v_main_~i~0_116 8))) .cse2))) InVars {main_~i~0=v_main_~i~0_116, main_#t~post1=|v_main_#t~post1_75|} OutVars{main_~i~0=v_main_~i~0_115, main_#t~post1=|v_main_#t~post1_73|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2055#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:47,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {2055#(= main_~sn~0 0)} [74] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2055#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:47,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {2055#(= main_~sn~0 0)} [75] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_118 v_main_~i~0_117)) (.cse1 (= |v_main_#t~post1_78| |v_main_#t~post1_74|)) (.cse2 (= v_main_~sn~0_72 v_main_~sn~0_71))) (or (and .cse0 .cse1 .cse2) (and (< v_main_~i~0_118 v_main_~i~0_117) (= (+ (* 2 v_main_~i~0_117) v_main_~sn~0_72) (+ (* 2 v_main_~i~0_118) v_main_~sn~0_71)) (< v_main_~i~0_117 5)) (and (<= 4 v_main_~i~0_118) .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_118, main_~sn~0=v_main_~sn~0_72, main_#t~post1=|v_main_#t~post1_78|} OutVars{main_~i~0=v_main_~i~0_117, main_~sn~0=v_main_~sn~0_71, main_#t~post1=|v_main_#t~post1_74|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2065#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:47,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} [72] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2055#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:47,366 INFO L272 TraceCheckUtils]: 10: Hoare triple {2055#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2072#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:47,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {2072#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2076#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:47,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2029#false} is VALID [2022-04-15 05:43:47,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-15 05:43:47,367 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:43:47,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:47,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-15 05:43:47,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2029#false} is VALID [2022-04-15 05:43:47,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {2072#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2076#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:47,545 INFO L272 TraceCheckUtils]: 10: Hoare triple {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2072#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:47,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [72] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:47,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [75] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_118 v_main_~i~0_117)) (.cse1 (= |v_main_#t~post1_78| |v_main_#t~post1_74|)) (.cse2 (= v_main_~sn~0_72 v_main_~sn~0_71))) (or (and .cse0 .cse1 .cse2) (and (< v_main_~i~0_118 v_main_~i~0_117) (= (+ (* 2 v_main_~i~0_117) v_main_~sn~0_72) (+ (* 2 v_main_~i~0_118) v_main_~sn~0_71)) (< v_main_~i~0_117 5)) (and (<= 4 v_main_~i~0_118) .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_118, main_~sn~0=v_main_~sn~0_72, main_#t~post1=|v_main_#t~post1_78|} OutVars{main_~i~0=v_main_~i~0_117, main_~sn~0=v_main_~sn~0_71, main_#t~post1=|v_main_#t~post1_74|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2096#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:47,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [74] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:47,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [73] L24-3-->L24-4_primed: Formula: (let ((.cse1 (= v_main_~i~0_116 v_main_~i~0_115)) (.cse0 (<= 4 v_main_~i~0_116)) (.cse2 (= |v_main_#t~post1_75| |v_main_#t~post1_73|))) (or (and (<= v_main_~i~0_115 9) (< v_main_~i~0_116 v_main_~i~0_115) .cse0) (and .cse1 .cse2) (and .cse1 (or (not .cse0) (not (<= v_main_~i~0_116 8))) .cse2))) InVars {main_~i~0=v_main_~i~0_116, main_#t~post1=|v_main_#t~post1_75|} OutVars{main_~i~0=v_main_~i~0_115, main_#t~post1=|v_main_#t~post1_73|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:47,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2092#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:47,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret2 := main(); {2028#true} is VALID [2022-04-15 05:43:47,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #47#return; {2028#true} is VALID [2022-04-15 05:43:47,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 05:43:47,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#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(10, 2); {2028#true} is VALID [2022-04-15 05:43:47,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-15 05:43:47,548 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:43:47,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337029832] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:47,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:47,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-04-15 05:43:47,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:47,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958983383] [2022-04-15 05:43:47,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958983383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:47,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:47,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:43:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599520078] [2022-04-15 05:43:47,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-15 05:43:47,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:47,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:43:47,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:47,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:43:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:47,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:43:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:43:47,754 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:43:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:48,082 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 05:43:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:43:48,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-15 05:43:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:43:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 05:43:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:43:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 05:43:48,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-15 05:43:48,115 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:43:48,120 INFO L225 Difference]: With dead ends: 43 [2022-04-15 05:43:48,120 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 05:43:48,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-04-15 05:43:48,122 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:48,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:43:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 05:43:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 05:43:48,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:48,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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:43:48,168 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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:43:48,170 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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:43:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:48,170 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-15 05:43:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 05:43:48,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:48,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:48,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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 35 states. [2022-04-15 05:43:48,176 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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 35 states. [2022-04-15 05:43:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:48,177 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-15 05:43:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 05:43:48,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:48,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:48,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:48,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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:43:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-15 05:43:48,178 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2022-04-15 05:43:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:48,178 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-15 05:43:48,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:43:48,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-15 05:43:48,202 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:43:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 05:43:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:43:48,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:48,203 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:48,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 05:43:48,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:48,417 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:48,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 110192489, now seen corresponding path program 7 times [2022-04-15 05:43:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:48,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63178960] [2022-04-15 05:43:48,610 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:52,677 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 05:43:52,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:52,746 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -21100563, now seen corresponding path program 1 times [2022-04-15 05:43:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:52,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793273075] [2022-04-15 05:43:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:52,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {2377#(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(10, 2); {2370#true} is VALID [2022-04-15 05:43:52,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 05:43:52,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #47#return; {2370#true} is VALID [2022-04-15 05:43:52,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:52,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {2377#(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(10, 2); {2370#true} is VALID [2022-04-15 05:43:52,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 05:43:52,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #47#return; {2370#true} is VALID [2022-04-15 05:43:52,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret2 := main(); {2370#true} is VALID [2022-04-15 05:43:52,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2375#(= main_~i~0 1)} is VALID [2022-04-15 05:43:52,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#(= main_~i~0 1)} [77] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_138)) (.cse1 (= |v_main_#t~post1_88| |v_main_#t~post1_86|)) (.cse2 (= v_main_~i~0_138 v_main_~i~0_137))) (or (and (or (not .cse0) (not (<= v_main_~i~0_138 8))) .cse1 .cse2) (and .cse0 (< v_main_~i~0_138 v_main_~i~0_137) (<= v_main_~i~0_137 9)) (and .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_138, main_#t~post1=|v_main_#t~post1_88|} OutVars{main_~i~0=v_main_~i~0_137, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2375#(= main_~i~0 1)} is VALID [2022-04-15 05:43:52,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {2375#(= main_~i~0 1)} [78] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2375#(= main_~i~0 1)} is VALID [2022-04-15 05:43:52,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {2375#(= main_~i~0 1)} [79] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_140 v_main_~i~0_139)) (.cse1 (= |v_main_#t~post1_91| |v_main_#t~post1_87|)) (.cse2 (= v_main_~sn~0_84 v_main_~sn~0_83))) (or (and (< v_main_~i~0_139 5) (< v_main_~i~0_140 v_main_~i~0_139) (= (+ (* 2 v_main_~i~0_139) v_main_~sn~0_84) (+ (* 2 v_main_~i~0_140) v_main_~sn~0_83))) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= 4 v_main_~i~0_140) .cse2))) InVars {main_~i~0=v_main_~i~0_140, main_~sn~0=v_main_~sn~0_84, main_#t~post1=|v_main_#t~post1_91|} OutVars{main_~i~0=v_main_~i~0_139, main_~sn~0=v_main_~sn~0_83, main_#t~post1=|v_main_#t~post1_87|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2376#(<= main_~i~0 4)} is VALID [2022-04-15 05:43:52,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {2376#(<= main_~i~0 4)} [76] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2371#false} is VALID [2022-04-15 05:43:52,791 INFO L272 TraceCheckUtils]: 10: Hoare triple {2371#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2371#false} is VALID [2022-04-15 05:43:52,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2022-04-15 05:43:52,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2022-04-15 05:43:52,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-15 05:43:52,792 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:43:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793273075] [2022-04-15 05:43:52,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793273075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881976768] [2022-04-15 05:43:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:52,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:52,793 INFO L229 MonitoredProcess]: Starting monitored process 8 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:43:52,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 05:43:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:52,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:52,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:52,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2022-04-15 05:43:52,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#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(10, 2); {2370#true} is VALID [2022-04-15 05:43:52,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 05:43:52,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #47#return; {2370#true} is VALID [2022-04-15 05:43:52,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret2 := main(); {2370#true} is VALID [2022-04-15 05:43:52,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2396#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:52,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {2396#(= main_~sn~0 0)} [77] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_138)) (.cse1 (= |v_main_#t~post1_88| |v_main_#t~post1_86|)) (.cse2 (= v_main_~i~0_138 v_main_~i~0_137))) (or (and (or (not .cse0) (not (<= v_main_~i~0_138 8))) .cse1 .cse2) (and .cse0 (< v_main_~i~0_138 v_main_~i~0_137) (<= v_main_~i~0_137 9)) (and .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_138, main_#t~post1=|v_main_#t~post1_88|} OutVars{main_~i~0=v_main_~i~0_137, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2396#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:52,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {2396#(= main_~sn~0 0)} [78] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:52,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {2396#(= main_~sn~0 0)} [79] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_140 v_main_~i~0_139)) (.cse1 (= |v_main_#t~post1_91| |v_main_#t~post1_87|)) (.cse2 (= v_main_~sn~0_84 v_main_~sn~0_83))) (or (and (< v_main_~i~0_139 5) (< v_main_~i~0_140 v_main_~i~0_139) (= (+ (* 2 v_main_~i~0_139) v_main_~sn~0_84) (+ (* 2 v_main_~i~0_140) v_main_~sn~0_83))) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= 4 v_main_~i~0_140) .cse2))) InVars {main_~i~0=v_main_~i~0_140, main_~sn~0=v_main_~sn~0_84, main_#t~post1=|v_main_#t~post1_91|} OutVars{main_~i~0=v_main_~i~0_139, main_~sn~0=v_main_~sn~0_83, main_#t~post1=|v_main_#t~post1_87|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2406#(or (= main_~sn~0 0) (and (< (div main_~sn~0 (- 2)) 0) (= (mod main_~sn~0 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:52,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {2406#(or (= main_~sn~0 0) (and (< (div main_~sn~0 (- 2)) 0) (= (mod main_~sn~0 2) 0) (< main_~i~0 5)))} [76] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2396#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:52,924 INFO L272 TraceCheckUtils]: 10: Hoare triple {2396#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:52,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {2413#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:52,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {2417#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2371#false} is VALID [2022-04-15 05:43:52,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-15 05:43:52,925 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:43:52,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:53,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2022-04-15 05:43:53,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {2417#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2371#false} is VALID [2022-04-15 05:43:53,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2413#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:53,061 INFO L272 TraceCheckUtils]: 10: Hoare triple {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:53,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2437#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [76] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:53,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [79] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_140 v_main_~i~0_139)) (.cse1 (= |v_main_#t~post1_91| |v_main_#t~post1_87|)) (.cse2 (= v_main_~sn~0_84 v_main_~sn~0_83))) (or (and (< v_main_~i~0_139 5) (< v_main_~i~0_140 v_main_~i~0_139) (= (+ (* 2 v_main_~i~0_139) v_main_~sn~0_84) (+ (* 2 v_main_~i~0_140) v_main_~sn~0_83))) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= 4 v_main_~i~0_140) .cse2))) InVars {main_~i~0=v_main_~i~0_140, main_~sn~0=v_main_~sn~0_84, main_#t~post1=|v_main_#t~post1_91|} OutVars{main_~i~0=v_main_~i~0_139, main_~sn~0=v_main_~sn~0_83, main_#t~post1=|v_main_#t~post1_87|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2437#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:53,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [78] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:53,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [77] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_138)) (.cse1 (= |v_main_#t~post1_88| |v_main_#t~post1_86|)) (.cse2 (= v_main_~i~0_138 v_main_~i~0_137))) (or (and (or (not .cse0) (not (<= v_main_~i~0_138 8))) .cse1 .cse2) (and .cse0 (< v_main_~i~0_138 v_main_~i~0_137) (<= v_main_~i~0_137 9)) (and .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_138, main_#t~post1=|v_main_#t~post1_88|} OutVars{main_~i~0=v_main_~i~0_137, main_#t~post1=|v_main_#t~post1_86|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:53,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {2370#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2433#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:53,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {2370#true} call #t~ret2 := main(); {2370#true} is VALID [2022-04-15 05:43:53,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2370#true} {2370#true} #47#return; {2370#true} is VALID [2022-04-15 05:43:53,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {2370#true} assume true; {2370#true} is VALID [2022-04-15 05:43:53,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#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(10, 2); {2370#true} is VALID [2022-04-15 05:43:53,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2022-04-15 05:43:53,063 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:43:53,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881976768] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:53,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:53,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-15 05:43:53,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:53,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63178960] [2022-04-15 05:43:53,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63178960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:53,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:53,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:43:53,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312350292] [2022-04-15 05:43:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 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 32 [2022-04-15 05:43:53,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:53,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 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:43:53,267 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:43:53,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:43:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:43:53,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:43:53,268 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 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:43:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:53,799 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 05:43:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:43:53,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 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 32 [2022-04-15 05:43:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:43:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 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:43:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 05:43:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 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:43:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 05:43:53,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-15 05:43:53,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:53,845 INFO L225 Difference]: With dead ends: 46 [2022-04-15 05:43:53,845 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 05:43:53,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:43:53,846 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:43:53,846 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 53 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:43:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 05:43:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 05:43:53,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:43:53,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:43:53,885 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:43:53,886 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:43:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:53,887 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-15 05:43:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-15 05:43:53,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:53,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:53,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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 38 states. [2022-04-15 05:43:53,891 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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 38 states. [2022-04-15 05:43:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:43:53,891 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-15 05:43:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-15 05:43:53,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:43:53,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:43:53,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:43:53,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:43:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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:43:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 05:43:53,892 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2022-04-15 05:43:53,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:43:53,892 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 05:43:53,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 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:43:53,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 05:43:53,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:43:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 05:43:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 05:43:53,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:43:53,919 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:43:53,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 05:43:54,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:54,140 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:43:54,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:43:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 418877134, now seen corresponding path program 8 times [2022-04-15 05:43:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:43:54,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554903619] [2022-04-15 05:43:54,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:54,434 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 05:43:54,435 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 05:43:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2028431597, now seen corresponding path program 1 times [2022-04-15 05:43:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:43:54,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626858867] [2022-04-15 05:43:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:43:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:54,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:43:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:54,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {2741#(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(10, 2); {2732#true} is VALID [2022-04-15 05:43:54,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {2732#true} assume true; {2732#true} is VALID [2022-04-15 05:43:54,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2732#true} {2732#true} #47#return; {2732#true} is VALID [2022-04-15 05:43:54,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {2732#true} call ULTIMATE.init(); {2741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:43:54,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {2741#(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(10, 2); {2732#true} is VALID [2022-04-15 05:43:54,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {2732#true} assume true; {2732#true} is VALID [2022-04-15 05:43:54,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2732#true} {2732#true} #47#return; {2732#true} is VALID [2022-04-15 05:43:54,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {2732#true} call #t~ret2 := main(); {2732#true} is VALID [2022-04-15 05:43:54,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {2732#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {2737#(= main_~sn~0 0)} [81] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_161)) (.cse1 (= v_main_~i~0_161 v_main_~i~0_160))) (or (and (or (not .cse0) (not (<= v_main_~i~0_161 8))) (= |v_main_#t~post1_99| |v_main_#t~post1_101|) .cse1) (and .cse0 (<= v_main_~i~0_160 9) (< v_main_~i~0_161 v_main_~i~0_160)) (and (= |v_main_#t~post1_101| |v_main_#t~post1_99|) .cse1))) InVars {main_~i~0=v_main_~i~0_161, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~i~0=v_main_~i~0_160, main_#t~post1=|v_main_#t~post1_99|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {2737#(= main_~sn~0 0)} [82] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {2737#(= main_~sn~0 0)} [83] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_163 v_main_~i~0_162)) (.cse1 (= v_main_~sn~0_96 v_main_~sn~0_95)) (.cse2 (= |v_main_#t~post1_104| |v_main_#t~post1_100|))) (or (and (not (< v_main_~i~0_163 4)) .cse0 .cse1 .cse2) (and (= (+ (* 2 v_main_~i~0_162) v_main_~sn~0_96) (+ (* 2 v_main_~i~0_163) v_main_~sn~0_95)) (< v_main_~i~0_163 v_main_~i~0_162) (< v_main_~i~0_162 5)) (and .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_163, main_~sn~0=v_main_~sn~0_96, main_#t~post1=|v_main_#t~post1_104|} OutVars{main_~i~0=v_main_~i~0_162, main_~sn~0=v_main_~sn~0_95, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2738#(or (= main_~sn~0 0) (<= main_~i~0 4))} is VALID [2022-04-15 05:43:54,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {2738#(or (= main_~sn~0 0) (<= main_~i~0 4))} [80] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,486 INFO L272 TraceCheckUtils]: 10: Hoare triple {2737#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:43:54,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {2739#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2740#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:43:54,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {2740#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2733#false} is VALID [2022-04-15 05:43:54,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {2733#false} assume !false; {2733#false} is VALID [2022-04-15 05:43:54,487 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:43:54,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:43:54,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626858867] [2022-04-15 05:43:54,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626858867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:43:54,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939545698] [2022-04-15 05:43:54,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:43:54,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:43:54,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:43:54,492 INFO L229 MonitoredProcess]: Starting monitored process 9 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:43:54,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 05:43:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:54,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:43:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:43:54,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:43:54,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {2732#true} call ULTIMATE.init(); {2732#true} is VALID [2022-04-15 05:43:54,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {2732#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(10, 2); {2732#true} is VALID [2022-04-15 05:43:54,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {2732#true} assume true; {2732#true} is VALID [2022-04-15 05:43:54,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2732#true} {2732#true} #47#return; {2732#true} is VALID [2022-04-15 05:43:54,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {2732#true} call #t~ret2 := main(); {2732#true} is VALID [2022-04-15 05:43:54,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {2732#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {2737#(= main_~sn~0 0)} [81] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_161)) (.cse1 (= v_main_~i~0_161 v_main_~i~0_160))) (or (and (or (not .cse0) (not (<= v_main_~i~0_161 8))) (= |v_main_#t~post1_99| |v_main_#t~post1_101|) .cse1) (and .cse0 (<= v_main_~i~0_160 9) (< v_main_~i~0_161 v_main_~i~0_160)) (and (= |v_main_#t~post1_101| |v_main_#t~post1_99|) .cse1))) InVars {main_~i~0=v_main_~i~0_161, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~i~0=v_main_~i~0_160, main_#t~post1=|v_main_#t~post1_99|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {2737#(= main_~sn~0 0)} [82] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {2737#(= main_~sn~0 0)} [83] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_163 v_main_~i~0_162)) (.cse1 (= v_main_~sn~0_96 v_main_~sn~0_95)) (.cse2 (= |v_main_#t~post1_104| |v_main_#t~post1_100|))) (or (and (not (< v_main_~i~0_163 4)) .cse0 .cse1 .cse2) (and (= (+ (* 2 v_main_~i~0_162) v_main_~sn~0_96) (+ (* 2 v_main_~i~0_163) v_main_~sn~0_95)) (< v_main_~i~0_163 v_main_~i~0_162) (< v_main_~i~0_162 5)) (and .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_163, main_~sn~0=v_main_~sn~0_96, main_#t~post1=|v_main_#t~post1_104|} OutVars{main_~i~0=v_main_~i~0_162, main_~sn~0=v_main_~sn~0_95, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2769#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} is VALID [2022-04-15 05:43:54,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {2769#(or (= main_~sn~0 0) (and (= (mod main_~sn~0 2) 0) (< (div (* (- 1) main_~sn~0) 2) 0) (< main_~i~0 5)))} [80] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2737#(= main_~sn~0 0)} is VALID [2022-04-15 05:43:54,635 INFO L272 TraceCheckUtils]: 10: Hoare triple {2737#(= main_~sn~0 0)} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:54,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {2776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:54,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {2780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2733#false} is VALID [2022-04-15 05:43:54,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {2733#false} assume !false; {2733#false} is VALID [2022-04-15 05:43:54,635 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:43:54,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:43:54,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {2733#false} assume !false; {2733#false} is VALID [2022-04-15 05:43:54,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {2780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2733#false} is VALID [2022-04-15 05:43:54,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {2776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:43:54,775 INFO L272 TraceCheckUtils]: 10: Hoare triple {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:43:54,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} [80] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:54,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [83] L24-3-->L24-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_163 v_main_~i~0_162)) (.cse1 (= v_main_~sn~0_96 v_main_~sn~0_95)) (.cse2 (= |v_main_#t~post1_104| |v_main_#t~post1_100|))) (or (and (not (< v_main_~i~0_163 4)) .cse0 .cse1 .cse2) (and (= (+ (* 2 v_main_~i~0_162) v_main_~sn~0_96) (+ (* 2 v_main_~i~0_163) v_main_~sn~0_95)) (< v_main_~i~0_163 v_main_~i~0_162) (< v_main_~i~0_162 5)) (and .cse0 .cse1 .cse2))) InVars {main_~i~0=v_main_~i~0_163, main_~sn~0=v_main_~sn~0_96, main_#t~post1=|v_main_#t~post1_104|} OutVars{main_~i~0=v_main_~i~0_162, main_~sn~0=v_main_~sn~0_95, main_#t~post1=|v_main_#t~post1_100|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {2800#(or (= main_~sn~0 0) (<= main_~i~0 8) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:54,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [82] L24-4_primed-->L24-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:54,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} [81] L24-3-->L24-4_primed: Formula: (let ((.cse0 (<= 4 v_main_~i~0_161)) (.cse1 (= v_main_~i~0_161 v_main_~i~0_160))) (or (and (or (not .cse0) (not (<= v_main_~i~0_161 8))) (= |v_main_#t~post1_99| |v_main_#t~post1_101|) .cse1) (and .cse0 (<= v_main_~i~0_160 9) (< v_main_~i~0_161 v_main_~i~0_160)) (and (= |v_main_#t~post1_101| |v_main_#t~post1_99|) .cse1))) InVars {main_~i~0=v_main_~i~0_161, main_#t~post1=|v_main_#t~post1_101|} OutVars{main_~i~0=v_main_~i~0_160, main_#t~post1=|v_main_#t~post1_99|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:54,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {2732#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {2796#(or (= main_~sn~0 0) (= 16 main_~sn~0))} is VALID [2022-04-15 05:43:54,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {2732#true} call #t~ret2 := main(); {2732#true} is VALID [2022-04-15 05:43:54,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2732#true} {2732#true} #47#return; {2732#true} is VALID [2022-04-15 05:43:54,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {2732#true} assume true; {2732#true} is VALID [2022-04-15 05:43:54,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {2732#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(10, 2); {2732#true} is VALID [2022-04-15 05:43:54,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {2732#true} call ULTIMATE.init(); {2732#true} is VALID [2022-04-15 05:43:54,778 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:43:54,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939545698] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:43:54,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:43:54,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:43:55,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:43:55,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554903619] [2022-04-15 05:43:55,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554903619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:43:55,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:43:55,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:43:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804547648] [2022-04-15 05:43:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:43:55,125 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 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 35 [2022-04-15 05:43:55,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:43:55,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 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:43:55,131 WARN L143 InductivityCheck]: Transition 2840#(and (not (< main_~i~0 9)) (= (+ (- 2) main_~sn~0) 4) (< main_~i~0 10)) ( _ , assume !(~i~0 <= 8); , 2737#(= main_~sn~0 0) ) not inductive [2022-04-15 05:43:55,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 05:43:55,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 05:43:55,348 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 05:43:55,354 INFO L158 Benchmark]: Toolchain (without parser) took 33443.10ms. Allocated memory was 199.2MB in the beginning and 280.0MB in the end (delta: 80.7MB). Free memory was 144.9MB in the beginning and 241.1MB in the end (delta: -96.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:43:55,354 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:43:55,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.38ms. Allocated memory is still 199.2MB. Free memory was 144.7MB in the beginning and 169.6MB in the end (delta: -24.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-04-15 05:43:55,355 INFO L158 Benchmark]: Boogie Preprocessor took 24.07ms. Allocated memory is still 199.2MB. Free memory was 169.6MB in the beginning and 168.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:43:55,355 INFO L158 Benchmark]: RCFGBuilder took 234.95ms. Allocated memory is still 199.2MB. Free memory was 168.0MB in the beginning and 157.9MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 05:43:55,357 INFO L158 Benchmark]: TraceAbstraction took 32918.45ms. Allocated memory was 199.2MB in the beginning and 280.0MB in the end (delta: 80.7MB). Free memory was 157.5MB in the beginning and 241.1MB in the end (delta: -83.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:43:55,358 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 199.2MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.38ms. Allocated memory is still 199.2MB. Free memory was 144.7MB in the beginning and 169.6MB in the end (delta: -24.9MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.07ms. Allocated memory is still 199.2MB. Free memory was 169.6MB in the beginning and 168.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 234.95ms. Allocated memory is still 199.2MB. Free memory was 168.0MB in the beginning and 157.9MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 32918.45ms. Allocated memory was 199.2MB in the beginning and 280.0MB in the end (delta: 80.7MB). Free memory was 157.5MB in the beginning and 241.1MB in the end (delta: -83.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 05:43:55,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...