/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/hhk2008.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 09:39:41,192 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 09:39:41,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 09:39:41,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 09:39:41,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 09:39:41,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 09:39:41,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 09:39:41,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 09:39:41,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 09:39:41,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 09:39:41,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 09:39:41,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 09:39:41,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 09:39:41,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 09:39:41,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 09:39:41,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 09:39:41,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 09:39:41,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 09:39:41,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 09:39:41,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 09:39:41,262 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 09:39:41,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 09:39:41,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 09:39:41,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 09:39:41,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 09:39:41,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 09:39:41,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 09:39:41,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 09:39:41,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 09:39:41,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 09:39:41,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 09:39:41,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 09:39:41,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 09:39:41,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 09:39:41,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 09:39:41,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 09:39:41,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 09:39:41,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 09:39:41,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 09:39:41,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 09:39:41,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 09:39:41,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 09:39:41,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-08 09:39:41,289 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 09:39:41,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 09:39:41,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 09:39:41,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 09:39:41,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 09:39:41,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 09:39:41,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 09:39:41,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 09:39:41,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 09:39:41,292 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 09:39:41,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 09:39:41,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 09:39:41,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 09:39:41,292 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 09:39:41,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 09:39:41,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 09:39:41,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 09:39:41,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 09:39:41,293 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 09:39:41,293 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 09:39:41,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 09:39:41,294 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 09:39:41,294 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-08 09:39:41,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 09:39:41,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 09:39:41,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 09:39:41,515 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 09:39:41,515 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 09:39:41,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i
[2022-04-08 09:39:41,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0843d36f7/2143e280bf4c4b21887063bf9175ef8d/FLAG924ed0143
[2022-04-08 09:39:41,901 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 09:39:41,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i
[2022-04-08 09:39:41,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0843d36f7/2143e280bf4c4b21887063bf9175ef8d/FLAG924ed0143
[2022-04-08 09:39:42,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0843d36f7/2143e280bf4c4b21887063bf9175ef8d
[2022-04-08 09:39:42,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 09:39:42,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 09:39:42,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 09:39:42,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 09:39:42,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 09:39:42,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbc1390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42, skipping insertion in model container
[2022-04-08 09:39:42,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 09:39:42,364 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 09:39:42,494 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/hhk2008.i[895,908]
[2022-04-08 09:39:42,504 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 09:39:42,512 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 09:39:42,524 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/hhk2008.i[895,908]
[2022-04-08 09:39:42,527 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 09:39:42,539 INFO L208 MainTranslator]: Completed translation
[2022-04-08 09:39:42,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42 WrapperNode
[2022-04-08 09:39:42,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 09:39:42,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 09:39:42,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 09:39:42,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 09:39:42,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 09:39:42,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 09:39:42,573 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 09:39:42,573 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 09:39:42,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (1/1) ...
[2022-04-08 09:39:42,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 09:39:42,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 09:39:42,609 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-08 09:39:42,633 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-08 09:39:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 09:39:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 09:39:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 09:39:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 09:39:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 09:39:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 09:39:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 09:39:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 09:39:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail
[2022-04-08 09:39:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure __assert
[2022-04-08 09:39:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 09:39:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 09:39:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 09:39:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 09:39:42,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 09:39:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 09:39:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 09:39:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 09:39:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 09:39:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 09:39:42,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 09:39:42,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 09:39:42,735 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 09:39:42,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 09:39:42,854 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 09:39:42,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 09:39:42,860 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 09:39:42,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:42 BoogieIcfgContainer
[2022-04-08 09:39:42,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 09:39:42,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 09:39:42,863 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 09:39:42,866 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 09:39:42,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:39:42" (1/3) ...
[2022-04-08 09:39:42,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3107e79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:42, skipping insertion in model container
[2022-04-08 09:39:42,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:39:42" (2/3) ...
[2022-04-08 09:39:42,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3107e79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:39:42, skipping insertion in model container
[2022-04-08 09:39:42,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:39:42" (3/3) ...
[2022-04-08 09:39:42,868 INFO L111 eAbstractionObserver]: Analyzing ICFG hhk2008.i
[2022-04-08 09:39:42,872 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 09:39:42,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 09:39:42,911 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 09:39:42,932 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 09:39:42,933 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 09:39:42,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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-08 09:39:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2022-04-08 09:39:42,966 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 09:39:42,967 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 09:39:42,967 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 09:39:42,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 09:39:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash 499112448, now seen corresponding path program 1 times
[2022-04-08 09:39:42,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 09:39:42,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1194351603]
[2022-04-08 09:39:43,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 09:39:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash 499112448, now seen corresponding path program 2 times
[2022-04-08 09:39:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 09:39:43,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434966766]
[2022-04-08 09:39:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 09:39:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 09:39:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 09:39:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 09:39:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 09:39:43,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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); {24#true} is VALID
[2022-04-08 09:39:43,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID
[2022-04-08 09:39:43,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID
[2022-04-08 09:39:43,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 09:39:43,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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); {24#true} is VALID
[2022-04-08 09:39:43,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID
[2022-04-08 09:39:43,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #58#return; {24#true} is VALID
[2022-04-08 09:39:43,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID
[2022-04-08 09:39:43,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {24#true} is VALID
[2022-04-08 09:39:43,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(~a~0 <= 1000000); {24#true} is VALID
[2022-04-08 09:39:43,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {24#true} is VALID
[2022-04-08 09:39:43,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#true} assume !true; {25#false} is VALID
[2022-04-08 09:39:43,232 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {25#false} is VALID
[2022-04-08 09:39:43,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID
[2022-04-08 09:39:43,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID
[2022-04-08 09:39:43,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID
[2022-04-08 09:39:43,233 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-08 09:39:43,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 09:39:43,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434966766]
[2022-04-08 09:39:43,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434966766] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 09:39:43,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 09:39:43,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 09:39:43,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 09:39:43,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1194351603]
[2022-04-08 09:39:43,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1194351603] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 09:39:43,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 09:39:43,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 09:39:43,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802659420]
[2022-04-08 09:39:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 09:39:43,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13
[2022-04-08 09:39:43,247 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 09:39:43,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 09:39:43,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 09:39:43,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 09:39:43,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 09:39:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 09:39:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 09:39:43,305 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 09:39:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:43,389 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions.
[2022-04-08 09:39:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 09:39:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13
[2022-04-08 09:39:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 09:39:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 09:39:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions.
[2022-04-08 09:39:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 09:39:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions.
[2022-04-08 09:39:43,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions.
[2022-04-08 09:39:43,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 09:39:43,471 INFO L225 Difference]: With dead ends: 33
[2022-04-08 09:39:43,471 INFO L226 Difference]: Without dead ends: 14
[2022-04-08 09:39:43,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 09:39:43,478 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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-08 09:39:43,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 09:39:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2022-04-08 09:39:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2022-04-08 09:39:43,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 09:39:43,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-08 09:39:43,505 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-08 09:39:43,506 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-08 09:39:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:43,508 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions.
[2022-04-08 09:39:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2022-04-08 09:39:43,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 09:39:43,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 09:39:43,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states.
[2022-04-08 09:39:43,509 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states.
[2022-04-08 09:39:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:43,517 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions.
[2022-04-08 09:39:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2022-04-08 09:39:43,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 09:39:43,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 09:39:43,521 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 09:39:43,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 09:39:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-08 09:39:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions.
[2022-04-08 09:39:43,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13
[2022-04-08 09:39:43,527 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 09:39:43,527 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions.
[2022-04-08 09:39:43,527 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-08 09:39:43,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions.
[2022-04-08 09:39:43,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 09:39:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2022-04-08 09:39:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2022-04-08 09:39:43,561 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 09:39:43,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 09:39:43,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 09:39:43,562 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 09:39:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 09:39:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 495418364, now seen corresponding path program 1 times
[2022-04-08 09:39:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 09:39:43,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513454753]
[2022-04-08 09:39:43,564 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 09:39:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 495418364, now seen corresponding path program 2 times
[2022-04-08 09:39:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 09:39:43,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774770427]
[2022-04-08 09:39:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 09:39:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 09:39:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 09:39:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 09:39:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 09:39:43,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(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); {154#true} is VALID
[2022-04-08 09:39:43,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID
[2022-04-08 09:39:43,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #58#return; {154#true} is VALID
[2022-04-08 09:39:43,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 09:39:43,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(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); {154#true} is VALID
[2022-04-08 09:39:43,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID
[2022-04-08 09:39:43,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #58#return; {154#true} is VALID
[2022-04-08 09:39:43,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret3 := main(); {154#true} is VALID
[2022-04-08 09:39:43,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {154#true} is VALID
[2022-04-08 09:39:43,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {154#true} assume !!(~a~0 <= 1000000); {154#true} is VALID
[2022-04-08 09:39:43,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {159#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID
[2022-04-08 09:39:43,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} assume !(~cnt~0 > 0); {160#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID
[2022-04-08 09:39:43,746 INFO L272 TraceCheckUtils]: 9: Hoare triple {160#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 09:39:43,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {162#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 09:39:43,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {155#false} is VALID
[2022-04-08 09:39:43,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !false; {155#false} is VALID
[2022-04-08 09:39:43,748 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-08 09:39:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 09:39:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774770427]
[2022-04-08 09:39:43,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774770427] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 09:39:43,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 09:39:43,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 09:39:43,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 09:39:43,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513454753]
[2022-04-08 09:39:43,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513454753] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 09:39:43,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 09:39:43,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-04-08 09:39:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281037450]
[2022-04-08 09:39:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 09:39:43,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13
[2022-04-08 09:39:43,751 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 09:39:43,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-08 09:39:43,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 09:39:43,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-04-08 09:39:43,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 09:39:43,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-04-08 09:39:43,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-04-08 09:39:43,764 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-08 09:39:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:43,963 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions.
[2022-04-08 09:39:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 09:39:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13
[2022-04-08 09:39:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 09:39:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-08 09:39:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions.
[2022-04-08 09:39:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-08 09:39:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions.
[2022-04-08 09:39:43,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 20 transitions.
[2022-04-08 09:39:43,994 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-08 09:39:43,998 INFO L225 Difference]: With dead ends: 20
[2022-04-08 09:39:43,999 INFO L226 Difference]: Without dead ends: 15
[2022-04-08 09:39:43,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2022-04-08 09:39:44,001 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 09:39:44,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 09:39:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2022-04-08 09:39:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2022-04-08 09:39:44,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 09:39:44,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:44,009 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:44,009 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:44,011 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2022-04-08 09:39:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2022-04-08 09:39:44,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 09:39:44,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 09:39:44,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states.
[2022-04-08 09:39:44,012 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states.
[2022-04-08 09:39:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:44,013 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2022-04-08 09:39:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2022-04-08 09:39:44,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 09:39:44,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 09:39:44,013 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 09:39:44,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 09:39:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2022-04-08 09:39:44,015 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13
[2022-04-08 09:39:44,015 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 09:39:44,015 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2022-04-08 09:39:44,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-08 09:39:44,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions.
[2022-04-08 09:39:44,030 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-08 09:39:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2022-04-08 09:39:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2022-04-08 09:39:44,031 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 09:39:44,031 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 09:39:44,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 09:39:44,032 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 09:39:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 09:39:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1787404818, now seen corresponding path program 1 times
[2022-04-08 09:39:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 09:39:44,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765627926]
[2022-04-08 09:39:44,049 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 09:39:44,050 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 09:39:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1787404818, now seen corresponding path program 2 times
[2022-04-08 09:39:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 09:39:44,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585104266]
[2022-04-08 09:39:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 09:39:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 09:39:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 09:39:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 09:39:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 09:39:44,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {284#(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); {274#true} is VALID
[2022-04-08 09:39:44,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID
[2022-04-08 09:39:44,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #58#return; {274#true} is VALID
[2022-04-08 09:39:44,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 09:39:44,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#(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); {274#true} is VALID
[2022-04-08 09:39:44,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID
[2022-04-08 09:39:44,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #58#return; {274#true} is VALID
[2022-04-08 09:39:44,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret3 := main(); {274#true} is VALID
[2022-04-08 09:39:44,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {274#true} is VALID
[2022-04-08 09:39:44,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#true} assume !!(~a~0 <= 1000000); {274#true} is VALID
[2022-04-08 09:39:44,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {279#(and (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} is VALID
[2022-04-08 09:39:44,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(and (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0)) (<= (+ main_~cnt~0 main_~res~0) (+ main_~b~0 main_~a~0)))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {280#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} is VALID
[2022-04-08 09:39:44,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {280#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (or (<= (+ main_~b~0 main_~a~0) main_~res~0) (<= (+ main_~b~0 main_~a~0) (+ main_~cnt~0 main_~res~0))))} assume !(~cnt~0 > 0); {281#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID
[2022-04-08 09:39:44,199 INFO L272 TraceCheckUtils]: 10: Hoare triple {281#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 09:39:44,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {283#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 09:39:44,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {283#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID
[2022-04-08 09:39:44,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#false} assume !false; {275#false} is VALID
[2022-04-08 09:39:44,200 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-08 09:39:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 09:39:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585104266]
[2022-04-08 09:39:44,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585104266] provided 0 perfect and 1 imperfect interpolant sequences
[2022-04-08 09:39:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422518293]
[2022-04-08 09:39:44,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 09:39:44,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 09:39:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 09:39:44,203 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-08 09:39:44,208 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-08 09:39:44,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 09:39:44,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 09:39:44,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core
[2022-04-08 09:39:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 09:39:44,287 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 09:39:44,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID
[2022-04-08 09:39:44,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#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); {274#true} is VALID
[2022-04-08 09:39:44,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID
[2022-04-08 09:39:44,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #58#return; {274#true} is VALID
[2022-04-08 09:39:44,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret3 := main(); {274#true} is VALID
[2022-04-08 09:39:44,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {274#true} is VALID
[2022-04-08 09:39:44,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#true} assume !!(~a~0 <= 1000000); {274#true} is VALID
[2022-04-08 09:39:44,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {309#(and (= main_~cnt~0 main_~b~0) (= main_~res~0 main_~a~0))} is VALID
[2022-04-08 09:39:44,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#(and (= main_~cnt~0 main_~b~0) (= main_~res~0 main_~a~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {313#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0))} is VALID
[2022-04-08 09:39:44,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 (+ main_~cnt~0 1)) (< 0 main_~b~0))} assume !(~cnt~0 > 0); {317#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 1) (< 0 main_~b~0))} is VALID
[2022-04-08 09:39:44,635 INFO L272 TraceCheckUtils]: 10: Hoare triple {317#(and (= (+ (- 1) main_~res~0) main_~a~0) (<= main_~b~0 1) (< 0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 09:39:44,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 09:39:44,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {275#false} is VALID
[2022-04-08 09:39:44,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#false} assume !false; {275#false} is VALID
[2022-04-08 09:39:44,637 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-08 09:39:44,637 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 09:39:44,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#false} assume !false; {275#false} is VALID
[2022-04-08 09:39:44,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {275#false} is VALID
[2022-04-08 09:39:44,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 09:39:44,831 INFO L272 TraceCheckUtils]: 10: Hoare triple {281#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 09:39:44,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} assume !(~cnt~0 > 0); {281#(and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))} is VALID
[2022-04-08 09:39:44,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(or (< 1 main_~cnt~0) (not (< 0 main_~cnt~0)) (and (< main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1))))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {344#(or (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0)) (< 0 main_~cnt~0))} is VALID
[2022-04-08 09:39:44,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {348#(or (< 1 main_~cnt~0) (not (< 0 main_~cnt~0)) (and (< main_~res~0 (+ main_~b~0 main_~a~0)) (<= (+ main_~b~0 main_~a~0) (+ main_~res~0 1))))} is VALID
[2022-04-08 09:39:44,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#true} assume !!(~a~0 <= 1000000); {274#true} is VALID
[2022-04-08 09:39:44,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~a~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~b~0 := #t~nondet2;havoc #t~nondet2;havoc ~res~0;havoc ~cnt~0; {274#true} is VALID
[2022-04-08 09:39:44,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret3 := main(); {274#true} is VALID
[2022-04-08 09:39:44,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #58#return; {274#true} is VALID
[2022-04-08 09:39:44,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID
[2022-04-08 09:39:44,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#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); {274#true} is VALID
[2022-04-08 09:39:44,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID
[2022-04-08 09:39:44,835 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-08 09:39:44,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422518293] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-08 09:39:44,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-04-08 09:39:44,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15
[2022-04-08 09:39:44,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 09:39:44,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765627926]
[2022-04-08 09:39:44,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765627926] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 09:39:44,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 09:39:44,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 09:39:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358370300]
[2022-04-08 09:39:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 09:39:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14
[2022-04-08 09:39:44,839 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 09:39:44,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:44,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 09:39:44,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 09:39:44,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 09:39:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 09:39:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210
[2022-04-08 09:39:44,853 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:45,027 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2022-04-08 09:39:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-08 09:39:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14
[2022-04-08 09:39:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 09:39:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions.
[2022-04-08 09:39:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 14 transitions.
[2022-04-08 09:39:45,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 14 transitions.
[2022-04-08 09:39:45,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 09:39:45,044 INFO L225 Difference]: With dead ends: 15
[2022-04-08 09:39:45,044 INFO L226 Difference]: Without dead ends: 0
[2022-04-08 09:39:45,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342
[2022-04-08 09:39:45,046 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 09:39:45,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 09:39:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-08 09:39:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-08 09:39:45,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 09:39:45,048 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-08 09:39:45,048 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-08 09:39:45,048 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-08 09:39:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:45,048 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 09:39:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 09:39:45,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 09:39:45,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 09:39:45,048 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-08 09:39:45,049 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-08 09:39:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 09:39:45,049 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 09:39:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 09:39:45,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 09:39:45,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 09:39:45,049 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 09:39:45,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 09:39:45,049 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-08 09:39:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-08 09:39:45,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14
[2022-04-08 09:39:45,050 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 09:39:45,050 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-08 09:39:45,050 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 09:39:45,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2022-04-08 09:39:45,050 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-08 09:39:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 09:39:45,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 09:39:45,053 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 09:39:45,079 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-08 09:39:45,276 WARN L460 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-08 09:39:45,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-08 09:39:45,338 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed.
[2022-04-08 09:39:45,339 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed.
[2022-04-08 09:39:45,339 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed.
[2022-04-08 09:39:45,339 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed.
[2022-04-08 09:39:45,339 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed.
[2022-04-08 09:39:45,339 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed.
[2022-04-08 09:39:45,339 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed.
[2022-04-08 09:39:45,340 INFO L878 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse1 (+ main_~cnt~0 main_~res~0)) (.cse0 (+ main_~b~0 main_~a~0))) (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= .cse0 .cse1) (<= .cse1 .cse0)))
[2022-04-08 09:39:45,340 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 38) the Hoare annotation is: true
[2022-04-08 09:39:45,340 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true
[2022-04-08 09:39:45,340 INFO L878 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (and (< main_~res~0 (+ main_~b~0 main_~a~0 1)) (<= (+ main_~b~0 main_~a~0) main_~res~0))
[2022-04-08 09:39:45,340 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true
[2022-04-08 09:39:45,340 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 38) the Hoare annotation is: true
[2022-04-08 09:39:45,340 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 38) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L878 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-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true
[2022-04-08 09:39:45,341 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true
[2022-04-08 09:39:45,342 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true
[2022-04-08 09:39:45,342 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0)
[2022-04-08 09:39:45,342 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0)
[2022-04-08 09:39:45,342 INFO L878 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-08 09:39:45,345 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2]
[2022-04-08 09:39:45,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 09:39:45,349 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 09:39:45,349 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 09:39:45,350 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-08 09:39:45,350 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation
[2022-04-08 09:39:45,350 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation
[2022-04-08 09:39:45,350 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation
[2022-04-08 09:39:45,352 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation
[2022-04-08 09:39:45,356 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-08 09:39:45,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:39:45 BoogieIcfgContainer
[2022-04-08 09:39:45,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 09:39:45,365 INFO L158 Benchmark]: Toolchain (without parser) took 3024.94ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 147.1MB in the beginning and 107.4MB in the end (delta: 39.6MB). Peak memory consumption was 74.1MB. Max. memory is 8.0GB.
[2022-04-08 09:39:45,365 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 09:39:45,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.78ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 146.7MB in the beginning and 179.5MB in the end (delta: -32.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB.
[2022-04-08 09:39:45,366 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 204.5MB. Free memory was 179.5MB in the beginning and 178.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-08 09:39:45,366 INFO L158 Benchmark]: RCFGBuilder took 288.70ms. Allocated memory is still 204.5MB. Free memory was 177.9MB in the beginning and 166.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 09:39:45,366 INFO L158 Benchmark]: TraceAbstraction took 2500.65ms. Allocated memory is still 204.5MB. Free memory was 166.4MB in the beginning and 107.4MB in the end (delta: 59.0MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB.
[2022-04-08 09:39:45,368 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.15ms. Allocated memory is still 169.9MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 199.78ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 146.7MB in the beginning and 179.5MB in the end (delta: -32.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 31.24ms. Allocated memory is still 204.5MB. Free memory was 179.5MB in the beginning and 178.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 288.70ms. Allocated memory is still 204.5MB. Free memory was 177.9MB in the beginning and 166.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 2500.65ms. Allocated memory is still 204.5MB. Free memory was 166.4MB in the beginning and 107.4MB in the end (delta: 59.0MB). Peak memory consumption was 60.4MB. 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 71 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 42 mSDtfsCounter, 71 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 45 NumberOfFragments, 69 HoareAnnotationTreeSize, 33 FomulaSimplifications, 41 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 32]: Loop Invariant
Derived loop invariant: (res < b + a + 1 && b + a <= cnt + res) && cnt + res <= b + a
- 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-08 09:39:45,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...