/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_trans.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:11:30,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:11:30,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:11:30,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:11:30,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:11:30,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:11:30,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:11:30,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:11:30,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:11:30,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:11:30,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:11:30,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:11:30,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:11:30,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:11:30,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:11:30,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:11:30,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:11:30,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:11:30,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:11:30,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:11:30,106 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:11:30,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:11:30,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:11:30,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:11:30,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:11:30,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:11:30,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:11:30,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:11:30,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:11:30,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:11:30,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:11:30,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:11:30,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:11:30,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:11:30,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:11:30,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:11:30,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:11:30,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:11:30,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:11:30,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:11:30,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:11:30,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:11:30,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:11:30,139 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:11:30,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:11:30,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:11:30,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:11:30,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:11:30,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:11:30,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:11:30,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:11:30,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:11:30,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:11:30,142 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:11:30,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:11:30,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:11:30,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:11:30,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:11:30,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:11:30,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:30,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:11:30,143 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:11:30,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:11:30,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:11:30,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:11:30,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:11:30,391 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:11:30,392 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_trans.i [2022-04-28 03:11:30,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e380d7d6d/c62c910d7cb0433a9c737df240fd50bf/FLAG6b56c1dd3 [2022-04-28 03:11:30,847 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:11:30,848 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans.i [2022-04-28 03:11:30,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e380d7d6d/c62c910d7cb0433a9c737df240fd50bf/FLAG6b56c1dd3 [2022-04-28 03:11:30,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e380d7d6d/c62c910d7cb0433a9c737df240fd50bf [2022-04-28 03:11:30,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:11:30,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:11:30,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:30,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:11:30,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:11:30,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:30" (1/1) ... [2022-04-28 03:11:30,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609162e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:30, skipping insertion in model container [2022-04-28 03:11:30,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:11:30" (1/1) ... [2022-04-28 03:11:30,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:11:30,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:11:31,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans.i[893,906] [2022-04-28 03:11:31,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:31,089 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:11:31,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans.i[893,906] [2022-04-28 03:11:31,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:11:31,116 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:11:31,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31 WrapperNode [2022-04-28 03:11:31,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:11:31,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:11:31,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:11:31,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:11:31,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:11:31,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:11:31,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:11:31,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:11:31,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (1/1) ... [2022-04-28 03:11:31,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:11:31,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:31,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:11:31,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:11:31,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:11:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:11:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:11:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:11:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:11:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:11:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:11:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:11:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:11:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:11:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:11:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:11:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:11:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:11:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:11:31,254 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:11:31,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:11:31,496 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:11:31,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:11:31,502 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:11:31,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:31 BoogieIcfgContainer [2022-04-28 03:11:31,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:11:31,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:11:31,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:11:31,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:11:31,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:11:30" (1/3) ... [2022-04-28 03:11:31,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a61b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:31, skipping insertion in model container [2022-04-28 03:11:31,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:11:31" (2/3) ... [2022-04-28 03:11:31,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a61b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:11:31, skipping insertion in model container [2022-04-28 03:11:31,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:11:31" (3/3) ... [2022-04-28 03:11:31,510 INFO L111 eAbstractionObserver]: Analyzing ICFG id_trans.i [2022-04-28 03:11:31,523 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:11:31,524 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:11:31,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:11:31,566 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6185ccf2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a68f5e1 [2022-04-28 03:11:31,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:11:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 03:11:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:11:31,579 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:31,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:31,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1515419822, now seen corresponding path program 1 times [2022-04-28 03:11:31,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:31,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1455758707] [2022-04-28 03:11:31,604 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1515419822, now seen corresponding path program 2 times [2022-04-28 03:11:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:31,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971752674] [2022-04-28 03:11:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:31,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:31,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:31,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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(9, 2); {27#true} is VALID [2022-04-28 03:11:31,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:11:31,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #64#return; {27#true} is VALID [2022-04-28 03:11:31,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:31,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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(9, 2); {27#true} is VALID [2022-04-28 03:11:31,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:11:31,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #64#return; {27#true} is VALID [2022-04-28 03:11:31,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-28 03:11:31,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~material_length~0 := #t~nondet3;havoc #t~nondet3; {27#true} is VALID [2022-04-28 03:11:31,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32));~j~0 := 0; {32#(<= 0 main_~j~0)} is VALID [2022-04-28 03:11:31,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(<= 0 main_~j~0)} assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); {32#(<= 0 main_~j~0)} is VALID [2022-04-28 03:11:31,936 INFO L272 TraceCheckUtils]: 8: Hoare triple {32#(<= 0 main_~j~0)} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:31,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:31,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-28 03:11:31,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 03:11:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:11:31,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:31,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971752674] [2022-04-28 03:11:31,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971752674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:31,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:31,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:31,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:31,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1455758707] [2022-04-28 03:11:31,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1455758707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:31,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:31,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8402773] [2022-04-28 03:11:31,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:31,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:11:31,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:31,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:31,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:31,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:31,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:32,017 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:32,471 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-28 03:11:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:11:32,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:11:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 03:11:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-28 03:11:32,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-28 03:11:32,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:32,586 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:11:32,586 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:11:32,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:11:32,592 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:32,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 42 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:11:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:11:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:11:32,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:32,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:32,619 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:32,619 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:32,622 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:11:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:11:32,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:32,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:32,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-04-28 03:11:32,624 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-04-28 03:11:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:32,626 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:11:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:11:32,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:32,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:32,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:32,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 03:11:32,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2022-04-28 03:11:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:32,631 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 03:11:32,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:32,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 03:11:32,659 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-28 03:11:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:11:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:11:32,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:32,661 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:32,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:11:32,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash 607772639, now seen corresponding path program 1 times [2022-04-28 03:11:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:32,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [813092253] [2022-04-28 03:11:32,663 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 607772639, now seen corresponding path program 2 times [2022-04-28 03:11:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:32,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831484280] [2022-04-28 03:11:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:11:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:32,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(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(9, 2); {232#true} is VALID [2022-04-28 03:11:32,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 03:11:32,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#true} {232#true} #64#return; {232#true} is VALID [2022-04-28 03:11:32,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-28 03:11:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:32,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-28 03:11:32,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-28 03:11:32,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 03:11:32,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {237#(not (<= main_~material_length~0 main_~j~0))} #56#return; {237#(not (<= main_~material_length~0 main_~j~0))} is VALID [2022-04-28 03:11:32,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:11:32,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(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(9, 2); {232#true} is VALID [2022-04-28 03:11:32,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 03:11:32,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #64#return; {232#true} is VALID [2022-04-28 03:11:32,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret5 := main(); {232#true} is VALID [2022-04-28 03:11:32,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} havoc ~idBitLength~0;havoc ~material_length~0;havoc ~nlen~0;havoc ~j~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~nlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~idBitLength~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~material_length~0 := #t~nondet3;havoc #t~nondet3; {232#true} is VALID [2022-04-28 03:11:32,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#true} assume !!(~nlen~0 == (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 32 then 1 + ~idBitLength~0 / 32 else ~idBitLength~0 / 32));~j~0 := 0; {232#true} is VALID [2022-04-28 03:11:32,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#true} assume !!(~j~0 < (if ~idBitLength~0 < 0 && 0 != ~idBitLength~0 % 8 then 1 + ~idBitLength~0 / 8 else ~idBitLength~0 / 8) && ~j~0 < ~material_length~0); {237#(not (<= main_~material_length~0 main_~j~0))} is VALID [2022-04-28 03:11:32,750 INFO L272 TraceCheckUtils]: 8: Hoare triple {237#(not (<= main_~material_length~0 main_~j~0))} call __VERIFIER_assert((if 0 <= ~j~0 then 1 else 0)); {232#true} is VALID [2022-04-28 03:11:32,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {232#true} ~cond := #in~cond; {232#true} is VALID [2022-04-28 03:11:32,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {232#true} assume !(0 == ~cond); {232#true} is VALID [2022-04-28 03:11:32,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#true} assume true; {232#true} is VALID [2022-04-28 03:11:32,751 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {232#true} {237#(not (<= main_~material_length~0 main_~j~0))} #56#return; {237#(not (<= main_~material_length~0 main_~j~0))} is VALID [2022-04-28 03:11:32,752 INFO L272 TraceCheckUtils]: 13: Hoare triple {237#(not (<= main_~material_length~0 main_~j~0))} call __VERIFIER_assert((if ~j~0 < ~material_length~0 then 1 else 0)); {242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:32,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {243#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:32,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {233#false} is VALID [2022-04-28 03:11:32,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {233#false} assume !false; {233#false} is VALID [2022-04-28 03:11:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:11:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:11:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831484280] [2022-04-28 03:11:32,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831484280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:32,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:32,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:32,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [813092253] [2022-04-28 03:11:32,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [813092253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:32,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:32,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:11:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750152882] [2022-04-28 03:11:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:32,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 03:11:32,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:32,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:32,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:32,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:11:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:11:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:11:32,772 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:33,017 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 03:11:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:11:33,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-28 03:11:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 03:11:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-28 03:11:33,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-28 03:11:33,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:33,069 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:11:33,069 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:11:33,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:11:33,070 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:33,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:11:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:11:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:11:33,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:33,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:33,088 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:33,088 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:33,090 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-28 03:11:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 03:11:33,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:33,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:33,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-28 03:11:33,092 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-28 03:11:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:33,094 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-28 03:11:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 03:11:33,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:33,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:33,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:33,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 03:11:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-28 03:11:33,097 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2022-04-28 03:11:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:33,097 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-28 03:11:33,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:11:33,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-28 03:11:33,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 03:11:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:11:33,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:33,140 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:33,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:11:33,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:33,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1749490943, now seen corresponding path program 1 times [2022-04-28 03:11:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:33,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1559920281] [2022-04-28 03:11:33,142 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:11:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1749490943, now seen corresponding path program 2 times [2022-04-28 03:11:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:33,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496617854] [2022-04-28 03:11:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:11:33,175 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:11:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:11:33,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:11:33,213 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 03:11:33,214 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 03:11:33,216 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 03:11:33,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:11:33,220 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 03:11:33,223 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 03:11:33,231 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-28 03:11:33,232 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 03:11:33,233 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 03:11:33,234 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 03:11:33,234 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:11:33,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:11:33 BoogieIcfgContainer [2022-04-28 03:11:33,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:11:33,236 INFO L158 Benchmark]: Toolchain (without parser) took 2363.90ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 131.2MB in the beginning and 105.3MB in the end (delta: 25.9MB). Peak memory consumption was 93.0MB. Max. memory is 8.0GB. [2022-04-28 03:11:33,236 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory was 147.6MB in the beginning and 147.5MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:11:33,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.51ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 131.1MB in the beginning and 225.8MB in the end (delta: -94.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-28 03:11:33,237 INFO L158 Benchmark]: Boogie Preprocessor took 26.29ms. Allocated memory is still 249.6MB. Free memory was 225.8MB in the beginning and 224.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 03:11:33,237 INFO L158 Benchmark]: RCFGBuilder took 359.91ms. Allocated memory is still 249.6MB. Free memory was 224.3MB in the beginning and 210.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-28 03:11:33,238 INFO L158 Benchmark]: TraceAbstraction took 1729.66ms. Allocated memory is still 249.6MB. Free memory was 209.6MB in the beginning and 105.3MB in the end (delta: 104.3MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. [2022-04-28 03:11:33,239 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.12ms. Allocated memory is still 182.5MB. Free memory was 147.6MB in the beginning and 147.5MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.51ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 131.1MB in the beginning and 225.8MB in the end (delta: -94.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.29ms. Allocated memory is still 249.6MB. Free memory was 225.8MB in the beginning and 224.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 359.91ms. Allocated memory is still 249.6MB. Free memory was 224.3MB in the beginning and 210.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1729.66ms. Allocated memory is still 249.6MB. Free memory was 209.6MB in the beginning and 105.3MB in the end (delta: 104.3MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int idBitLength, material_length, nlen; [L26] int j, k; [L27] nlen = __VERIFIER_nondet_int() [L28] idBitLength = __VERIFIER_nondet_int() [L29] material_length = __VERIFIER_nondet_int() [L30] COND FALSE !(!( nlen == idBitLength / 32 )) [L31] j = 0 [L31] COND TRUE (j < idBitLength / 8) && (j < material_length) [L32] CALL __VERIFIER_assert( 0 <= j) [L18] COND FALSE !(!(cond)) [L32] RET __VERIFIER_assert( 0 <= j) [L33] CALL __VERIFIER_assert( j < material_length ) [L18] COND FALSE !(!(cond)) [L33] RET __VERIFIER_assert( j < material_length ) [L34] CALL __VERIFIER_assert( 0 <= j/4 ) [L18] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert( 0 <= j/4 ) [L35] CALL __VERIFIER_assert( j/4 < nlen) [L18] COND TRUE !(cond) [L19] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 39 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 03:11:33,272 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...