/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:09:04,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:09:04,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:09:04,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:09:04,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:09:04,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:09:04,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:09:04,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:09:04,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:09:04,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:09:04,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:09:04,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:09:04,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:09:04,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:09:04,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:09:04,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:09:04,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:09:04,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:09:04,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:09:04,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:09:04,568 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:09:04,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:09:04,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:09:04,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:09:04,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:09:04,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:09:04,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:09:04,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:09:04,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:09:04,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:09:04,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:09:04,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:09:04,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:09:04,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:09:04,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:09:04,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:09:04,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:09:04,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:09:04,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:09:04,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:09:04,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:09:04,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:09:04,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:09:04,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:09:04,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:09:04,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:09:04,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:09:04,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:09:04,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:09:04,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:09:04,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:09:04,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:09:04,604 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:09:04,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:09:04,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:09:04,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:09:04,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:09:04,812 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:09:04,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-28 04:09:04,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799489d30/69beca87e34a4cb1aa6fae46f743f046/FLAG15807c11d [2022-04-28 04:09:05,161 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:09:05,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-28 04:09:05,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799489d30/69beca87e34a4cb1aa6fae46f743f046/FLAG15807c11d [2022-04-28 04:09:05,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799489d30/69beca87e34a4cb1aa6fae46f743f046 [2022-04-28 04:09:05,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:09:05,584 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:09:05,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:09:05,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:09:05,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:09:05,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd86927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05, skipping insertion in model container [2022-04-28 04:09:05,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:09:05,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:09:05,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-04-28 04:09:05,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:09:05,752 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:09:05,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-04-28 04:09:05,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:09:05,775 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:09:05,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05 WrapperNode [2022-04-28 04:09:05,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:09:05,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:09:05,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:09:05,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:09:05,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:09:05,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:09:05,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:09:05,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:09:05,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (1/1) ... [2022-04-28 04:09:05,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:09:05,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:09:05,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:09:05,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:09:05,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:09:05,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:09:05,925 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:09:05,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:09:05,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:09:05,925 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:09:05,925 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 04:09:05,925 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 04:09:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:09:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:09:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:09:05,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 04:09:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:09:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:09:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:09:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:09:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:09:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:09:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:09:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:09:05,978 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:09:05,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:09:06,124 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:09:06,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:09:06,129 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:09:06,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:09:06 BoogieIcfgContainer [2022-04-28 04:09:06,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:09:06,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:09:06,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:09:06,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:09:06,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:09:05" (1/3) ... [2022-04-28 04:09:06,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fa879b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:09:06, skipping insertion in model container [2022-04-28 04:09:06,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:09:05" (2/3) ... [2022-04-28 04:09:06,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15fa879b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:09:06, skipping insertion in model container [2022-04-28 04:09:06,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:09:06" (3/3) ... [2022-04-28 04:09:06,143 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.i [2022-04-28 04:09:06,152 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:09:06,152 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:09:06,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:09:06,210 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f3f2d5a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3aa07ad9 [2022-04-28 04:09:06,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:09:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:09:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:09:06,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:06,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:06,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 1 times [2022-04-28 04:09:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:06,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [145351354] [2022-04-28 04:09:06,236 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:09:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 2 times [2022-04-28 04:09:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:06,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893572066] [2022-04-28 04:09:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:06,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {24#true} is VALID [2022-04-28 04:09:06,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 04:09:06,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 04:09:06,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:06,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {24#true} is VALID [2022-04-28 04:09:06,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 04:09:06,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 04:09:06,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-28 04:09:06,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-28 04:09:06,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(0 == ~c~0 && 0 == ~i~0); {29#(<= main_~i~0 0)} is VALID [2022-04-28 04:09:06,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= main_~i~0 0)} assume !(~i~0 < 100); {25#false} is VALID [2022-04-28 04:09:06,411 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {25#false} is VALID [2022-04-28 04:09:06,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 04:09:06,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 04:09:06,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 04:09:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:06,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893572066] [2022-04-28 04:09:06,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893572066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:06,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:06,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:06,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:06,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [145351354] [2022-04-28 04:09:06,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [145351354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:06,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:06,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:06,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529275123] [2022-04-28 04:09:06,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:06,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:09:06,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:06,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:06,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:09:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:06,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:09:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:09:06,463 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:06,622 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 04:09:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:09:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:09:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-04-28 04:09:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-04-28 04:09:06,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2022-04-28 04:09:06,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:06,703 INFO L225 Difference]: With dead ends: 38 [2022-04-28 04:09:06,704 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 04:09:06,706 INFO L412 NwaCegarLoop]: 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-28 04:09:06,711 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:06,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:09:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 04:09:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 04:09:06,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:06,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,737 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,738 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:06,740 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 04:09:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:09:06,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:06,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:06,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 04:09:06,741 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 04:09:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:06,744 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 04:09:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:09:06,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:06,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:06,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:06,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 04:09:06,747 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 04:09:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:06,747 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 04:09:06,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 04:09:06,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 04:09:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 04:09:06,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:06,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:06,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:09:06,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:06,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 1 times [2022-04-28 04:09:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:06,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1594040945] [2022-04-28 04:09:06,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:09:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 2 times [2022-04-28 04:09:06,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:06,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595503205] [2022-04-28 04:09:06,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:06,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {173#true} is VALID [2022-04-28 04:09:06,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 04:09:06,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #50#return; {173#true} is VALID [2022-04-28 04:09:06,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:06,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2); {173#true} is VALID [2022-04-28 04:09:06,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 04:09:06,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #50#return; {173#true} is VALID [2022-04-28 04:09:06,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret3 := main(); {173#true} is VALID [2022-04-28 04:09:06,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {173#true} is VALID [2022-04-28 04:09:06,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {173#true} assume !!(0 == ~c~0 && 0 == ~i~0); {178#(<= 0 main_~i~0)} is VALID [2022-04-28 04:09:06,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(<= 0 main_~i~0)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {179#(<= 1 main_~i~0)} is VALID [2022-04-28 04:09:06,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#(<= 1 main_~i~0)} assume ~i~0 <= 0; {174#false} is VALID [2022-04-28 04:09:06,861 INFO L272 TraceCheckUtils]: 9: Hoare triple {174#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {174#false} is VALID [2022-04-28 04:09:06,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#false} ~cond := #in~cond; {174#false} is VALID [2022-04-28 04:09:06,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} assume 0 == ~cond; {174#false} is VALID [2022-04-28 04:09:06,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-28 04:09:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:06,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595503205] [2022-04-28 04:09:06,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595503205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:06,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:06,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:09:06,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:06,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1594040945] [2022-04-28 04:09:06,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1594040945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:06,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:06,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:09:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535794477] [2022-04-28 04:09:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:06,866 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 04:09:06,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:06,868 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:06,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:09:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:06,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:09:06,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:09:06,879 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:06,949 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:09:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:09:06,950 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 04:09:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:06,950 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 04:09:06,951 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), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 04:09:06,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-28 04:09:06,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:06,972 INFO L225 Difference]: With dead ends: 20 [2022-04-28 04:09:06,973 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 04:09:06,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:09:06,974 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:06,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:09:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 04:09:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 04:09:06,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:06,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,988 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,988 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:06,989 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:09:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:09:06,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:06,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:06,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 04:09:06,990 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 04:09:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:06,991 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:09:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:09:06,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:06,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:06,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:06,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 04:09:06,994 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 04:09:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:06,994 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 04:09:06,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:06,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 04:09:07,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:09:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:09:07,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:07,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:07,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:09:07,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash -181933682, now seen corresponding path program 1 times [2022-04-28 04:09:07,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:07,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [834199870] [2022-04-28 04:09:12,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:12,382 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:12,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1825519308, now seen corresponding path program 1 times [2022-04-28 04:09:12,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:12,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775624098] [2022-04-28 04:09:12,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:12,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:12,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:09:12,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242066179] [2022-04-28 04:09:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:12,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:09:12,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:09:12,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:09:12,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:09:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:12,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:09:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:12,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:09:57,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} call ULTIMATE.init(); {287#true} is VALID [2022-04-28 04:09:57,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#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(26, 2); {287#true} is VALID [2022-04-28 04:09:57,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume true; {287#true} is VALID [2022-04-28 04:09:57,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} #50#return; {287#true} is VALID [2022-04-28 04:09:57,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} call #t~ret3 := main(); {287#true} is VALID [2022-04-28 04:09:57,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {287#true} is VALID [2022-04-28 04:09:57,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} assume !!(0 == ~c~0 && 0 == ~i~0); {310#(and (= main_~i~0 0) (= main_~c~0 0))} is VALID [2022-04-28 04:09:57,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#(and (= main_~i~0 0) (= main_~c~0 0))} [54] L23-2-->L23-3_primed: Formula: (let ((.cse1 (= v_main_~i~0_10 v_main_~i~0_9)) (.cse2 (= v_main_~c~0_9 v_main_~c~0_8)) (.cse0 (< 0 (+ v_main_~i~0_10 1))) (.cse4 (* v_main_~i~0_10 (- 1))) (.cse5 (* (- 1) v_main_~i~0_9))) (or (and (or (not (< v_main_~i~0_10 100)) (not .cse0)) .cse1 .cse2) (let ((.cse3 (div (+ v_main_~i~0_10 .cse5 1) (- 2)))) (and (= 0 (mod (+ v_main_~i~0_10 v_main_~i~0_9 1) 2)) (< .cse3 (+ (div (+ .cse4 99) 2) 1)) (= v_main_~c~0_8 (+ v_main_~i~0_10 v_main_~c~0_9 (* 2 (* v_main_~i~0_10 .cse3)) .cse3 (* 2 (* .cse3 .cse3)))) .cse0 (<= 0 .cse3))) (and .cse1 .cse2) (let ((.cse6 (div (+ v_main_~i~0_10 .cse5) (- 2)))) (and (= (+ v_main_~c~0_8 .cse6) (+ (* 2 (* v_main_~i~0_10 .cse6)) v_main_~c~0_9 (* 2 (* .cse6 .cse6)))) .cse0 (< .cse6 (+ 2 (div (+ .cse4 98) 2))) (< 0 .cse6) (= (mod (+ v_main_~i~0_10 v_main_~i~0_9) 2) 0))))) InVars {main_~i~0=v_main_~i~0_10, main_~c~0=v_main_~c~0_9} OutVars{main_~i~0=v_main_~i~0_9, main_~c~0=v_main_~c~0_8} AuxVars[] AssignedVars[main_~i~0, main_~c~0] {314#(or (and (= 0 (mod main_~i~0 2)) (< (div (* (- 1) main_~i~0) (- 2)) 51) (= (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (+ (div (* (- 1) main_~i~0) (- 2)) main_~c~0)) (< 0 (div (* (- 1) main_~i~0) (- 2)))) (and (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (= main_~c~0 (+ (div (+ (* (- 1) main_~i~0) 1) (- 2)) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))))) (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) 50) (= (mod (+ main_~i~0 1) 2) 0)) (and (= main_~i~0 0) (= main_~c~0 0)))} is VALID [2022-04-28 04:09:57,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(or (and (= 0 (mod main_~i~0 2)) (< (div (* (- 1) main_~i~0) (- 2)) 51) (= (* (* (div (* (- 1) main_~i~0) (- 2)) (div (* (- 1) main_~i~0) (- 2))) 2) (+ (div (* (- 1) main_~i~0) (- 2)) main_~c~0)) (< 0 (div (* (- 1) main_~i~0) (- 2)))) (and (<= 0 (div (+ (* (- 1) main_~i~0) 1) (- 2))) (= main_~c~0 (+ (div (+ (* (- 1) main_~i~0) 1) (- 2)) (* 2 (* (div (+ (* (- 1) main_~i~0) 1) (- 2)) (div (+ (* (- 1) main_~i~0) 1) (- 2)))))) (< (div (+ (* (- 1) main_~i~0) 1) (- 2)) 50) (= (mod (+ main_~i~0 1) 2) 0)) (and (= main_~i~0 0) (= main_~c~0 0)))} [53] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 100)) InVars {main_~i~0=v_main_~i~0_1} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {318#(exists ((aux_div_main_~i~0_17 Int)) (and (= (+ main_~c~0 aux_div_main_~i~0_17) (* 2 (* aux_div_main_~i~0_17 aux_div_main_~i~0_17))) (<= 100 (* 2 aux_div_main_~i~0_17)) (< aux_div_main_~i~0_17 51)))} is VALID [2022-04-28 04:09:57,871 INFO L272 TraceCheckUtils]: 9: Hoare triple {318#(exists ((aux_div_main_~i~0_17 Int)) (and (= (+ main_~c~0 aux_div_main_~i~0_17) (* 2 (* aux_div_main_~i~0_17 aux_div_main_~i~0_17))) (<= 100 (* 2 aux_div_main_~i~0_17)) (< aux_div_main_~i~0_17 51)))} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:09:57,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:09:57,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {288#false} is VALID [2022-04-28 04:09:57,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-04-28 04:09:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:57,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:09:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:57,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775624098] [2022-04-28 04:09:57,873 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:09:57,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242066179] [2022-04-28 04:09:57,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242066179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:57,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:57,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:10:02,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:02,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [834199870] [2022-04-28 04:10:02,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [834199870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:02,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:02,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:10:02,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953102260] [2022-04-28 04:10:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:10:02,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:02,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:02,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:02,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:10:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:10:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:10:02,557 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:04,568 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:10:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:10:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:10:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-28 04:10:04,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2022-04-28 04:10:04,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2022-04-28 04:10:05,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:05,050 INFO L225 Difference]: With dead ends: 15 [2022-04-28 04:10:05,050 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:10:05,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:10:05,051 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:05,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 9 Unchecked, 0.6s Time] [2022-04-28 04:10:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:10:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:10:05,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:05,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:10:05,052 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:10:05,052 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:10:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:10:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:10:05,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:05,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:05,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:10:05,053 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:10:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:10:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:10:05,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:05,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:05,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:05,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:10:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:10:05,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-28 04:10:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:05,054 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:10:05,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:10:05,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:10:05,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:05,066 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:10:05,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:10:05,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:10:05,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:10:07,133 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 04:10:07,133 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 04:10:07,133 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 04:10:07,134 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-28 04:10:07,134 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 04:10:07,134 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (< main_~i~0 101) (let ((.cse1 (* (- 1) main_~i~0))) (or (and (= 0 (mod main_~i~0 2)) (= (let ((.cse0 (div (+ .cse1 2) (- 2)))) (+ main_~i~0 .cse0 (* (* .cse0 .cse0) 2))) (+ main_~c~0 1))) (and (let ((.cse2 (div (+ .cse1 1) (- 2)))) (= (+ main_~c~0 .cse2 1) (+ main_~i~0 (* 2 (* .cse2 .cse2))))) (= (mod (+ main_~i~0 1) 2) 0)))) (<= 1 main_~i~0)) [2022-04-28 04:10:07,134 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2022-04-28 04:10:07,134 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-28 04:10:07,134 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (or (and (< main_~i~0 101) (let ((.cse1 (* (- 1) main_~i~0))) (or (and (= 0 (mod main_~i~0 2)) (= (let ((.cse0 (div (+ .cse1 2) (- 2)))) (+ main_~i~0 .cse0 (* (* .cse0 .cse0) 2))) (+ main_~c~0 1))) (and (let ((.cse2 (div (+ .cse1 1) (- 2)))) (= (+ main_~c~0 .cse2 1) (+ main_~i~0 (* 2 (* .cse2 .cse2))))) (= (mod (+ main_~i~0 1) 2) 0)))) (<= 1 main_~i~0)) (and (<= main_~i~0 0) (<= 0 main_~i~0) (= main_~c~0 0))) [2022-04-28 04:10:07,134 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (and (exists ((aux_div_main_~i~0_17 Int)) (and (= (+ main_~c~0 aux_div_main_~i~0_17) (* 2 (* aux_div_main_~i~0_17 aux_div_main_~i~0_17))) (<= 100 (* 2 aux_div_main_~i~0_17)) (< aux_div_main_~i~0_17 51))) (= (let ((.cse0 (div (+ (* (- 1) main_~i~0) 2) (- 2)))) (+ main_~i~0 .cse0 (* (* .cse0 .cse0) 2))) (+ main_~c~0 1))) [2022-04-28 04:10:07,134 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2022-04-28 04:10:07,134 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:10:07,134 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 04:10:07,134 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:10:07,135 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 04:10:07,135 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-28 04:10:07,135 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:10:07,138 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-28 04:10:07,143 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:10:07,147 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:10:07,147 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:10:07,148 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 04:10:07,349 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-28 04:10:07,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:10:07 BoogieIcfgContainer [2022-04-28 04:10:07,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:10:07,364 INFO L158 Benchmark]: Toolchain (without parser) took 61779.85ms. Allocated memory was 238.0MB in the beginning and 287.3MB in the end (delta: 49.3MB). Free memory was 185.1MB in the beginning and 167.2MB in the end (delta: 18.0MB). Peak memory consumption was 68.0MB. Max. memory is 8.0GB. [2022-04-28 04:10:07,366 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 238.0MB. Free memory is still 201.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:10:07,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.71ms. Allocated memory is still 238.0MB. Free memory was 184.9MB in the beginning and 210.5MB in the end (delta: -25.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-28 04:10:07,366 INFO L158 Benchmark]: Boogie Preprocessor took 30.29ms. Allocated memory is still 238.0MB. Free memory was 210.5MB in the beginning and 208.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:10:07,367 INFO L158 Benchmark]: RCFGBuilder took 322.60ms. Allocated memory is still 238.0MB. Free memory was 208.9MB in the beginning and 198.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:10:07,367 INFO L158 Benchmark]: TraceAbstraction took 61232.38ms. Allocated memory was 238.0MB in the beginning and 287.3MB in the end (delta: 49.3MB). Free memory was 197.9MB in the beginning and 167.2MB in the end (delta: 30.8MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. [2022-04-28 04:10:07,368 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 238.0MB. Free memory is still 201.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.71ms. Allocated memory is still 238.0MB. Free memory was 184.9MB in the beginning and 210.5MB in the end (delta: -25.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.29ms. Allocated memory is still 238.0MB. Free memory was 210.5MB in the beginning and 208.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 322.60ms. Allocated memory is still 238.0MB. Free memory was 208.9MB in the beginning and 198.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 61232.38ms. Allocated memory was 238.0MB in the beginning and 287.3MB in the end (delta: 49.3MB). Free memory was 197.9MB in the beginning and 167.2MB in the end (delta: 30.8MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: 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 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 42 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 33 PreInvPairs, 47 NumberOfFragments, 262 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 160 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((i < 101 && ((0 == i % 2 && i + (-1 * i + 2) / -2 + (-1 * i + 2) / -2 * ((-1 * i + 2) / -2) * 2 == c + 1) || (c + (-1 * i + 1) / -2 + 1 == i + 2 * ((-1 * i + 1) / -2 * ((-1 * i + 1) / -2)) && (i + 1) % 2 == 0))) && 1 <= i) || ((i <= 0 && 0 <= i) && c == 0) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 04:10:07,415 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...