/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:03:10,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:03:10,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:03:10,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:03:10,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:03:10,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:03:10,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:03:10,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:03:10,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:03:10,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:03:10,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:03:10,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:03:10,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:03:10,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:03:10,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:03:10,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:03:10,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:03:10,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:03:10,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:03:10,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:03:10,514 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:03:10,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:03:10,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:03:10,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:03:10,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:03:10,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:03:10,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:03:10,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:03:10,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:03:10,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:03:10,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:03:10,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:03:10,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:03:10,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:03:10,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:03:10,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:03:10,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:03:10,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:03:10,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:03:10,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:03:10,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:03:10,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:03:10,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:03:10,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:03:10,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:03:10,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:03:10,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:03:10,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:03:10,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:03:10,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:03:10,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:03:10,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:03:10,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:03:10,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:03:10,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:03:10,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:03:10,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:03:10,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:03:10,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:10,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:03:10,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:03:10,550 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:03:10,551 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:03:10,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:03:10,551 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:03:10,551 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:03:10,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:03:10,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:03:10,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:03:10,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:03:10,809 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:03:10,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2022-04-15 12:03:10,854 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8809fc23a/09e51afdeacc429fa1909f4b1017da60/FLAG01ba44de4 [2022-04-15 12:03:11,301 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:03:11,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2022-04-15 12:03:11,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8809fc23a/09e51afdeacc429fa1909f4b1017da60/FLAG01ba44de4 [2022-04-15 12:03:11,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8809fc23a/09e51afdeacc429fa1909f4b1017da60 [2022-04-15 12:03:11,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:03:11,737 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:03:11,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:11,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:03:11,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:03:11,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14714f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11, skipping insertion in model container [2022-04-15 12:03:11,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:03:11,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:03:11,913 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/sum01-1.i[808,821] [2022-04-15 12:03:11,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:11,929 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:03:11,939 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/sum01-1.i[808,821] [2022-04-15 12:03:11,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:11,955 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:03:11,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11 WrapperNode [2022-04-15 12:03:11,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:11,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:03:11,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:03:11,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:03:11,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:03:11,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:03:11,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:03:11,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:03:11,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (1/1) ... [2022-04-15 12:03:11,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:12,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:12,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:03:12,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:03:12,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:03:12,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:03:12,068 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:03:12,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:03:12,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:03:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:03:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:03:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:03:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:03:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:03:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:03:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:03:12,152 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:03:12,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:03:12,372 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:03:12,377 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:03:12,378 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:03:12,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:12 BoogieIcfgContainer [2022-04-15 12:03:12,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:03:12,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:03:12,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:03:12,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:03:12,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:03:11" (1/3) ... [2022-04-15 12:03:12,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69129b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:12, skipping insertion in model container [2022-04-15 12:03:12,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:11" (2/3) ... [2022-04-15 12:03:12,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69129b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:12, skipping insertion in model container [2022-04-15 12:03:12,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:12" (3/3) ... [2022-04-15 12:03:12,405 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2022-04-15 12:03:12,409 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:03:12,409 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:03:12,531 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:03:12,560 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:03:12,561 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:03:12,590 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 12:03:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:03:12,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:12,617 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:12,618 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2022-04-15 12:03:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:12,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [266179274] [2022-04-15 12:03:12,670 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:03:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 2 times [2022-04-15 12:03:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:12,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129648403] [2022-04-15 12:03:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:13,053 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 12:03:13,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:03:13,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 12:03:13,060 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 12:03:13,060 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 12:03:13,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:03:13,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #47#return; {23#true} is VALID [2022-04-15 12:03:13,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2022-04-15 12:03:13,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2022-04-15 12:03:13,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 12:03:13,068 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2022-04-15 12:03:13,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-15 12:03:13,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-15 12:03:13,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 12:03:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:03:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129648403] [2022-04-15 12:03:13,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129648403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:13,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:13,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:03:13,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:13,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [266179274] [2022-04-15 12:03:13,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [266179274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:13,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:13,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:03:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563776317] [2022-04-15 12:03:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:13,094 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 12:03:13,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:13,098 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 12:03:13,131 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 12:03:13,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:03:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:03:13,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:03:13,188 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 12:03:13,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:13,316 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 12:03:13,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:03:13,317 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 12:03:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:13,319 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 12:03:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 12:03:13,347 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 12:03:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-15 12:03:13,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-15 12:03:13,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:13,437 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:03:13,437 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:03:13,440 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 12:03:13,445 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 12:03:13,446 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 12:03:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:03:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:03:13,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:13,496 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 12:03:13,497 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 12:03:13,497 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 12:03:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:13,517 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 12:03:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:03:13,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:13,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:13,518 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 12:03:13,518 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 12:03:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:13,522 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 12:03:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:03:13,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:13,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:13,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:13,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:13,523 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 12:03:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 12:03:13,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 12:03:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:13,525 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 12:03:13,526 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 12:03:13,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 12:03:13,559 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 12:03:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:03:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:03:13,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:13,563 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:13,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:03:13,567 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2022-04-15 12:03:13,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:13,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1482098775] [2022-04-15 12:03:13,571 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:03:13,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 2 times [2022-04-15 12:03:13,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:13,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095241523] [2022-04-15 12:03:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:13,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:13,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(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 12:03:13,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 12:03:13,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-15 12:03:13,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {149#true} call ULTIMATE.init(); {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:13,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(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 12:03:13,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume true; {149#true} is VALID [2022-04-15 12:03:13,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149#true} {149#true} #47#return; {149#true} is VALID [2022-04-15 12:03:13,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {149#true} call #t~ret3 := main(); {149#true} is VALID [2022-04-15 12:03:13,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {149#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 12:03:13,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} assume !(~i~0 <= ~n~0); {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-15 12:03:13,802 INFO L272 TraceCheckUtils]: 7: Hoare triple {154#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {155#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:13,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {156#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:13,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {156#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {150#false} is VALID [2022-04-15 12:03:13,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-04-15 12:03:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:03:13,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095241523] [2022-04-15 12:03:13,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095241523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:13,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:13,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:03:13,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1482098775] [2022-04-15 12:03:13,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1482098775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:13,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:13,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:03:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213175645] [2022-04-15 12:03:13,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:13,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 12:03:13,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:13,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 12:03:13,843 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 12:03:13,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:03:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:03:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:03:13,845 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 12:03:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:14,019 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:03:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:03:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 12:03:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 12:03:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 12:03:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 12:03:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 12:03:14,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-15 12:03:14,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:14,067 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:03:14,067 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:03:14,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:03:14,073 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:14,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:03:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:03:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:03:14,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:14,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:14,085 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:14,085 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:14,086 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:03:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:03:14,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:14,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:14,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 12:03:14,087 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 12:03:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:14,103 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:03:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:03:14,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:14,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:14,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:14,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:03:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:03:14,106 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 12:03:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:14,106 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:03:14,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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 12:03:14,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:03:14,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:03:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:03:14,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:14,125 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:14,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:03:14,126 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2022-04-15 12:03:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:14,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878375716] [2022-04-15 12:03:14,428 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash -994786162, now seen corresponding path program 1 times [2022-04-15 12:03:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997907714] [2022-04-15 12:03:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:14,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:14,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:14,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(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); {278#true} is VALID [2022-04-15 12:03:14,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-15 12:03:14,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-15 12:03:14,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {288#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:14,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {288#(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); {278#true} is VALID [2022-04-15 12:03:14,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2022-04-15 12:03:14,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #47#return; {278#true} is VALID [2022-04-15 12:03:14,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret3 := main(); {278#true} is VALID [2022-04-15 12:03:14,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} havoc ~i~0;~n~0 := (if #t~nondet1 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet1 % 4294967296 % 4294967296 else #t~nondet1 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet1;~sn~0 := 0;~i~0 := 1; {283#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:14,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [51] L24-3-->L24-4_primed: Formula: (or (and (= v_main_~sn~0_In_1 v_main_~sn~0_Out_2) (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~i~0_In_1 v_main_~i~0_Out_2)) (let ((.cse0 (* (- 1) v_main_~sn~0_In_1))) (and (<= 0 (div (+ .cse0 v_main_~sn~0_Out_2) 2)) (= (mod (+ v_main_~sn~0_In_1 v_main_~sn~0_Out_2) 2) 0) (= (* v_main_~n~0_In_1 2) 0) (= (+ .cse0 (* v_main_~i~0_In_1 2)) (+ (* v_main_~i~0_Out_2 2) (* (- 1) v_main_~sn~0_Out_2))) (= (* |v_main_#t~post2_Out_2| 2) 0) (<= v_main_~i~0_Out_2 (+ v_main_~n~0_In_1 1)) (< v_main_~i~0_Out_2 11)))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~sn~0=v_main_~sn~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_#t~post2=|v_main_#t~post2_Out_2|, main_~n~0=v_main_~n~0_In_1, main_~sn~0=v_main_~sn~0_Out_2} AuxVars[] AssignedVars[main_~sn~0, main_~i~0, main_#t~post2] {284#(and (<= main_~sn~0 0) (or (<= (* main_~i~0 2) (+ 2 (* main_~n~0 2) main_~sn~0)) (< 0 (+ main_~sn~0 1))))} is VALID [2022-04-15 12:03:14,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (<= main_~sn~0 0) (or (<= (* main_~i~0 2) (+ 2 (* main_~n~0 2) main_~sn~0)) (< 0 (+ main_~sn~0 1))))} [50] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {285#(and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))} is VALID [2022-04-15 12:03:14,562 INFO L272 TraceCheckUtils]: 8: Hoare triple {285#(and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {286#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:14,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {287#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:14,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {287#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {279#false} is VALID [2022-04-15 12:03:14,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {279#false} assume !false; {279#false} is VALID [2022-04-15 12:03:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:03:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:14,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997907714] [2022-04-15 12:03:14,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997907714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:14,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:14,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:03:14,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:14,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878375716] [2022-04-15 12:03:14,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878375716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:14,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:14,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:03:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043160275] [2022-04-15 12:03:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 12:03:14,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:14,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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 12:03:14,650 WARN L143 InductivityCheck]: Transition 291#(and (<= main_~i~0 (+ main_~n~0 1)) (= 2 main_~sn~0) (= (+ (- 1) main_~i~0) 1)) ( _ , assume !(~i~0 <= ~n~0); , 285#(and (< 0 (+ main_~sn~0 1)) (<= main_~sn~0 0)) ) not inductive [2022-04-15 12:03:14,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:03:14,650 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 12:03:14,654 INFO L158 Benchmark]: Toolchain (without parser) took 2916.32ms. Allocated memory was 181.4MB in the beginning and 237.0MB in the end (delta: 55.6MB). Free memory was 124.2MB in the beginning and 179.6MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:14,654 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 181.4MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:14,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.13ms. Allocated memory was 181.4MB in the beginning and 237.0MB in the end (delta: 55.6MB). Free memory was 124.1MB in the beginning and 208.0MB in the end (delta: -83.9MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-15 12:03:14,655 INFO L158 Benchmark]: Boogie Preprocessor took 28.40ms. Allocated memory is still 237.0MB. Free memory was 208.0MB in the beginning and 206.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:14,655 INFO L158 Benchmark]: RCFGBuilder took 394.29ms. Allocated memory is still 237.0MB. Free memory was 206.4MB in the beginning and 195.9MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 12:03:14,655 INFO L158 Benchmark]: TraceAbstraction took 2253.25ms. Allocated memory is still 237.0MB. Free memory was 195.4MB in the beginning and 179.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2022-04-15 12:03:14,657 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.19ms. Allocated memory is still 181.4MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.13ms. Allocated memory was 181.4MB in the beginning and 237.0MB in the end (delta: 55.6MB). Free memory was 124.1MB in the beginning and 208.0MB in the end (delta: -83.9MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.40ms. Allocated memory is still 237.0MB. Free memory was 208.0MB in the beginning and 206.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 394.29ms. Allocated memory is still 237.0MB. Free memory was 206.4MB in the beginning and 195.9MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2253.25ms. Allocated memory is still 237.0MB. Free memory was 195.4MB in the beginning and 179.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.9MB. 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 12:03:14,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...