/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/heavy-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:40,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:40,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:40,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:40,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:40,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:40,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:40,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:40,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:40,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:40,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:40,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:40,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:40,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:40,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:40,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:40,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:40,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:40,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:40,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:40,137 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:40,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:40,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:40,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:40,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:40,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:40,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:40,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:40,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:40,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:40,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:40,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:40,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:40,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:40,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:40,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:40,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:40,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:40,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:40,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:40,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:40,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:40,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:01:40,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:40,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:40,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:40,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:40,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:40,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:40,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:40,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:40,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:40,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:40,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:40,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:40,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:40,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:40,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:40,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:40,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:40,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:40,170 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:40,170 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:40,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:40,170 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:40,170 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:01:40,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:40,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:40,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:40,400 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:40,401 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:40,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-2.c [2022-04-15 12:01:40,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbe0d159/2ce793b92c8141218a2f1eefa26c8667/FLAG9237d2d93 [2022-04-15 12:01:40,754 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:40,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c [2022-04-15 12:01:40,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbe0d159/2ce793b92c8141218a2f1eefa26c8667/FLAG9237d2d93 [2022-04-15 12:01:41,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bbe0d159/2ce793b92c8141218a2f1eefa26c8667 [2022-04-15 12:01:41,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:41,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:41,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:41,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:41,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:41,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78bb421c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41, skipping insertion in model container [2022-04-15 12:01:41,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:41,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:41,341 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/heavy-2.c[600,613] [2022-04-15 12:01:41,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:41,368 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:41,380 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/heavy-2.c[600,613] [2022-04-15 12:01:41,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:41,406 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:41,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41 WrapperNode [2022-04-15 12:01:41,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:41,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:41,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:41,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:41,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:41,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:41,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:41,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:41,446 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (1/1) ... [2022-04-15 12:01:41,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:41,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:41,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:01:41,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:01:41,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:41,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:41,506 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:41,506 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 12:01:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:41,588 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:41,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:41,743 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:41,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:41,748 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 12:01:41,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:41 BoogieIcfgContainer [2022-04-15 12:01:41,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:41,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:41,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:41,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:41,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:41" (1/3) ... [2022-04-15 12:01:41,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9cedf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:41, skipping insertion in model container [2022-04-15 12:01:41,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:41" (2/3) ... [2022-04-15 12:01:41,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9cedf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:41, skipping insertion in model container [2022-04-15 12:01:41,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:41" (3/3) ... [2022-04-15 12:01:41,770 INFO L111 eAbstractionObserver]: Analyzing ICFG heavy-2.c [2022-04-15 12:01:41,775 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:41,778 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:41,823 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:41,828 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:01:41,828 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 12:01:41,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:41,844 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:41,845 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 1 times [2022-04-15 12:01:41,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:41,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1937371898] [2022-04-15 12:01:41,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1947864061, now seen corresponding path program 2 times [2022-04-15 12:01:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230717915] [2022-04-15 12:01:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-15 12:01:42,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:01:42,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-15 12:01:42,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:42,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2022-04-15 12:01:42,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:01:42,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #54#return; {22#true} is VALID [2022-04-15 12:01:42,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {22#true} is VALID [2022-04-15 12:01:42,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22#true} is VALID [2022-04-15 12:01:42,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:01:42,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 1 != ~a~0 % 4294967296; {23#false} is VALID [2022-04-15 12:01:42,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:01:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:42,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230717915] [2022-04-15 12:01:42,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230717915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:42,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:42,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:42,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:42,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1937371898] [2022-04-15 12:01:42,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1937371898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:42,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:42,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393651058] [2022-04-15 12:01:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:42,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:42,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:42,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:01:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:01:42,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:42,150 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,284 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2022-04-15 12:01:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:01:42,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 12:01:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-04-15 12:01:42,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-04-15 12:01:42,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,372 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:01:42,372 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:01:42,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:42,376 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:42,377 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:01:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2022-04-15 12:01:42,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:42,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,402 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,402 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,405 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:01:42,405 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:01:42,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:01:42,406 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:01:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,407 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 12:01:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 12:01:42,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:42,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-15 12:01:42,410 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-15 12:01:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:42,410 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-15 12:01:42,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-15 12:01:42,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 12:01:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 12:01:42,430 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:42,430 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:42,430 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:42,431 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 1 times [2022-04-15 12:01:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1999084033] [2022-04-15 12:01:42,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1947835231, now seen corresponding path program 2 times [2022-04-15 12:01:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:42,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462193951] [2022-04-15 12:01:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:42,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-15 12:01:42,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 12:01:42,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-15 12:01:42,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:42,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {190#true} is VALID [2022-04-15 12:01:42,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2022-04-15 12:01:42,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #54#return; {190#true} is VALID [2022-04-15 12:01:42,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {190#true} is VALID [2022-04-15 12:01:42,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {195#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(= main_~i~0 0)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {191#false} is VALID [2022-04-15 12:01:42,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#false} assume 1 != ~a~0 % 4294967296; {191#false} is VALID [2022-04-15 12:01:42,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {191#false} assume !false; {191#false} is VALID [2022-04-15 12:01:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:42,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462193951] [2022-04-15 12:01:42,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462193951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:42,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:42,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:42,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1999084033] [2022-04-15 12:01:42,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1999084033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:42,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:42,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343497274] [2022-04-15 12:01:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:42,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:42,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:42,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,529 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:42,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:42,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:42,532 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,634 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 12:01:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:42,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 12:01:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 12:01:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 12:01:42,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 12:01:42,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:42,677 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:01:42,677 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:01:42,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:42,680 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:42,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 20 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:01:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2022-04-15 12:01:42,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:42,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,693 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,694 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,695 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 12:01:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:01:42,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:01:42,696 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:01:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:42,698 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-15 12:01:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-15 12:01:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:42,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:42,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 12:01:42,700 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-15 12:01:42,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:42,701 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 12:01:42,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:42,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 12:01:42,720 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-15 12:01:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 12:01:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:01:42,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:42,721 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:42,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:42,721 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:42,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:42,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1310776898, now seen corresponding path program 1 times [2022-04-15 12:01:42,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:42,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1502774718] [2022-04-15 12:01:42,855 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:01:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 254700179, now seen corresponding path program 1 times [2022-04-15 12:01:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:42,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989908438] [2022-04-15 12:01:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:42,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {371#true} is VALID [2022-04-15 12:01:42,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 12:01:42,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #54#return; {371#true} is VALID [2022-04-15 12:01:42,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:42,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {371#true} is VALID [2022-04-15 12:01:42,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 12:01:42,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #54#return; {371#true} is VALID [2022-04-15 12:01:42,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {371#true} is VALID [2022-04-15 12:01:42,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {376#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 0)} [58] L12-3-->L12-4_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_1 v_main_~i~0_Out_2))) (or (and (= |v_main_#t~post4_Out_2| 1) (= v_main_~i~0_Out_2 0) (< (mod (+ v_main_~i~0_Out_2 4294967295) 4294967296) 1048576) (= v_main_~j~0_Out_2 0) .cse0 (<= 1048576 (mod v_main_~j~0_Out_2 4294967296))) .cse0)) InVars {main_~i~0=v_main_~i~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~i~0=v_main_~i~0_Out_2, main_~j~0=v_main_~j~0_Out_2} AuxVars[] AssignedVars[main_~j~0, main_#t~post4, main_~i~0] {376#(= main_~i~0 0)} is VALID [2022-04-15 12:01:42,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(= main_~i~0 0)} [57] L12-4_primed-->L12-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) 1048576)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {372#false} is VALID [2022-04-15 12:01:42,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {372#false} assume 1 != ~a~0 % 4294967296; {372#false} is VALID [2022-04-15 12:01:42,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-15 12:01:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:42,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989908438] [2022-04-15 12:01:42,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989908438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:42,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:42,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:43,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:43,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1502774718] [2022-04-15 12:01:43,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1502774718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:43,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:43,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691147978] [2022-04-15 12:01:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:01:43,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:43,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,030 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-15 12:01:43,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:43,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:43,032 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,175 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-15 12:01:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:01:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:01:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 12:01:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 12:01:43,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 12:01:43,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,234 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:01:43,234 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:01:43,235 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:01:43,237 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:43,243 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:01:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2022-04-15 12:01:43,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:43,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,247 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,247 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,249 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 12:01:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-04-15 12:01:43,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:01:43,250 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:01:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,251 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2022-04-15 12:01:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-04-15 12:01:43,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:43,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:01:43,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-15 12:01:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:43,253 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:01:43,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:01:43,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:01:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:01:43,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:43,269 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:43,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:01:43,269 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:43,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1718535333, now seen corresponding path program 1 times [2022-04-15 12:01:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:43,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [589484719] [2022-04-15 12:01:43,533 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Basisvector must contain only constants! [2022-04-15 12:01:43,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:43,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1718535333, now seen corresponding path program 2 times [2022-04-15 12:01:43,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:43,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488612655] [2022-04-15 12:01:43,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {593#true} is VALID [2022-04-15 12:01:43,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 12:01:43,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {593#true} {593#true} #54#return; {593#true} is VALID [2022-04-15 12:01:43,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:43,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {593#true} is VALID [2022-04-15 12:01:43,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-15 12:01:43,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #54#return; {593#true} is VALID [2022-04-15 12:01:43,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {593#true} is VALID [2022-04-15 12:01:43,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {593#true} is VALID [2022-04-15 12:01:43,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {593#true} is VALID [2022-04-15 12:01:43,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {593#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {598#(= main_~k~0 0)} is VALID [2022-04-15 12:01:43,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#(= main_~k~0 0)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {594#false} is VALID [2022-04-15 12:01:43,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {594#false} is VALID [2022-04-15 12:01:43,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {594#false} is VALID [2022-04-15 12:01:43,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {594#false} is VALID [2022-04-15 12:01:43,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {594#false} is VALID [2022-04-15 12:01:43,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {594#false} assume 1 != ~a~0 % 4294967296; {594#false} is VALID [2022-04-15 12:01:43,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-15 12:01:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:43,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:43,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488612655] [2022-04-15 12:01:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488612655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:43,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:43,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:43,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:43,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [589484719] [2022-04-15 12:01:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [589484719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:43,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:43,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:01:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371352110] [2022-04-15 12:01:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:01:43,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:43,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:01:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:43,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:01:43,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:01:43,617 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,685 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 12:01:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:01:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:01:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 12:01:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-04-15 12:01:43,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2022-04-15 12:01:43,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,721 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:01:43,721 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:01:43,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:43,722 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:43,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:01:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-15 12:01:43,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:43,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,735 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,735 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,736 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 12:01:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:01:43,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:01:43,737 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:01:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:43,737 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 12:01:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:01:43,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:43,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:43,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:43,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 12:01:43,739 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-15 12:01:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:43,739 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 12:01:43,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:43,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 12:01:43,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:01:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:01:43,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:43,757 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:43,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:01:43,757 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1543508103, now seen corresponding path program 1 times [2022-04-15 12:01:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:43,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1082746105] [2022-04-15 12:01:43,841 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:43,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:43,853 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:43,853 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1543508103, now seen corresponding path program 2 times [2022-04-15 12:01:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:43,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069119003] [2022-04-15 12:01:43,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:43,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {738#true} is VALID [2022-04-15 12:01:43,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 12:01:43,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {738#true} {738#true} #54#return; {738#true} is VALID [2022-04-15 12:01:43,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {745#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:01:43,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {738#true} is VALID [2022-04-15 12:01:43,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 12:01:43,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #54#return; {738#true} is VALID [2022-04-15 12:01:43,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {738#true} is VALID [2022-04-15 12:01:43,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {738#true} is VALID [2022-04-15 12:01:43,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#true} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {738#true} is VALID [2022-04-15 12:01:43,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#true} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {743#(= main_~k~0 0)} is VALID [2022-04-15 12:01:43,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {743#(= main_~k~0 0)} is VALID [2022-04-15 12:01:43,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {743#(= main_~k~0 0)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {744#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} is VALID [2022-04-15 12:01:43,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(and (not (<= (+ (div main_~k~0 4294967296) 1) 0)) (<= main_~k~0 1))} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:43,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {739#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {739#false} is VALID [2022-04-15 12:01:43,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#false} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:43,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {739#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {739#false} is VALID [2022-04-15 12:01:43,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {739#false} is VALID [2022-04-15 12:01:43,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {739#false} assume 1 != ~a~0 % 4294967296; {739#false} is VALID [2022-04-15 12:01:43,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 12:01:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:01:43,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069119003] [2022-04-15 12:01:43,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069119003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129316138] [2022-04-15 12:01:43,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:43,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:43,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:43,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:01:43,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:01:44,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 12:01:44,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:44,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 12:01:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:44,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:44,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-15 12:01:44,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~#array~0.base, ~#array~0.offset := 4, 0;call #Ultimate.allocInit(1048576, 4);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {738#true} is VALID [2022-04-15 12:01:44,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 12:01:44,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #54#return; {738#true} is VALID [2022-04-15 12:01:44,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret10 := main(#in~argc, #in~argv.base, #in~argv.offset); {738#true} is VALID [2022-04-15 12:01:44,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {764#(= main_~a~0 1)} assume !!(~i~0 % 4294967296 % 18446744073709551616 < 1048576);~j~0 := 0; {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {764#(= main_~a~0 1)} assume !!(~j~0 % 4294967296 % 18446744073709551616 < 1048576);~k~0 := 0; {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 % 18446744073709551616 < 1048576);call #t~mem7 := read~int(~#array~0.base, ~#array~0.offset + ~j~0 % 4294967296, 1);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + ~k~0 % 4294967296, 1);call write~int((if (#t~mem7 + #t~mem8) % 256 <= 127 then (#t~mem7 + #t~mem8) % 256 else (#t~mem7 + #t~mem8) % 256 - 256), ~#array~0.base, ~#array~0.offset + ~i~0 % 4294967296, 1);havoc #t~mem7;havoc #t~mem8; {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#(= main_~a~0 1)} #t~post6 := ~k~0;~k~0 := 1 + #t~post6;havoc #t~post6; {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#(= main_~a~0 1)} assume !(~k~0 % 4294967296 % 18446744073709551616 < 1048576); {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {764#(= main_~a~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#(= main_~a~0 1)} assume !(~j~0 % 4294967296 % 18446744073709551616 < 1048576); {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#(= main_~a~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {764#(= main_~a~0 1)} assume !(~i~0 % 4294967296 % 18446744073709551616 < 1048576); {764#(= main_~a~0 1)} is VALID [2022-04-15 12:01:44,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {764#(= main_~a~0 1)} assume 1 != ~a~0 % 4294967296; {739#false} is VALID [2022-04-15 12:01:44,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 12:01:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:01:44,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:01:44,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129316138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:44,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 12:01:44,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-15 12:01:44,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:44,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1082746105] [2022-04-15 12:01:44,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1082746105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:44,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:44,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504559369] [2022-04-15 12:01:44,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:01:44,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:44,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:44,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:01:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:01:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:01:44,187 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,203 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 12:01:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:01:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:01:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-15 12:01:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-04-15 12:01:44,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2022-04-15 12:01:44,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:44,218 INFO L225 Difference]: With dead ends: 18 [2022-04-15 12:01:44,218 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:01:44,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:01:44,222 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:44,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:01:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:01:44,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:44,223 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-15 12:01:44,223 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-15 12:01:44,223 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-15 12:01:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,223 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:01:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:44,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:44,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:44,223 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-15 12:01:44,224 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-15 12:01:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:44,224 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:01:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:44,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:44,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:44,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:44,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:44,224 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-15 12:01:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:01:44,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-15 12:01:44,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:44,224 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:01:44,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:44,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:01:44,225 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-15 12:01:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:44,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:44,227 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:01:44,247 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-15 12:01:44,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:44,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:01:44,494 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:01:44,494 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:01:44,495 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 7 23) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 7 23) the Hoare annotation is: true [2022-04-15 12:01:44,495 INFO L878 garLoopResultBuilder]: At program point L13-2(lines 13 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-15 12:01:44,495 INFO L878 garLoopResultBuilder]: At program point L13-3(lines 13 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-15 12:01:44,495 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: false [2022-04-15 12:01:44,496 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 7 23) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-15 12:01:44,496 INFO L878 garLoopResultBuilder]: At program point L18(lines 8 23) the Hoare annotation is: false [2022-04-15 12:01:44,496 INFO L878 garLoopResultBuilder]: At program point L14-2(lines 14 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-15 12:01:44,496 INFO L878 garLoopResultBuilder]: At program point L14-3(lines 14 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-15 12:01:44,496 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 12 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-15 12:01:44,496 INFO L878 garLoopResultBuilder]: At program point L12-3(lines 12 15) the Hoare annotation is: (= main_~a~0 1) [2022-04-15 12:01:44,496 INFO L878 garLoopResultBuilder]: At program point L12-4(lines 8 23) the Hoare annotation is: (= main_~a~0 1) [2022-04-15 12:01:44,498 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2022-04-15 12:01:44,499 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:01:44,501 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:01:44,508 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:01:44,511 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:01:44,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:01:44 BoogieIcfgContainer [2022-04-15 12:01:44,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:01:44,519 INFO L158 Benchmark]: Toolchain (without parser) took 3326.75ms. Allocated memory was 203.4MB in the beginning and 247.5MB in the end (delta: 44.0MB). Free memory was 153.4MB in the beginning and 189.3MB in the end (delta: -35.9MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,519 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 203.4MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:01:44,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.96ms. Allocated memory is still 203.4MB. Free memory was 153.2MB in the beginning and 145.7MB in the end (delta: 7.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,519 INFO L158 Benchmark]: Boogie Preprocessor took 37.50ms. Allocated memory is still 203.4MB. Free memory was 145.7MB in the beginning and 144.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,520 INFO L158 Benchmark]: RCFGBuilder took 304.03ms. Allocated memory is still 203.4MB. Free memory was 143.9MB in the beginning and 132.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:01:44,520 INFO L158 Benchmark]: TraceAbstraction took 2767.33ms. Allocated memory was 203.4MB in the beginning and 247.5MB in the end (delta: 44.0MB). Free memory was 131.6MB in the beginning and 189.3MB in the end (delta: -57.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:01:44,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 203.4MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.96ms. Allocated memory is still 203.4MB. Free memory was 153.2MB in the beginning and 145.7MB in the end (delta: 7.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.50ms. Allocated memory is still 203.4MB. Free memory was 145.7MB in the beginning and 144.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 304.03ms. Allocated memory is still 203.4MB. Free memory was 143.9MB in the beginning and 132.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2767.33ms. Allocated memory was 203.4MB in the beginning and 247.5MB in the end (delta: 44.0MB). Free memory was 131.6MB in the beginning and 189.3MB in the end (delta: -57.7MB). There was no memory consumed. 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: 21]: 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 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 71 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 35 NumberOfFragments, 50 HoareAnnotationTreeSize, 19 FomulaSimplifications, 77 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: a == 1 - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: a == 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: a == 1 - ProcedureContractResult [Line: 7]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 12:01:44,547 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...