/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/loopv3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:07:39,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:07:39,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:07:39,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:07:39,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:07:39,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:07:39,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:07:39,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:07:39,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:07:39,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:07:39,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:07:39,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:07:39,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:07:39,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:07:39,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:07:39,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:07:39,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:07:39,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:07:39,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:07:39,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:07:39,496 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:07:39,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:07:39,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:07:39,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:07:39,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:07:39,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:07:39,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:07:39,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:07:39,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:07:39,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:07:39,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:07:39,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:07:39,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:07:39,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:07:39,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:07:39,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:07:39,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:07:39,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:07:39,508 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:07:39,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:07:39,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:07:39,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:07:39,510 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 10:07:39,519 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:07:39,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:07:39,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:07:39,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:07:39,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:07:39,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:07:39,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:07:39,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:07:39,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:07:39,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:07:39,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:07:39,521 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:07:39,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:07:39,522 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:07:39,522 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 10:07:39,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:07:39,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:07:39,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:07:39,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:07:39,689 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:07:39,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-08 10:07:39,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fb221524/ff4f58ef68dc484cb6d899ab0770597f/FLAG46132ecb0 [2022-04-08 10:07:40,099 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:07:40,099 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c [2022-04-08 10:07:40,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fb221524/ff4f58ef68dc484cb6d899ab0770597f/FLAG46132ecb0 [2022-04-08 10:07:40,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fb221524/ff4f58ef68dc484cb6d899ab0770597f [2022-04-08 10:07:40,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:07:40,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:07:40,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:07:40,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:07:40,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:07:40,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba1c6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40, skipping insertion in model container [2022-04-08 10:07:40,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:07:40,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:07:40,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c[456,469] [2022-04-08 10:07:40,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:07:40,270 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:07:40,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/loopv3.c[456,469] [2022-04-08 10:07:40,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:07:40,296 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:07:40,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40 WrapperNode [2022-04-08 10:07:40,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:07:40,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:07:40,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:07:40,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:07:40,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:07:40,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:07:40,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:07:40,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:07:40,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (1/1) ... [2022-04-08 10:07:40,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:07:40,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:40,344 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 10:07:40,345 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 10:07:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:07:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:07:40,370 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:07:40,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:07:40,370 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:07:40,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:07:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:07:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:07:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:07:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:07:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:07:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:07:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:07:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:07:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:07:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:07:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:07:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:07:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:07:40,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:07:40,419 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:07:40,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:07:40,510 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:07:40,514 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:07:40,515 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:07:40,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:07:40 BoogieIcfgContainer [2022-04-08 10:07:40,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:07:40,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:07:40,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:07:40,537 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:07:40,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:07:40" (1/3) ... [2022-04-08 10:07:40,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713b759c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:07:40, skipping insertion in model container [2022-04-08 10:07:40,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:07:40" (2/3) ... [2022-04-08 10:07:40,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713b759c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:07:40, skipping insertion in model container [2022-04-08 10:07:40,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:07:40" (3/3) ... [2022-04-08 10:07:40,538 INFO L111 eAbstractionObserver]: Analyzing ICFG loopv3.c [2022-04-08 10:07:40,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:07:40,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:07:40,586 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:07:40,598 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 10:07:40,598 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:07:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 10:07:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:07:40,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:40,615 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:40,615 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash -380103047, now seen corresponding path program 1 times [2022-04-08 10:07:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:40,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599405852] [2022-04-08 10:07:40,630 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:07:40,631 INFO L85 PathProgramCache]: Analyzing trace with hash -380103047, now seen corresponding path program 2 times [2022-04-08 10:07:40,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:40,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910938647] [2022-04-08 10:07:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:40,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:40,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(<= 50000001 ~SIZE~0)} assume true; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:40,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#(<= 50000001 ~SIZE~0)} {24#true} #52#return; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:40,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:40,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:40,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(<= 50000001 ~SIZE~0)} assume true; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:40,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#(<= 50000001 ~SIZE~0)} {24#true} #52#return; {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:40,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {29#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:40,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {30#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:40,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {25#false} is VALID [2022-04-08 10:07:40,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {25#false} is VALID [2022-04-08 10:07:40,797 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {25#false} is VALID [2022-04-08 10:07:40,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-08 10:07:40,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-08 10:07:40,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-08 10:07:40,798 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 10:07:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:40,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910938647] [2022-04-08 10:07:40,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910938647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:40,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:40,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:07:40,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:40,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599405852] [2022-04-08 10:07:40,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599405852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:40,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:40,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 10:07:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522189158] [2022-04-08 10:07:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-08 10:07:40,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:40,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:07:40,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:40,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:07:40,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:07:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:07:40,840 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:07:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,031 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 10:07:41,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:07:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-08 10:07:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:07:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 10:07:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:07:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 10:07:41,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-08 10:07:41,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,102 INFO L225 Difference]: With dead ends: 36 [2022-04-08 10:07:41,102 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 10:07:41,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:07:41,108 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:41,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:07:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 10:07:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-08 10:07:41,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:41,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,147 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,148 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,149 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 10:07:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 10:07:41,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:41,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:41,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 10:07:41,150 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 10:07:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,152 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-08 10:07:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 10:07:41,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:41,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:41,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:41,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-08 10:07:41,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-08 10:07:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:41,160 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-08 10:07:41,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 10:07:41,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-08 10:07:41,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-08 10:07:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 10:07:41,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:41,197 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:41,197 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:07:41,197 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash 437044508, now seen corresponding path program 1 times [2022-04-08 10:07:41,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:41,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1004849048] [2022-04-08 10:07:41,214 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:41,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash 437044508, now seen corresponding path program 2 times [2022-04-08 10:07:41,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:41,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957789356] [2022-04-08 10:07:41,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:41,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#(<= 50000001 ~SIZE~0)} assume true; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} #52#return; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:41,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 50000001 ~SIZE~0)} assume true; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} #52#return; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:41,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:41,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {179#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-08 10:07:41,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {173#false} is VALID [2022-04-08 10:07:41,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {173#false} is VALID [2022-04-08 10:07:41,316 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {173#false} is VALID [2022-04-08 10:07:41,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-08 10:07:41,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-08 10:07:41,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-08 10:07:41,317 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 10:07:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957789356] [2022-04-08 10:07:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957789356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537679351] [2022-04-08 10:07:41,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:41,330 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 10:07:41,345 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 10:07:41,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:41,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:41,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-08 10:07:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:41,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {172#true} is VALID [2022-04-08 10:07:41,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 50000001 ~SIZE~0)} assume true; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#(<= 50000001 ~SIZE~0)} {172#true} #52#return; {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {177#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:41,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:41,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:41,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (<= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {206#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:41,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#(and (<= main_~i~0 8) (<= 50000001 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {173#false} is VALID [2022-04-08 10:07:41,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {173#false} is VALID [2022-04-08 10:07:41,583 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {173#false} is VALID [2022-04-08 10:07:41,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-08 10:07:41,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-08 10:07:41,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-08 10:07:41,584 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 10:07:41,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:41,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-08 10:07:41,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {173#false} assume 0 == ~cond; {173#false} is VALID [2022-04-08 10:07:41,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {173#false} ~cond := #in~cond; {173#false} is VALID [2022-04-08 10:07:41,691 INFO L272 TraceCheckUtils]: 10: Hoare triple {173#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {173#false} is VALID [2022-04-08 10:07:41,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {173#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {173#false} is VALID [2022-04-08 10:07:41,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#(< main_~i~0 ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {173#false} is VALID [2022-04-08 10:07:41,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(< (+ main_~i~0 8) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {240#(< main_~i~0 ~SIZE~0)} is VALID [2022-04-08 10:07:41,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(< (+ main_~i~0 8) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {244#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:07:41,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(< 8 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {244#(< (+ main_~i~0 8) ~SIZE~0)} is VALID [2022-04-08 10:07:41,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#(< 8 ~SIZE~0)} call #t~ret5 := main(); {251#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:07:41,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#(< 8 ~SIZE~0)} {172#true} #52#return; {251#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:07:41,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#(< 8 ~SIZE~0)} assume true; {251#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:07:41,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {251#(< 8 ~SIZE~0)} is VALID [2022-04-08 10:07:41,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {172#true} is VALID [2022-04-08 10:07:41,699 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 10:07:41,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537679351] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:41,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:41,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-04-08 10:07:41,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1004849048] [2022-04-08 10:07:41,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1004849048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:41,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:41,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:07:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410809150] [2022-04-08 10:07:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:41,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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) Word has length 14 [2022-04-08 10:07:41,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:41,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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 10:07:41,711 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 10:07:41,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:07:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:41,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:07:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:07:41,712 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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 10:07:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,809 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:07:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:07:41,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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) Word has length 14 [2022-04-08 10:07:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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 10:07:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-08 10:07:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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 10:07:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-08 10:07:41,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-08 10:07:41,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,837 INFO L225 Difference]: With dead ends: 24 [2022-04-08 10:07:41,837 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 10:07:41,838 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:07:41,838 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:41,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:07:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 10:07:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-08 10:07:41,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:41,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,851 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,851 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,852 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 10:07:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 10:07:41,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:41,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:41,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:07:41,852 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-08 10:07:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:41,853 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-08 10:07:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 10:07:41,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:41,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:41,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:41,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:07:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 10:07:41,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-04-08 10:07:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:41,855 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 10:07:41,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 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 10:07:41,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 10:07:41,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 10:07:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:07:41,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:41,870 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:41,889 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 10:07:42,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:42,083 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -263170305, now seen corresponding path program 3 times [2022-04-08 10:07:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:42,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [782145278] [2022-04-08 10:07:42,091 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:42,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -263170305, now seen corresponding path program 4 times [2022-04-08 10:07:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:42,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30081736] [2022-04-08 10:07:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:42,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:42,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:42,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#(<= 50000001 ~SIZE~0)} assume true; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:42,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#(<= 50000001 ~SIZE~0)} {393#true} #52#return; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:42,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:42,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:42,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#(<= 50000001 ~SIZE~0)} assume true; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:42,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#(<= 50000001 ~SIZE~0)} {393#true} #52#return; {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:42,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#(<= 50000001 ~SIZE~0)} call #t~ret5 := main(); {398#(<= 50000001 ~SIZE~0)} is VALID [2022-04-08 10:07:42,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#(<= 50000001 ~SIZE~0)} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:42,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} is VALID [2022-04-08 10:07:42,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(and (= main_~i~0 0) (<= 50000001 ~SIZE~0))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-08 10:07:42,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} is VALID [2022-04-08 10:07:42,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(<= (+ main_~i~0 49999993) ~SIZE~0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {401#(<= (+ main_~i~0 49999985) ~SIZE~0)} is VALID [2022-04-08 10:07:42,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {401#(<= (+ main_~i~0 49999985) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {394#false} is VALID [2022-04-08 10:07:42,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#false} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {394#false} is VALID [2022-04-08 10:07:42,161 INFO L272 TraceCheckUtils]: 12: Hoare triple {394#false} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {394#false} is VALID [2022-04-08 10:07:42,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} ~cond := #in~cond; {394#false} is VALID [2022-04-08 10:07:42,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} assume 0 == ~cond; {394#false} is VALID [2022-04-08 10:07:42,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-08 10:07:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:42,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30081736] [2022-04-08 10:07:42,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30081736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:42,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648382095] [2022-04-08 10:07:42,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:42,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:42,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:42,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:42,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:07:42,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:42,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:42,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:07:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:42,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:42,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-08 10:07:42,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {393#true} is VALID [2022-04-08 10:07:42,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-08 10:07:42,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #52#return; {393#true} is VALID [2022-04-08 10:07:42,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret5 := main(); {393#true} is VALID [2022-04-08 10:07:42,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {421#(= main_~i~0 0)} is VALID [2022-04-08 10:07:42,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {421#(= main_~i~0 0)} is VALID [2022-04-08 10:07:42,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~i~0 0)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {428#(= main_~i~0 8)} is VALID [2022-04-08 10:07:42,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#(= main_~i~0 8)} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {428#(= main_~i~0 8)} is VALID [2022-04-08 10:07:42,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#(= main_~i~0 8)} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {435#(= (+ main_~i~0 (- 8)) 8)} is VALID [2022-04-08 10:07:42,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#(= (+ main_~i~0 (- 8)) 8)} assume !(~i~0 < ~SIZE~0); {435#(= (+ main_~i~0 (- 8)) 8)} is VALID [2022-04-08 10:07:42,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#(= (+ main_~i~0 (- 8)) 8)} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {442#(and (= (+ main_~i~0 (- 8)) 8) (= main_~j~0 (div main_~i~0 4)))} is VALID [2022-04-08 10:07:42,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {442#(and (= (+ main_~i~0 (- 8)) 8) (= main_~j~0 (div main_~i~0 4)))} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:42,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:42,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-08 10:07:42,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-08 10:07:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:42,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:42,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-08 10:07:42,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-08 10:07:42,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {450#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:42,530 INFO L272 TraceCheckUtils]: 12: Hoare triple {466#(= main_~i~0 (* main_~j~0 4))} call __VERIFIER_assert((if 4 * ~j~0 == ~i~0 then 1 else 0)); {446#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:42,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} ~j~0 := (if ~i~0 < 0 && 0 != ~i~0 % 4 then 1 + ~i~0 / 4 else ~i~0 / 4); {466#(= main_~i~0 (* main_~j~0 4))} is VALID [2022-04-08 10:07:42,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !(~i~0 < ~SIZE~0); {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-08 10:07:42,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-08 10:07:42,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-08 10:07:42,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume 0 != #t~nondet4;havoc #t~nondet4;~i~0 := 8 + ~i~0; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-08 10:07:42,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(= main_~i~0 (* (div main_~i~0 4) 4))} assume !!(~i~0 < ~SIZE~0);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-08 10:07:42,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} havoc ~i~0;havoc ~j~0;~i~0 := 0;~j~0 := 0; {470#(= main_~i~0 (* (div main_~i~0 4) 4))} is VALID [2022-04-08 10:07:42,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret5 := main(); {393#true} is VALID [2022-04-08 10:07:42,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #52#return; {393#true} is VALID [2022-04-08 10:07:42,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-08 10:07:42,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#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);call #Ultimate.allocInit(12, 3);~SIZE~0 := 50000001; {393#true} is VALID [2022-04-08 10:07:42,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-08 10:07:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:07:42,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648382095] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:42,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:07:42,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 8] total 15 [2022-04-08 10:07:42,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:42,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [782145278] [2022-04-08 10:07:42,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [782145278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:42,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:42,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:07:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614953138] [2022-04-08 10:07:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:42,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 16 [2022-04-08 10:07:42,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:42,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 10:07:42,547 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 10:07:42,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:07:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:07:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:07:42,548 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 10:07:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:42,616 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 10:07:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:07:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 16 [2022-04-08 10:07:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 10:07:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-08 10:07:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 10:07:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-04-08 10:07:42,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2022-04-08 10:07:42,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:42,640 INFO L225 Difference]: With dead ends: 17 [2022-04-08 10:07:42,640 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:07:42,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:07:42,642 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:42,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:07:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:07:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:07:42,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:42,642 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 10:07:42,643 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 10:07:42,643 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 10:07:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:42,643 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:07:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:07:42,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:42,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:42,643 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 10:07:42,643 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 10:07:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:42,643 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:07:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:07:42,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:42,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:42,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:42,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:42,643 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 10:07:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:07:42,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-08 10:07:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:42,644 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:07:42,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 10:07:42,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:07:42,644 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 10:07:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:07:42,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:42,646 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:07:42,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:42,866 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 10:07:42,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:07:42,984 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-08 10:07:42,984 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-08 10:07:42,984 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-08 10:07:42,985 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2022-04-08 10:07:42,985 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-08 10:07:42,985 INFO L882 garLoopResultBuilder]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2022-04-08 10:07:42,985 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-08 10:07:42,985 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* main_~j~0 4))) [2022-04-08 10:07:42,985 INFO L885 garLoopResultBuilder]: At program point L32-1(line 32) the Hoare annotation is: true [2022-04-08 10:07:42,985 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-08 10:07:42,986 INFO L878 garLoopResultBuilder]: At program point L25(lines 25 28) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-08 10:07:42,986 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 34) the Hoare annotation is: true [2022-04-08 10:07:42,986 INFO L878 garLoopResultBuilder]: At program point L25-2(lines 23 30) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-08 10:07:42,986 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 30) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (= main_~i~0 (* (div main_~i~0 4) 4))) [2022-04-08 10:07:42,987 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 34) the Hoare annotation is: true [2022-04-08 10:07:42,987 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-08 10:07:42,987 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:07:42,987 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-08 10:07:42,987 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-08 10:07:42,987 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-08 10:07:42,987 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:07:42,987 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: (<= 50000001 ~SIZE~0) [2022-04-08 10:07:42,987 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 17) the Hoare annotation is: true [2022-04-08 10:07:42,987 INFO L878 garLoopResultBuilder]: At program point L14(line 14) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:07:42,988 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 15) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-08 10:07:42,988 INFO L885 garLoopResultBuilder]: At program point L13-2(lines 12 17) the Hoare annotation is: true [2022-04-08 10:07:42,988 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 12 17) the Hoare annotation is: true [2022-04-08 10:07:42,988 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (or (not (<= 50000001 ~SIZE~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:07:42,990 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-08 10:07:42,991 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:07:42,995 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:07:42,997 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 10:07:42,998 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:07:42,998 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 10:07:42,998 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-08 10:07:43,004 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-04-08 10:07:43,010 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:07:43,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:07:43 BoogieIcfgContainer [2022-04-08 10:07:43,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:07:43,016 INFO L158 Benchmark]: Toolchain (without parser) took 2903.67ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 137.1MB in the beginning and 81.4MB in the end (delta: 55.7MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. [2022-04-08 10:07:43,016 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory was 153.4MB in the beginning and 153.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:07:43,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.74ms. Allocated memory is still 186.6MB. Free memory was 136.8MB in the beginning and 163.5MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:07:43,017 INFO L158 Benchmark]: Boogie Preprocessor took 22.60ms. Allocated memory is still 186.6MB. Free memory was 163.5MB in the beginning and 162.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 10:07:43,017 INFO L158 Benchmark]: RCFGBuilder took 195.77ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 152.0MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 10:07:43,017 INFO L158 Benchmark]: TraceAbstraction took 2480.91ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 151.2MB in the beginning and 81.4MB in the end (delta: 69.8MB). Peak memory consumption was 108.4MB. Max. memory is 8.0GB. [2022-04-08 10:07:43,023 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.11ms. Allocated memory is still 186.6MB. Free memory was 153.4MB in the beginning and 153.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.74ms. Allocated memory is still 186.6MB. Free memory was 136.8MB in the beginning and 163.5MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.60ms. Allocated memory is still 186.6MB. Free memory was 163.5MB in the beginning and 162.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 195.77ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 152.0MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2480.91ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 151.2MB in the beginning and 81.4MB in the end (delta: 69.8MB). Peak memory consumption was 108.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: 14]: 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: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 34 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 19, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 47 NumberOfFragments, 109 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 122 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: !(50000001 <= SIZE) || i == i / 4 * 4 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 10:07:43,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...