/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/vnew1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:13:13,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:13:13,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:13:13,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:13:13,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:13:13,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:13:13,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:13:13,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:13:13,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:13:13,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:13:13,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:13:13,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:13:13,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:13:13,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:13:13,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:13:13,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:13:13,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:13:13,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:13:13,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:13:13,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:13:13,183 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:13:13,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:13:13,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:13:13,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:13:13,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:13:13,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:13:13,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:13:13,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:13:13,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:13:13,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:13:13,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:13:13,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:13:13,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:13:13,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:13:13,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:13:13,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:13:13,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:13:13,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:13:13,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:13:13,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:13:13,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:13:13,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:13:13,201 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 13:13:13,207 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:13:13,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:13:13,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:13:13,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:13:13,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:13:13,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:13:13,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:13:13,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:13:13,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:13:13,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:13:13,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:13:13,209 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:13:13,210 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:13:13,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:13:13,210 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:13:13,210 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 13:13:13,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:13:13,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:13:13,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:13:13,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:13:13,394 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:13:13,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew1.c [2022-04-15 13:13:13,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d1d6db/b155016dbfcc40ac8e0e210c72598135/FLAG74e6fb2cb [2022-04-15 13:13:13,809 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:13:13,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew1.c [2022-04-15 13:13:13,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d1d6db/b155016dbfcc40ac8e0e210c72598135/FLAG74e6fb2cb [2022-04-15 13:13:13,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d1d6db/b155016dbfcc40ac8e0e210c72598135 [2022-04-15 13:13:13,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:13:13,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:13:13,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:13:13,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:13:13,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:13:13,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:13,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d93d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13, skipping insertion in model container [2022-04-15 13:13:13,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:13,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:13:13,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:13:13,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew1.c[403,416] [2022-04-15 13:13:13,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:13:13,967 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:13:13,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew1.c[403,416] [2022-04-15 13:13:13,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:13:13,989 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:13:13,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13 WrapperNode [2022-04-15 13:13:13,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:13:13,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:13:13,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:13:13,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:13:13,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:13,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:14,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:14,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:14,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:14,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:14,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:14,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:13:14,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:13:14,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:13:14,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:13:14,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (1/1) ... [2022-04-15 13:13:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:13:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:14,033 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 13:13:14,034 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 13:13:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:13:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:13:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:13:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:13:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:13:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:13:14,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:13:14,059 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:13:14,059 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:13:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:13:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:13:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:13:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 13:13:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:13:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:13:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:13:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:13:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:13:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:13:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:13:14,106 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:13:14,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:13:14,250 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:13:14,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:13:14,254 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:13:14,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:13:14 BoogieIcfgContainer [2022-04-15 13:13:14,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:13:14,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:13:14,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:13:14,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:13:14,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:13:13" (1/3) ... [2022-04-15 13:13:14,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2779f725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:13:14, skipping insertion in model container [2022-04-15 13:13:14,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:13:13" (2/3) ... [2022-04-15 13:13:14,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2779f725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:13:14, skipping insertion in model container [2022-04-15 13:13:14,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:13:14" (3/3) ... [2022-04-15 13:13:14,280 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew1.c [2022-04-15 13:13:14,283 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:13:14,283 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:13:14,315 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:13:14,319 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 13:13:14,319 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:13:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 13:13:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:13:14,335 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:14,335 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:14,336 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash 486508050, now seen corresponding path program 1 times [2022-04-15 13:13:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:14,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049153449] [2022-04-15 13:13:14,351 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:13:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 486508050, now seen corresponding path program 2 times [2022-04-15 13:13:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:14,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488445543] [2022-04-15 13:13:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:14,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:14,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:14,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-15 13:13:14,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 13:13:14,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #63#return; {26#true} is VALID [2022-04-15 13:13:14,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:14,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-15 13:13:14,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-15 13:13:14,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #63#return; {26#true} is VALID [2022-04-15 13:13:14,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret8 := main(); {26#true} is VALID [2022-04-15 13:13:14,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {26#true} is VALID [2022-04-15 13:13:14,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := ~n~0;~i~0 := 0; {31#(= main_~i~0 0)} is VALID [2022-04-15 13:13:14,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {32#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-15 13:13:14,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} ~j~0 := 0; {33#(and (<= (+ (* (div main_~j~0 4294967296) 12884901888) main_~n~0) (+ (* (div main_~n~0 4294967296) 4294967296) (* (div (div (+ main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) 3) 4294967296) 12884901888))) (= main_~j~0 0))} is VALID [2022-04-15 13:13:14,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(and (<= (+ (* (div main_~j~0 4294967296) 12884901888) main_~n~0) (+ (* (div main_~n~0 4294967296) 4294967296) (* (div (div (+ main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) 3) 4294967296) 12884901888))) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < (if ~n~0 % 4294967296 < 0 && 0 != ~n~0 % 4294967296 % 3 then 1 + ~n~0 % 4294967296 / 3 else ~n~0 % 4294967296 / 3) % 4294967296); {27#false} is VALID [2022-04-15 13:13:14,589 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert((if ~k~0 % 4294967296 > 0 then 1 else 0)); {27#false} is VALID [2022-04-15 13:13:14,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-15 13:13:14,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-15 13:13:14,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-15 13:13:14,590 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 13:13:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:14,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488445543] [2022-04-15 13:13:14,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488445543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:14,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:14,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:13:14,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:14,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049153449] [2022-04-15 13:13:14,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049153449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:14,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:14,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:13:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343995801] [2022-04-15 13:13:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:14,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:13:14,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:14,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:14,615 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-15 13:13:14,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:13:14,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:13:14,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:13:14,634 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 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 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:14,967 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-15 13:13:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:13:14,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:13:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-15 13:13:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-15 13:13:14,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-15 13:13:15,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:15,032 INFO L225 Difference]: With dead ends: 44 [2022-04-15 13:13:15,032 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:13:15,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:13:15,038 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:15,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:13:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:13:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:13:15,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:15,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:13:15,096 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:13:15,097 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:13:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:15,103 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 13:13:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 13:13:15,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:15,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:15,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 13:13:15,105 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 13:13:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:15,109 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-15 13:13:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 13:13:15,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:15,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:15,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:15,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:13:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 13:13:15,114 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-15 13:13:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:15,114 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 13:13:15,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:15,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-15 13:13:15,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 13:13:15,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:13:15,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:15,141 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:15,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:13:15,141 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 77944193, now seen corresponding path program 1 times [2022-04-15 13:13:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878278458] [2022-04-15 13:13:15,362 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:13:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 735147586, now seen corresponding path program 1 times [2022-04-15 13:13:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:15,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890606481] [2022-04-15 13:13:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:15,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:15,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:13:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:15,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:13:15,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:13:15,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {207#true} #63#return; {212#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:13:15,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {218#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:13:15,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:13:15,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:13:15,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {207#true} #63#return; {212#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:13:15,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret8 := main(); {212#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:13:15,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {213#(and (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:13:15,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(and (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := ~n~0;~i~0 := 0; {214#(and (= main_~i~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)))} is VALID [2022-04-15 13:13:15,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {214#(and (= main_~i~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)))} [67] L22-2-->L22-3_primed: Formula: (or (and (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~i~0_In_1 v_main_~i~0_Out_2) (= v_main_~k~0_In_1 v_main_~k~0_Out_2)) (and (< (mod (+ v_main_~i~0_Out_2 4294967293) 4294967296) (mod v_main_~n~0_In_1 4294967296)) (= (+ v_main_~i~0_Out_2 (* 3 v_main_~k~0_Out_2)) (+ v_main_~i~0_In_1 (* 3 v_main_~k~0_In_1))) (= |v_main_#t~post5_Out_2| 0) (<= v_main_~k~0_Out_2 v_main_~k~0_In_1) (= v_main_~n~0_In_1 0))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_#t~post5=|v_main_#t~post5_Out_2|, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~0_Out_2} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post5] {215#(or (= main_~i~0 0) (and (<= 0 (div main_~n~0 4294967296)) (<= main_~n~0 0)))} is VALID [2022-04-15 13:13:15,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(or (= main_~i~0 0) (and (<= 0 (div main_~n~0 4294967296)) (<= main_~n~0 0)))} [66] L22-3_primed-->L22-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {216#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-15 13:13:15,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {216#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} ~j~0 := 0; {217#(and (= main_~j~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-15 13:13:15,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {217#(and (= main_~j~0 0) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} assume !!(~j~0 % 4294967296 < (if ~n~0 % 4294967296 < 0 && 0 != ~n~0 % 4294967296 % 3 then 1 + ~n~0 % 4294967296 / 3 else ~n~0 % 4294967296 / 3) % 4294967296); {208#false} is VALID [2022-04-15 13:13:15,696 INFO L272 TraceCheckUtils]: 11: Hoare triple {208#false} call __VERIFIER_assert((if ~k~0 % 4294967296 > 0 then 1 else 0)); {208#false} is VALID [2022-04-15 13:13:15,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2022-04-15 13:13:15,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {208#false} assume 0 == ~cond; {208#false} is VALID [2022-04-15 13:13:15,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {208#false} assume !false; {208#false} is VALID [2022-04-15 13:13:15,696 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 13:13:15,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890606481] [2022-04-15 13:13:15,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890606481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:15,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:15,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:13:15,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:15,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878278458] [2022-04-15 13:13:15,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878278458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:15,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:15,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:13:15,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957126755] [2022-04-15 13:13:15,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:15,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 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) Word has length 15 [2022-04-15 13:13:15,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:15,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 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-15 13:13:15,764 WARN L143 InductivityCheck]: Transition 220#(and (= (+ main_~i~0 (- 3)) 0) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0))) ( _ , assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); , 216#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) ) not inductive [2022-04-15 13:13:15,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:13:15,764 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 13:13:15,767 INFO L158 Benchmark]: Toolchain (without parser) took 1942.51ms. Allocated memory was 175.1MB in the beginning and 229.6MB in the end (delta: 54.5MB). Free memory was 121.4MB in the beginning and 143.3MB in the end (delta: -21.9MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2022-04-15 13:13:15,768 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory was 137.7MB in the beginning and 137.6MB in the end (delta: 68.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:13:15,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.26ms. Allocated memory was 175.1MB in the beginning and 229.6MB in the end (delta: 54.5MB). Free memory was 121.3MB in the beginning and 204.9MB in the end (delta: -83.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 13:13:15,768 INFO L158 Benchmark]: Boogie Preprocessor took 17.74ms. Allocated memory is still 229.6MB. Free memory was 204.9MB in the beginning and 203.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:13:15,768 INFO L158 Benchmark]: RCFGBuilder took 251.64ms. Allocated memory is still 229.6MB. Free memory was 203.3MB in the beginning and 191.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:13:15,769 INFO L158 Benchmark]: TraceAbstraction took 1496.91ms. Allocated memory is still 229.6MB. Free memory was 191.0MB in the beginning and 143.3MB in the end (delta: 47.7MB). Peak memory consumption was 47.3MB. Max. memory is 8.0GB. [2022-04-15 13:13:15,770 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 175.1MB. Free memory was 137.7MB in the beginning and 137.6MB in the end (delta: 68.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.26ms. Allocated memory was 175.1MB in the beginning and 229.6MB in the end (delta: 54.5MB). Free memory was 121.3MB in the beginning and 204.9MB in the end (delta: -83.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.74ms. Allocated memory is still 229.6MB. Free memory was 204.9MB in the beginning and 203.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 251.64ms. Allocated memory is still 229.6MB. Free memory was 203.3MB in the beginning and 191.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1496.91ms. Allocated memory is still 229.6MB. Free memory was 191.0MB in the beginning and 143.3MB in the end (delta: 47.7MB). Peak memory consumption was 47.3MB. 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 13:13:15,781 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...