/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/sum03-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:03:19,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:03:19,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:03:19,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:03:19,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:03:19,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:03:19,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:03:19,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:03:19,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:03:19,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:03:19,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:03:19,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:03:19,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:03:19,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:03:19,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:03:19,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:03:19,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:03:19,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:03:19,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:03:19,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:03:19,850 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:03:19,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:03:19,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:03:19,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:03:19,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:03:19,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:03:19,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:03:19,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:03:19,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:03:19,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:03:19,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:03:19,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:03:19,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:03:19,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:03:19,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:03:19,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:03:19,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:03:19,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:03:19,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:03:19,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:03:19,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:03:19,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:03:19,861 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:03:19,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:03:19,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:03:19,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:03:19,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:03:19,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:03:19,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:03:19,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:03:19,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:03:19,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:19,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:03:19,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:03:19,870 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:03:19,871 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:03:19,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:03:19,871 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:03:19,871 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:03:20,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:03:20,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:03:20,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:03:20,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:03:20,096 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:03:20,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03-1.i [2022-04-15 12:03:20,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691c5c81b/77198c185ac04afab2b02e7f8a9ec217/FLAG817ff4466 [2022-04-15 12:03:20,506 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:03:20,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03-1.i [2022-04-15 12:03:20,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691c5c81b/77198c185ac04afab2b02e7f8a9ec217/FLAG817ff4466 [2022-04-15 12:03:20,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691c5c81b/77198c185ac04afab2b02e7f8a9ec217 [2022-04-15 12:03:20,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:03:20,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:03:20,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:20,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:03:20,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:03:20,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1102d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20, skipping insertion in model container [2022-04-15 12:03:20,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:03:20,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:03:20,734 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/sum03-1.i[807,820] [2022-04-15 12:03:20,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:20,764 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:03:20,777 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/sum03-1.i[807,820] [2022-04-15 12:03:20,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:20,788 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:03:20,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20 WrapperNode [2022-04-15 12:03:20,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:20,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:03:20,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:03:20,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:03:20,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:03:20,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:03:20,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:03:20,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:03:20,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (1/1) ... [2022-04-15 12:03:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:20,856 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:03:20,876 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:03:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:03:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:03:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:03:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:03:20,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:03:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:03:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:03:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:03:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:03:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:03:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:03:20,935 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:03:20,936 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:03:21,075 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:03:21,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:03:21,083 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:03:21,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:21 BoogieIcfgContainer [2022-04-15 12:03:21,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:03:21,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:03:21,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:03:21,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:03:21,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:03:20" (1/3) ... [2022-04-15 12:03:21,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f308d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:21, skipping insertion in model container [2022-04-15 12:03:21,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:20" (2/3) ... [2022-04-15 12:03:21,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f308d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:21, skipping insertion in model container [2022-04-15 12:03:21,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:21" (3/3) ... [2022-04-15 12:03:21,093 INFO L111 eAbstractionObserver]: Analyzing ICFG sum03-1.i [2022-04-15 12:03:21,096 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:03:21,096 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:03:21,134 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:03:21,140 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:03:21,140 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:03:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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-15 12:03:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:03:21,161 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:21,162 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:21,162 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 1 times [2022-04-15 12:03:21,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:21,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [559023547] [2022-04-15 12:03:21,181 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:03:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1946695220, now seen corresponding path program 2 times [2022-04-15 12:03:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:21,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750437246] [2022-04-15 12:03:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:21,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(10, 2); {23#true} is VALID [2022-04-15 12:03:21,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:03:21,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-15 12:03:21,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:21,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(10, 2); {23#true} is VALID [2022-04-15 12:03:21,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:03:21,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2022-04-15 12:03:21,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret4 := main(); {23#true} is VALID [2022-04-15 12:03:21,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 12:03:21,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume !false; {28#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 12:03:21,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(and (= main_~sn~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-15 12:03:21,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(and (= main_~x~0 0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-15 12:03:21,664 INFO L272 TraceCheckUtils]: 9: Hoare triple {30#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:21,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:21,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-15 12:03:21,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 12:03:21,668 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:03:21,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:21,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750437246] [2022-04-15 12:03:21,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750437246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:21,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:21,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:03:21,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [559023547] [2022-04-15 12:03:21,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [559023547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:21,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:21,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:03:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276382155] [2022-04-15 12:03:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-15 12:03:21,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:21,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-15 12:03:21,708 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-15 12:03:21,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:03:21,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:21,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:03:21,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:03:21,731 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 14 states have internal predecessors, (17), 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 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-15 12:03:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:22,124 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2022-04-15 12:03:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:03:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-15 12:03:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-15 12:03:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-15 12:03:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-15 12:03:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-15 12:03:22,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-15 12:03:22,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:22,227 INFO L225 Difference]: With dead ends: 41 [2022-04-15 12:03:22,228 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:03:22,230 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:03:22,232 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:22,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:03:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-04-15 12:03:22,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:22,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:22,262 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:22,262 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:22,264 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:03:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:03:22,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:22,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:22,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 12:03:22,265 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 12:03:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:22,267 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:03:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:03:22,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:22,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:22,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:22,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:03:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-04-15 12:03:22,271 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 13 [2022-04-15 12:03:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:22,271 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-04-15 12:03:22,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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-15 12:03:22,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 25 transitions. [2022-04-15 12:03:22,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-04-15 12:03:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:03:22,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:22,295 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:22,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:03:22,295 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1052577873, now seen corresponding path program 1 times [2022-04-15 12:03:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:22,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903463539] [2022-04-15 12:03:23,055 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1030477041, now seen corresponding path program 1 times [2022-04-15 12:03:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:23,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86939286] [2022-04-15 12:03:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:23,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {243#(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(10, 2); {232#true} is VALID [2022-04-15 12:03:23,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-15 12:03:23,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-15 12:03:23,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {243#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:23,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(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(10, 2); {232#true} is VALID [2022-04-15 12:03:23,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-15 12:03:23,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #48#return; {232#true} is VALID [2022-04-15 12:03:23,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret4 := main(); {232#true} is VALID [2022-04-15 12:03:23,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} ~sn~0 := 0;~loop1~0 := #t~nondet1;havoc #t~nondet1;~n1~0 := #t~nondet2;havoc #t~nondet2;~x~0 := 0; {237#(and (= main_~sn~0 0) (= main_~x~0 0))} is VALID [2022-04-15 12:03:23,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(and (= main_~sn~0 0) (= main_~x~0 0))} [52] L29-1-->L25_primed: Formula: (or (and (= v_main_~sn~0_In_1 v_main_~sn~0_Out_2) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (let ((.cse0 (* (- 1) v_main_~sn~0_In_1)) (.cse1 (* v_main_~x~0_Out_2 2))) (and (<= 0 (div (+ .cse0 v_main_~sn~0_Out_2) 2)) (= (mod (+ v_main_~sn~0_In_1 v_main_~sn~0_Out_2) 2) 0) (= (* |v_main_#t~post3_Out_2| 2) 0) (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 10) (= (+ (* (- 1) v_main_~sn~0_Out_2) .cse1) (+ .cse0 (* v_main_~x~0_In_1 2))) (or (= (mod v_main_~sn~0_Out_2 4294967296) (mod .cse1 4294967296)) (= v_main_~sn~0_Out_2 0))))) InVars {main_~sn~0=v_main_~sn~0_In_1, main_~x~0=v_main_~x~0_In_1} OutVars{main_#t~post3=|v_main_#t~post3_Out_2|, main_~sn~0=v_main_~sn~0_Out_2, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~sn~0, main_~x~0, main_#t~post3] {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-15 12:03:23,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} [51] L25_primed-->L25: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-15 12:03:23,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2)))} assume ~x~0 % 4294967296 < 10;~sn~0 := 2 + ~sn~0; {239#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} is VALID [2022-04-15 12:03:23,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#(and (<= main_~sn~0 (+ (* main_~x~0 2) 2)) (<= (+ (* main_~x~0 2) 2) main_~sn~0))} #t~post3 := ~x~0;~x~0 := 1 + #t~post3;havoc #t~post3; {240#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} is VALID [2022-04-15 12:03:23,279 INFO L272 TraceCheckUtils]: 10: Hoare triple {240#(and (<= (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296))) (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296))) (< (+ (* main_~x~0 2) (* (div main_~sn~0 4294967296) 4294967296)) (+ main_~sn~0 (* 4294967296 (div (* main_~x~0 2) 4294967296)) 1)) (<= main_~sn~0 (* main_~x~0 2)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == 2 * ~x~0 % 4294967296 || 0 == ~sn~0 then 1 else 0)); {241#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:03:23,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {241#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {242#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:03:23,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {242#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {233#false} is VALID [2022-04-15 12:03:23,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-15 12:03:23,281 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:03:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:23,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86939286] [2022-04-15 12:03:23,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86939286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:23,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:23,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:03:26,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:26,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903463539] [2022-04-15 12:03:26,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903463539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:26,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:26,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:03:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315361385] [2022-04-15 12:03:26,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:26,754 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 12:03:26,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:26,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.25) internal successors, (15), 10 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:03:32,444 WARN L143 InductivityCheck]: Transition 249#(exists ((aux_mod_v_main_~x~0_BEFORE_CALL_2_57 Int) (v_main_~sn~0_BEFORE_CALL_2 Int) (v___VERIFIER_assert_~cond_BEFORE_RETURN_2 Int)) (and (< aux_mod_v_main_~x~0_BEFORE_CALL_2_57 10) (or (and (< (mod (+ aux_mod_v_main_~x~0_BEFORE_CALL_2_57 4294967295) 4294967296) 10) (<= 0 (div (+ (- 2) v_main_~sn~0_BEFORE_CALL_2) 2)) (exists ((aux_div_v_main_~x~0_BEFORE_CALL_2_57 Int)) (= (+ (* aux_mod_v_main_~x~0_BEFORE_CALL_2_57 2) (* 8589934592 aux_div_v_main_~x~0_BEFORE_CALL_2_57)) (+ v_main_~sn~0_BEFORE_CALL_2 8589934590)))) (and (exists ((aux_div_v_main_~x~0_BEFORE_CALL_2_57 Int)) (= (+ aux_mod_v_main_~x~0_BEFORE_CALL_2_57 (* 4294967296 aux_div_v_main_~x~0_BEFORE_CALL_2_57)) 4294967296)) (= 2 v_main_~sn~0_BEFORE_CALL_2))) (or (and (or (= (mod (+ (* aux_mod_v_main_~x~0_BEFORE_CALL_2_57 2) 2) 4294967296) (mod v_main_~sn~0_BEFORE_CALL_2 4294967296)) (= v_main_~sn~0_BEFORE_CALL_2 0)) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1)) (and (not (= v_main_~sn~0_BEFORE_CALL_2 0)) (not (= (mod (+ (* aux_mod_v_main_~x~0_BEFORE_CALL_2_57 2) 2) 4294967296) (mod v_main_~sn~0_BEFORE_CALL_2 4294967296))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))) (or (and (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 1) (or (= main_~sn~0 0) (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296)))) (and (not (= main_~sn~0 0)) (not (= (mod main_~sn~0 4294967296) (mod (* main_~x~0 2) 4294967296))) (= v___VERIFIER_assert_~cond_BEFORE_RETURN_2 0))) (<= 0 aux_mod_v_main_~x~0_BEFORE_CALL_2_57))) ( _ , assume !false; , 238#(and (<= (* main_~x~0 2) main_~sn~0) (<= main_~sn~0 (* main_~x~0 2))) ) not inductive [2022-04-15 12:03:32,445 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:03:32,446 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:03:32,452 INFO L158 Benchmark]: Toolchain (without parser) took 11919.41ms. Allocated memory was 181.4MB in the beginning and 252.7MB in the end (delta: 71.3MB). Free memory was 123.3MB in the beginning and 107.9MB in the end (delta: 15.4MB). Peak memory consumption was 85.9MB. Max. memory is 8.0GB. [2022-04-15 12:03:32,453 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:32,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.56ms. Allocated memory was 181.4MB in the beginning and 252.7MB in the end (delta: 71.3MB). Free memory was 123.1MB in the beginning and 224.0MB in the end (delta: -100.8MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:32,454 INFO L158 Benchmark]: Boogie Preprocessor took 33.81ms. Allocated memory is still 252.7MB. Free memory was 223.5MB in the beginning and 222.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:32,457 INFO L158 Benchmark]: RCFGBuilder took 261.24ms. Allocated memory is still 252.7MB. Free memory was 222.4MB in the beginning and 211.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:03:32,457 INFO L158 Benchmark]: TraceAbstraction took 11363.76ms. Allocated memory is still 252.7MB. Free memory was 210.9MB in the beginning and 107.9MB in the end (delta: 103.0MB). Peak memory consumption was 104.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:32,459 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.56ms. Allocated memory was 181.4MB in the beginning and 252.7MB in the end (delta: 71.3MB). Free memory was 123.1MB in the beginning and 224.0MB in the end (delta: -100.8MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.81ms. Allocated memory is still 252.7MB. Free memory was 223.5MB in the beginning and 222.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 261.24ms. Allocated memory is still 252.7MB. Free memory was 222.4MB in the beginning and 211.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11363.76ms. Allocated memory is still 252.7MB. Free memory was 210.9MB in the beginning and 107.9MB in the end (delta: 103.0MB). Peak memory consumption was 104.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:03:32,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...