/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/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:39:20,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:39:20,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:39:20,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:39:20,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:39:20,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:39:20,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:39:20,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:39:20,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:39:20,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:39:20,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:39:20,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:39:20,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:39:20,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:39:20,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:39:20,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:39:20,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:39:20,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:39:20,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:39:20,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:39:20,316 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:39:20,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:39:20,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:39:20,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:39:20,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:39:20,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:39:20,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:39:20,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:39:20,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:39:20,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:39:20,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:39:20,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:39:20,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:39:20,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:39:20,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:39:20,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:39:20,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:39:20,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:39:20,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:39:20,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:39:20,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:39:20,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:39:20,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:39:20,342 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:39:20,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:39:20,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:39:20,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:39:20,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:39:20,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:39:20,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:39:20,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:39:20,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:39:20,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:39:20,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:39:20,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:39:20,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:39:20,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:39:20,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:39:20,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:20,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:39:20,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:39:20,346 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:39:20,347 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:39:20,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:39:20,347 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:39:20,347 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-28 09:39:20,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:39:20,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:39:20,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:39:20,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:39:20,567 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:39:20,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-28 09:39:20,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d66d2942/5f2e0ea5f2514b508147b2a7035f6432/FLAG7b1af262f [2022-04-28 09:39:20,978 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:39:20,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2022-04-28 09:39:20,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d66d2942/5f2e0ea5f2514b508147b2a7035f6432/FLAG7b1af262f [2022-04-28 09:39:20,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d66d2942/5f2e0ea5f2514b508147b2a7035f6432 [2022-04-28 09:39:20,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:39:20,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:39:20,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:20,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:39:21,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:39:21,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:20" (1/1) ... [2022-04-28 09:39:21,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379f3a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21, skipping insertion in model container [2022-04-28 09:39:21,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:39:20" (1/1) ... [2022-04-28 09:39:21,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:39:21,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:39:21,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-28 09:39:21,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:21,247 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:39:21,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i[895,908] [2022-04-28 09:39:21,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:39:21,286 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:39:21,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21 WrapperNode [2022-04-28 09:39:21,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:39:21,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:39:21,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:39:21,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:39:21,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:39:21,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:39:21,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:39:21,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:39:21,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (1/1) ... [2022-04-28 09:39:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:39:21,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:21,369 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-28 09:39:21,383 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-28 09:39:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:39:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:39:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:39:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:39:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:39:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:39:21,405 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:39:21,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:39:21,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:39:21,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:39:21,405 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:39:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:39:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:39:21,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:39:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:39:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:39:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:39:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:39:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:39:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:39:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:39:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:39:21,483 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:39:21,485 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:39:21,646 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:39:21,651 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:39:21,651 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:39:21,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:21 BoogieIcfgContainer [2022-04-28 09:39:21,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:39:21,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:39:21,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:39:21,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:39:21,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:39:20" (1/3) ... [2022-04-28 09:39:21,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbc2a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:21, skipping insertion in model container [2022-04-28 09:39:21,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:39:21" (2/3) ... [2022-04-28 09:39:21,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbc2a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:39:21, skipping insertion in model container [2022-04-28 09:39:21,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:39:21" (3/3) ... [2022-04-28 09:39:21,679 INFO L111 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2022-04-28 09:39:21,690 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:39:21,690 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:39:21,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:39:21,738 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a8b6018, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2cee26f6 [2022-04-28 09:39:21,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:39:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-28 09:39:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:39:21,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:21,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:21,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -353995685, now seen corresponding path program 1 times [2022-04-28 09:39:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:21,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308324195] [2022-04-28 09:39:21,774 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:21,775 INFO L85 PathProgramCache]: Analyzing trace with hash -353995685, now seen corresponding path program 2 times [2022-04-28 09:39:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:21,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877457518] [2022-04-28 09:39:21,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:21,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-28 09:39:21,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:39:21,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 09:39:21,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:21,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(9, 2); {25#true} is VALID [2022-04-28 09:39:21,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:39:21,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 09:39:21,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-28 09:39:21,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-28 09:39:21,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {25#true} is VALID [2022-04-28 09:39:21,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 09:39:21,984 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {26#false} is VALID [2022-04-28 09:39:21,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 09:39:21,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 09:39:21,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 09:39:21,986 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-28 09:39:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:21,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877457518] [2022-04-28 09:39:21,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877457518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:21,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:21,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:39:21,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:21,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308324195] [2022-04-28 09:39:21,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308324195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:21,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:21,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:39:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444090434] [2022-04-28 09:39:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-28 09:39:21,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:22,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-28 09:39:22,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:22,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:39:22,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:22,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:39:22,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:39:22,051 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-28 09:39:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:22,140 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 09:39:22,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:39:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-28 09:39:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-28 09:39:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 09:39:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-28 09:39:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 09:39:22,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-28 09:39:22,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:22,225 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:39:22,225 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:39:22,227 INFO L412 NwaCegarLoop]: 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-28 09:39:22,230 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 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-28 09:39:22,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:39:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:39:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:39:22,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:22,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 09:39:22,256 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 09:39:22,256 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 09:39:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:22,258 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:39:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:39:22,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:22,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:22,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-28 09:39:22,259 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-28 09:39:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:22,261 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 09:39:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:39:22,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:22,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:22,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:22,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-28 09:39:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 09:39:22,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 09:39:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:22,265 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 09:39:22,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-28 09:39:22,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 09:39:22,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 09:39:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:39:22,285 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:22,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:22,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:39:22,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash -364154416, now seen corresponding path program 1 times [2022-04-28 09:39:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:22,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1055933191] [2022-04-28 09:39:22,287 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:39:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash -364154416, now seen corresponding path program 2 times [2022-04-28 09:39:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:22,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505972170] [2022-04-28 09:39:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:22,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(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(9, 2); {161#true} is VALID [2022-04-28 09:39:22,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 09:39:22,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #61#return; {161#true} is VALID [2022-04-28 09:39:22,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:22,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(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(9, 2); {161#true} is VALID [2022-04-28 09:39:22,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 09:39:22,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #61#return; {161#true} is VALID [2022-04-28 09:39:22,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret3 := main(); {161#true} is VALID [2022-04-28 09:39:22,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {166#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:22,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {167#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:22,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {168#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:22,498 INFO L272 TraceCheckUtils]: 8: Hoare triple {168#(and (= main_~a~0 0) (= main_~b~0 0) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {169#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:39:22,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {170#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:39:22,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-28 09:39:22,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 09:39:22,500 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-28 09:39:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:22,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505972170] [2022-04-28 09:39:22,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505972170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:22,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:22,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:39:22,501 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:22,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1055933191] [2022-04-28 09:39:22,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1055933191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:22,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:22,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:39:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178563243] [2022-04-28 09:39:22,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-28 09:39:22,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:22,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 09:39:22,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:22,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:39:22,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:39:22,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:39:22,517 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 09:39:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:22,711 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 09:39:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:39:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-28 09:39:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 09:39:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-28 09:39:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 09:39:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-28 09:39:22,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-28 09:39:22,739 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-28 09:39:22,740 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:39:22,741 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:39:22,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:39:22,742 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:22,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:39:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:39:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 09:39:22,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:22,749 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-28 09:39:22,750 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-28 09:39:22,750 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-28 09:39:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:22,751 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:39:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:39:22,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:22,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:22,752 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-28 09:39:22,752 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-28 09:39:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:22,754 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 09:39:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 09:39:22,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:22,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:22,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:22,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:22,755 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-28 09:39:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 09:39:22,756 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-28 09:39:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:22,756 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 09:39:22,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-28 09:39:22,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 09:39:22,774 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-28 09:39:22,775 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 09:39:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:39:22,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:22,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:22,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:39:22,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1324408332, now seen corresponding path program 1 times [2022-04-28 09:39:22,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:22,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611783710] [2022-04-28 09:39:22,795 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:22,796 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:22,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1324408332, now seen corresponding path program 2 times [2022-04-28 09:39:22,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:22,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069024508] [2022-04-28 09:39:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:22,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {306#(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(9, 2); {294#true} is VALID [2022-04-28 09:39:22,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:39:22,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #61#return; {294#true} is VALID [2022-04-28 09:39:22,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:22,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#(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(9, 2); {294#true} is VALID [2022-04-28 09:39:22,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:39:22,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #61#return; {294#true} is VALID [2022-04-28 09:39:22,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret3 := main(); {294#true} is VALID [2022-04-28 09:39:22,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:22,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:22,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {300#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:22,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {301#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:22,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#(and (= main_~i~0 0) (or (<= 3 (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (not (<= (+ (* main_~n~0 3) 1) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {302#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-28 09:39:22,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {302#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} assume !(~i~0 < ~n~0); {303#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:22,989 INFO L272 TraceCheckUtils]: 11: Hoare triple {303#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:39:22,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {304#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {305#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:39:22,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {295#false} is VALID [2022-04-28 09:39:22,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-28 09:39:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:22,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069024508] [2022-04-28 09:39:22,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069024508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:22,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774682486] [2022-04-28 09:39:22,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:39:22,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:22,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:22,997 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-28 09:39:23,002 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-28 09:39:23,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:39:23,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:23,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:39:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:23,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:23,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-28 09:39:23,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#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(9, 2); {294#true} is VALID [2022-04-28 09:39:23,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:39:23,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #61#return; {294#true} is VALID [2022-04-28 09:39:23,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret3 := main(); {294#true} is VALID [2022-04-28 09:39:23,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:23,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:23,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {300#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:23,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {300#(and (= main_~a~0 0) (<= (+ main_~i~0 1) main_~n~0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {334#(and (= main_~b~0 1) (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0) (= main_~a~0 2))} is VALID [2022-04-28 09:39:23,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(and (= main_~b~0 1) (<= (+ main_~i~0 1) main_~n~0) (= main_~i~0 0) (= main_~a~0 2))} ~i~0 := 1 + ~i~0; {338#(and (= main_~b~0 1) (<= 1 main_~n~0) (<= main_~i~0 1) (= main_~a~0 2))} is VALID [2022-04-28 09:39:23,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {338#(and (= main_~b~0 1) (<= 1 main_~n~0) (<= main_~i~0 1) (= main_~a~0 2))} assume !(~i~0 < ~n~0); {342#(and (= main_~b~0 1) (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~a~0 2))} is VALID [2022-04-28 09:39:23,506 INFO L272 TraceCheckUtils]: 11: Hoare triple {342#(and (= main_~b~0 1) (<= 1 main_~n~0) (<= main_~n~0 1) (= main_~a~0 2))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:23,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:23,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-04-28 09:39:23,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-28 09:39:23,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:23,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:23,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-28 09:39:23,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {295#false} is VALID [2022-04-28 09:39:23,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:23,910 INFO L272 TraceCheckUtils]: 11: Hoare triple {303#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:23,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {369#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {303#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:23,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {373#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {369#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:23,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {373#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:23,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {381#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {377#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-28 09:39:23,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {381#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {381#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:39:23,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {381#(and (<= (+ main_~i~0 1) (div (+ main_~b~0 main_~a~0 3) 3)) (<= (div (+ (* (- 1) main_~a~0) (* (- 1) main_~b~0) (- 3)) (- 3)) (+ main_~i~0 1)))} is VALID [2022-04-28 09:39:23,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret3 := main(); {294#true} is VALID [2022-04-28 09:39:23,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #61#return; {294#true} is VALID [2022-04-28 09:39:23,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-28 09:39:23,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#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(9, 2); {294#true} is VALID [2022-04-28 09:39:23,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-28 09:39:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:23,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774682486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:23,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:23,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-28 09:39:23,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:23,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611783710] [2022-04-28 09:39:23,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611783710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:23,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:23,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:39:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34588394] [2022-04-28 09:39:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-28 09:39:23,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:23,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-28 09:39:23,936 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-28 09:39:23,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:39:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:23,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:39:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-28 09:39:23,937 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-28 09:39:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:24,329 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 09:39:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:39:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-28 09:39:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-28 09:39:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 09:39:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-28 09:39:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 09:39:24,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 28 transitions. [2022-04-28 09:39:24,365 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-28 09:39:24,365 INFO L225 Difference]: With dead ends: 25 [2022-04-28 09:39:24,366 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 09:39:24,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:39:24,367 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:24,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:39:24,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 09:39:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 09:39:24,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:24,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 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-28 09:39:24,381 INFO L74 IsIncluded]: Start isIncluded. First operand 20 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-28 09:39:24,381 INFO L87 Difference]: Start difference. First operand 20 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-28 09:39:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:24,382 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 09:39:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 09:39:24,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:24,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:24,383 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 20 states. [2022-04-28 09:39:24,383 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 20 states. [2022-04-28 09:39:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:24,384 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-28 09:39:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 09:39:24,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:24,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:24,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:24,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:24,385 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-28 09:39:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 09:39:24,386 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-28 09:39:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:24,386 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 09:39:24,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-28 09:39:24,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 09:39:24,408 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-28 09:39:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 09:39:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:39:24,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:24,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:24,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:39:24,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:24,632 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash 528338768, now seen corresponding path program 3 times [2022-04-28 09:39:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:24,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513484827] [2022-04-28 09:39:24,643 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:24,643 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 528338768, now seen corresponding path program 4 times [2022-04-28 09:39:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:24,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720963147] [2022-04-28 09:39:24,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:24,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(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(9, 2); {549#true} is VALID [2022-04-28 09:39:24,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#true} assume true; {549#true} is VALID [2022-04-28 09:39:24,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {549#true} {549#true} #61#return; {549#true} is VALID [2022-04-28 09:39:24,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:24,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#(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(9, 2); {549#true} is VALID [2022-04-28 09:39:24,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {549#true} assume true; {549#true} is VALID [2022-04-28 09:39:24,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {549#true} {549#true} #61#return; {549#true} is VALID [2022-04-28 09:39:24,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {549#true} call #t~ret3 := main(); {549#true} is VALID [2022-04-28 09:39:24,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:24,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:24,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:24,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {555#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} is VALID [2022-04-28 09:39:24,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} ~i~0 := 1 + ~i~0; {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:24,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {557#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} is VALID [2022-04-28 09:39:24,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {557#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {558#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:24,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {558#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {559#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-28 09:39:24,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {559#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} assume !(~i~0 < ~n~0); {560#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:24,857 INFO L272 TraceCheckUtils]: 14: Hoare triple {560#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {561#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:39:24,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {561#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {562#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:39:24,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {562#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {550#false} is VALID [2022-04-28 09:39:24,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {550#false} assume !false; {550#false} is VALID [2022-04-28 09:39:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:24,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:24,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720963147] [2022-04-28 09:39:24,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720963147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:24,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752216711] [2022-04-28 09:39:24,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:39:24,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:24,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:24,861 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-28 09:39:24,875 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-28 09:39:24,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:39:24,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:24,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 09:39:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:24,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:25,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {549#true} is VALID [2022-04-28 09:39:25,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#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(9, 2); {549#true} is VALID [2022-04-28 09:39:25,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {549#true} assume true; {549#true} is VALID [2022-04-28 09:39:25,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {549#true} {549#true} #61#return; {549#true} is VALID [2022-04-28 09:39:25,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {549#true} call #t~ret3 := main(); {549#true} is VALID [2022-04-28 09:39:25,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:25,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:25,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:25,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {591#(and (= (+ (- 2) main_~a~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-28 09:39:25,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {591#(and (= (+ (- 2) main_~a~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~b~0) 0))} ~i~0 := 1 + ~i~0; {595#(and (= (+ (- 2) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-28 09:39:25,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {595#(and (= (+ (- 2) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~b~0) 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {599#(and (< main_~i~0 main_~n~0) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-28 09:39:25,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#(and (< main_~i~0 main_~n~0) (= (+ (- 2) main_~a~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~b~0) 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {603#(and (= main_~b~0 2) (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 4))} is VALID [2022-04-28 09:39:25,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#(and (= main_~b~0 2) (< main_~i~0 main_~n~0) (= main_~i~0 1) (= main_~a~0 4))} ~i~0 := 1 + ~i~0; {607#(and (= main_~b~0 2) (< 1 main_~n~0) (<= main_~i~0 2) (= main_~a~0 4))} is VALID [2022-04-28 09:39:25,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#(and (= main_~b~0 2) (< 1 main_~n~0) (<= main_~i~0 2) (= main_~a~0 4))} assume !(~i~0 < ~n~0); {611#(and (<= main_~n~0 2) (= main_~b~0 2) (< 1 main_~n~0) (= main_~a~0 4))} is VALID [2022-04-28 09:39:25,405 INFO L272 TraceCheckUtils]: 14: Hoare triple {611#(and (<= main_~n~0 2) (= main_~b~0 2) (< 1 main_~n~0) (= main_~a~0 4))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:25,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:25,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {550#false} is VALID [2022-04-28 09:39:25,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {550#false} assume !false; {550#false} is VALID [2022-04-28 09:39:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:25,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:25,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {550#false} assume !false; {550#false} is VALID [2022-04-28 09:39:25,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {550#false} is VALID [2022-04-28 09:39:25,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {619#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:25,771 INFO L272 TraceCheckUtils]: 14: Hoare triple {560#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {615#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:25,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {638#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {560#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:25,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {638#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:25,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {646#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {642#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:25,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {646#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-28 09:39:25,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} ~i~0 := 1 + ~i~0; {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:25,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {653#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:25,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:25,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:25,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {556#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:25,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {549#true} call #t~ret3 := main(); {549#true} is VALID [2022-04-28 09:39:25,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {549#true} {549#true} #61#return; {549#true} is VALID [2022-04-28 09:39:25,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {549#true} assume true; {549#true} is VALID [2022-04-28 09:39:25,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#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(9, 2); {549#true} is VALID [2022-04-28 09:39:25,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {549#true} call ULTIMATE.init(); {549#true} is VALID [2022-04-28 09:39:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:39:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752216711] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:25,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:25,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-28 09:39:25,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513484827] [2022-04-28 09:39:25,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513484827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:25,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:25,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:39:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218778944] [2022-04-28 09:39:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-28 09:39:25,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:25,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 09:39:25,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:25,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:39:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:39:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:39:25,797 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 09:39:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:26,328 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 09:39:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:39:26,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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 18 [2022-04-28 09:39:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 09:39:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2022-04-28 09:39:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 09:39:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2022-04-28 09:39:26,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 32 transitions. [2022-04-28 09:39:26,366 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-28 09:39:26,371 INFO L225 Difference]: With dead ends: 28 [2022-04-28 09:39:26,371 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 09:39:26,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 09:39:26,373 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:26,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 52 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:39:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 09:39:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 09:39:26,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:26,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-28 09:39:26,400 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-28 09:39:26,401 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-28 09:39:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:26,408 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 09:39:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 09:39:26,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:26,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:26,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 23 states. [2022-04-28 09:39:26,409 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 23 states. [2022-04-28 09:39:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:26,412 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 09:39:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 09:39:26,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:26,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:26,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:26,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-28 09:39:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-28 09:39:26,418 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2022-04-28 09:39:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:26,419 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-28 09:39:26,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-28 09:39:26,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-28 09:39:26,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-28 09:39:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:39:26,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:39:26,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:39:26,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:39:26,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 09:39:26,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:39:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:39:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1092473972, now seen corresponding path program 5 times [2022-04-28 09:39:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:26,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1765361533] [2022-04-28 09:39:26,670 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:39:26,671 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:39:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1092473972, now seen corresponding path program 6 times [2022-04-28 09:39:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:39:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207998893] [2022-04-28 09:39:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:39:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:39:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:39:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:26,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {866#(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(9, 2); {851#true} is VALID [2022-04-28 09:39:26,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 09:39:26,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {851#true} {851#true} #61#return; {851#true} is VALID [2022-04-28 09:39:26,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:39:26,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#(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(9, 2); {851#true} is VALID [2022-04-28 09:39:26,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 09:39:26,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #61#return; {851#true} is VALID [2022-04-28 09:39:26,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret3 := main(); {851#true} is VALID [2022-04-28 09:39:26,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:26,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:26,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:26,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {857#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} is VALID [2022-04-28 09:39:26,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {857#(and (<= (+ main_~b~0 main_~a~0) 3) (<= 3 (+ main_~b~0 main_~a~0)) (= main_~i~0 0))} ~i~0 := 1 + ~i~0; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:26,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:26,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {859#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:26,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} ~i~0 := 1 + ~i~0; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:26,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {860#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} is VALID [2022-04-28 09:39:26,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {861#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:26,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {861#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (or (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {862#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} is VALID [2022-04-28 09:39:26,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {862#(and (or (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))) (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)))} assume !(~i~0 < ~n~0); {863#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:26,895 INFO L272 TraceCheckUtils]: 17: Hoare triple {863#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:39:26,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {865#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:39:26,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {865#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {852#false} is VALID [2022-04-28 09:39:26,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 09:39:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:39:26,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:39:26,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207998893] [2022-04-28 09:39:26,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207998893] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:39:26,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379797098] [2022-04-28 09:39:26,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:39:26,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:39:26,898 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-28 09:39:26,899 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-28 09:39:26,935 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 09:39:26,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:39:26,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 09:39:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:39:26,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:39:27,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 09:39:27,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#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(9, 2); {851#true} is VALID [2022-04-28 09:39:27,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 09:39:27,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #61#return; {851#true} is VALID [2022-04-28 09:39:27,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret3 := main(); {851#true} is VALID [2022-04-28 09:39:27,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:27,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:27,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} is VALID [2022-04-28 09:39:27,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#(and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {894#(and (= main_~i~0 0) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-28 09:39:27,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {894#(and (= main_~i~0 0) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} ~i~0 := 1 + ~i~0; {898#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-28 09:39:27,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {898#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} is VALID [2022-04-28 09:39:27,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {898#(and (= main_~i~0 1) (= main_~a~0 2) (= (+ (- 1) main_~b~0) 0))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {905#(and (= main_~b~0 2) (= 2 (+ (- 2) main_~a~0)) (= main_~i~0 1))} is VALID [2022-04-28 09:39:27,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {905#(and (= main_~b~0 2) (= 2 (+ (- 2) main_~a~0)) (= main_~i~0 1))} ~i~0 := 1 + ~i~0; {909#(and (= main_~b~0 2) (= 2 (+ (- 2) main_~a~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:39:27,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {909#(and (= main_~b~0 2) (= 2 (+ (- 2) main_~a~0)) (= (+ (- 1) main_~i~0) 1))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {913#(and (= main_~b~0 2) (< main_~i~0 main_~n~0) (= 2 (+ (- 2) main_~a~0)) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:39:27,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#(and (= main_~b~0 2) (< main_~i~0 main_~n~0) (= 2 (+ (- 2) main_~a~0)) (= (+ (- 1) main_~i~0) 1))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {917#(and (= main_~b~0 3) (< main_~i~0 main_~n~0) (= main_~a~0 6) (= (+ (- 1) main_~i~0) 1))} is VALID [2022-04-28 09:39:27,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#(and (= main_~b~0 3) (< main_~i~0 main_~n~0) (= main_~a~0 6) (= (+ (- 1) main_~i~0) 1))} ~i~0 := 1 + ~i~0; {921#(and (= main_~b~0 3) (= main_~a~0 6) (< 2 main_~n~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:39:27,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {921#(and (= main_~b~0 3) (= main_~a~0 6) (< 2 main_~n~0) (<= main_~i~0 3))} assume !(~i~0 < ~n~0); {925#(and (= main_~b~0 3) (= main_~a~0 6) (< 2 main_~n~0) (<= main_~n~0 3))} is VALID [2022-04-28 09:39:27,373 INFO L272 TraceCheckUtils]: 17: Hoare triple {925#(and (= main_~b~0 3) (= main_~a~0 6) (< 2 main_~n~0) (<= main_~n~0 3))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {929#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:27,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {933#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:27,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {933#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 09:39:27,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 09:39:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:39:27,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:39:27,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 09:39:27,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {933#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 09:39:27,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {933#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:39:27,764 INFO L272 TraceCheckUtils]: 17: Hoare triple {863#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {929#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:39:27,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {952#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} assume !(~i~0 < ~n~0); {863#(and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:27,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {956#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} ~i~0 := 1 + ~i~0; {952#(or (< main_~i~0 main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:27,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {960#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {956#(or (< (+ main_~i~0 1) main_~n~0) (and (< (+ main_~b~0 main_~a~0) (+ (* main_~n~0 3) 1)) (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0))))} is VALID [2022-04-28 09:39:27,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {960#(or (< (+ main_~i~0 1) main_~n~0) (and (<= (* main_~n~0 3) (+ main_~b~0 main_~a~0 3)) (< (+ main_~b~0 main_~a~0 2) (* main_~n~0 3))))} is VALID [2022-04-28 09:39:27,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {859#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} ~i~0 := 1 + ~i~0; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:27,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {859#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:27,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:27,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {859#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} ~i~0 := 1 + ~i~0; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:27,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !(0 != #t~nondet2);havoc #t~nondet2;~a~0 := 2 + ~a~0;~b~0 := 1 + ~b~0; {859#(and (<= (+ main_~b~0 main_~a~0) (+ 3 (* main_~i~0 3))) (<= (+ 3 (* main_~i~0 3)) (+ main_~b~0 main_~a~0)))} is VALID [2022-04-28 09:39:27,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~i~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:27,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:27,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0;~a~0 := 0;~b~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {858#(and (<= (* main_~i~0 3) (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (* main_~i~0 3)))} is VALID [2022-04-28 09:39:27,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret3 := main(); {851#true} is VALID [2022-04-28 09:39:27,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #61#return; {851#true} is VALID [2022-04-28 09:39:27,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 09:39:27,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#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(9, 2); {851#true} is VALID [2022-04-28 09:39:27,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 09:39:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 09:39:27,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379797098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:39:27,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:39:27,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 26 [2022-04-28 09:39:27,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:39:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1765361533] [2022-04-28 09:39:27,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1765361533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:39:27,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:39:27,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 09:39:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748937390] [2022-04-28 09:39:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:39:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 21 [2022-04-28 09:39:27,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:39:27,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 09:39:27,795 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-28 09:39:27,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 09:39:27,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:39:27,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 09:39:27,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:39:27,796 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 09:39:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:28,267 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 09:39:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:39:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 21 [2022-04-28 09:39:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:39:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 09:39:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2022-04-28 09:39:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 09:39:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2022-04-28 09:39:28,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 20 transitions. [2022-04-28 09:39:28,289 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-28 09:39:28,290 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:39:28,290 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:39:28,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 09:39:28,291 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:39:28,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:39:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:39:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:39:28,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:39:28,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:28,292 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:28,292 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:28,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:28,292 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:39:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:28,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:28,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:28,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:39:28,293 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:39:28,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:39:28,293 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:39:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:28,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:28,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:39:28,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:39:28,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:39:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:39:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:39:28,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-04-28 09:39:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:39:28,293 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:39:28,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 09:39:28,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:39:28,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:39:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:39:28,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:39:28,296 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:39:28,321 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-28 09:39:28,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:39:28,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:39:28,653 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:39:28,653 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:39:28,653 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:39:28,653 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:39:28,653 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:28,653 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:28,653 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:39:28,654 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 40) the Hoare annotation is: true [2022-04-28 09:39:28,654 INFO L895 garLoopResultBuilder]: At program point L29(lines 29 35) the Hoare annotation is: (let ((.cse1 (+ main_~b~0 main_~a~0)) (.cse0 (* main_~i~0 3))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= (+ main_~b~0 main_~a~0 3) (* main_~n~0 3)))) [2022-04-28 09:39:28,654 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= main_~a~0 0) (= main_~b~0 0) (= main_~i~0 0)) [2022-04-28 09:39:28,654 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 35) the Hoare annotation is: (let ((.cse1 (+ 3 (* main_~i~0 3))) (.cse0 (+ main_~b~0 main_~a~0))) (and (< .cse0 (+ (* main_~n~0 3) 1)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2022-04-28 09:39:28,654 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse1 (+ main_~b~0 main_~a~0)) (.cse0 (* main_~i~0 3))) (and (<= .cse0 .cse1) (< .cse1 (+ (* main_~n~0 3) 1)) (<= .cse1 .cse0))) [2022-04-28 09:39:28,654 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (let ((.cse1 (* main_~n~0 3)) (.cse0 (+ main_~b~0 main_~a~0))) (and (< .cse0 (+ .cse1 1)) (<= .cse1 .cse0))) [2022-04-28 09:39:28,654 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 40) the Hoare annotation is: true [2022-04-28 09:39:28,654 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 40) the Hoare annotation is: true [2022-04-28 09:39:28,654 INFO L902 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2022-04-28 09:39:28,655 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:39:28,656 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:39:28,656 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:39:28,659 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 2] [2022-04-28 09:39:28,660 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:39:28,664 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:39:28,664 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:39:28,665 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:39:28,667 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:39:28,667 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:39:28,667 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:39:28,668 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:39:28,677 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:39:28,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:39:28 BoogieIcfgContainer [2022-04-28 09:39:28,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:39:28,693 INFO L158 Benchmark]: Toolchain (without parser) took 7695.64ms. Allocated memory was 198.2MB in the beginning and 250.6MB in the end (delta: 52.4MB). Free memory was 149.1MB in the beginning and 183.9MB in the end (delta: -34.8MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-28 09:39:28,693 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 198.2MB. Free memory was 165.2MB in the beginning and 165.0MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:39:28,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.86ms. Allocated memory is still 198.2MB. Free memory was 148.8MB in the beginning and 173.7MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 09:39:28,694 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 198.2MB. Free memory was 173.7MB in the beginning and 172.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:39:28,694 INFO L158 Benchmark]: RCFGBuilder took 319.51ms. Allocated memory is still 198.2MB. Free memory was 172.2MB in the beginning and 161.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:39:28,694 INFO L158 Benchmark]: TraceAbstraction took 7037.67ms. Allocated memory was 198.2MB in the beginning and 250.6MB in the end (delta: 52.4MB). Free memory was 160.7MB in the beginning and 183.9MB in the end (delta: -23.2MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. [2022-04-28 09:39:28,696 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.14ms. Allocated memory is still 198.2MB. Free memory was 165.2MB in the beginning and 165.0MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.86ms. Allocated memory is still 198.2MB. Free memory was 148.8MB in the beginning and 173.7MB in the end (delta: -24.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 198.2MB. Free memory was 173.7MB in the beginning and 172.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 319.51ms. Allocated memory is still 198.2MB. Free memory was 172.2MB in the beginning and 161.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7037.67ms. Allocated memory was 198.2MB in the beginning and 250.6MB in the end (delta: 52.4MB). Free memory was 160.7MB in the beginning and 183.9MB in the end (delta: -23.2MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 193 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 62 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 46 PreInvPairs, 68 NumberOfFragments, 136 HoareAnnotationTreeSize, 46 FomulaSimplifications, 129 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 132 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (i * 3 <= b + a && b + a < n * 3 + 1) && b + a <= i * 3 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:39:28,727 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...