/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-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:58:33,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:58:33,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:58:33,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:58:33,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:58:33,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:58:33,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:58:33,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:58:33,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:58:33,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:58:33,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:58:33,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:58:33,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:58:33,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:58:33,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:58:33,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:58:33,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:58:33,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:58:33,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:58:33,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:58:33,409 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:58:33,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:58:33,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:58:33,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:58:33,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:58:33,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:58:33,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:58:33,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:58:33,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:58:33,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:58:33,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:58:33,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:58:33,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:58:33,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:58:33,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:58:33,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:58:33,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:58:33,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:58:33,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:58:33,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:58:33,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:58:33,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:58:33,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:58:33,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:58:33,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:58:33,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:58:33,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:58:33,451 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:58:33,451 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:58:33,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:58:33,451 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:58:33,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:58:33,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:58:33,452 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:58:33,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:58:33,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:58:33,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:58:33,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:58:33,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:58:33,453 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:58:33,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:58:33,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:58:33,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:58:33,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:58:33,454 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:58:33,454 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:58:33,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:58:33,454 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:58:33,454 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-08 03:58:33,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:58:33,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:58:33,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:58:33,700 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:58:33,703 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:58:33,704 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-08 03:58:33,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aaf08987/fc679b6331514f5e9526b73e5f7ac74c/FLAG846d6de6a [2022-04-08 03:58:34,184 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:58:34,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-08 03:58:34,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aaf08987/fc679b6331514f5e9526b73e5f7ac74c/FLAG846d6de6a [2022-04-08 03:58:34,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aaf08987/fc679b6331514f5e9526b73e5f7ac74c [2022-04-08 03:58:34,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:58:34,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:58:34,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:58:34,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:58:34,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:58:34,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bce2fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34, skipping insertion in model container [2022-04-08 03:58:34,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:58:34,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:58:34,783 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-lit/gj2007b.i[895,908] [2022-04-08 03:58:34,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:58:34,806 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:58:34,817 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-lit/gj2007b.i[895,908] [2022-04-08 03:58:34,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:58:34,833 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:58:34,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34 WrapperNode [2022-04-08 03:58:34,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:58:34,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:58:34,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:58:34,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:58:34,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:58:34,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:58:34,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:58:34,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:58:34,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (1/1) ... [2022-04-08 03:58:34,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:58:34,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:58:34,914 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-08 03:58:34,923 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-08 03:58:34,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:58:34,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:58:34,947 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:58:34,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:58:34,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:58:34,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:58:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:58:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:58:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:58:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:58:34,947 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:58:34,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:58:34,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:58:34,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:58:34,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:58:35,013 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:58:35,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:58:35,174 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:58:35,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:58:35,181 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:58:35,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:58:35 BoogieIcfgContainer [2022-04-08 03:58:35,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:58:35,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:58:35,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:58:35,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:58:35,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:58:34" (1/3) ... [2022-04-08 03:58:35,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73141870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:58:35, skipping insertion in model container [2022-04-08 03:58:35,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:58:34" (2/3) ... [2022-04-08 03:58:35,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73141870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:58:35, skipping insertion in model container [2022-04-08 03:58:35,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:58:35" (3/3) ... [2022-04-08 03:58:35,214 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2022-04-08 03:58:35,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:58:35,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:58:35,264 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:58:35,269 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-08 03:58:35,269 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:58:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:58:35,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:58:35,291 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:58:35,292 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:58:35,292 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:58:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:58:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 1 times [2022-04-08 03:58:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:58:35,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159747841] [2022-04-08 03:58:35,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:58:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 2 times [2022-04-08 03:58:35,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:58:35,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010523539] [2022-04-08 03:58:35,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:58:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:58:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:58:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:58:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:58:35,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-08 03:58:35,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 03:58:35,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-08 03:58:35,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:58:35,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-08 03:58:35,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 03:58:35,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-08 03:58:35,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-08 03:58:35,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-08 03:58:35,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 03:58:35,510 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {26#false} is VALID [2022-04-08 03:58:35,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 03:58:35,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 03:58:35,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 03:58:35,511 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-08 03:58:35,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:58:35,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010523539] [2022-04-08 03:58:35,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010523539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:58:35,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:58:35,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:58:35,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:58:35,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159747841] [2022-04-08 03:58:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159747841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:58:35,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:58:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:58:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809644334] [2022-04-08 03:58:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:58:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 03:58:35,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:58:35,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:58:35,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:58:35,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:58:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:58:35,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:58:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:58:35,578 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:58:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:58:35,701 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 03:58:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:58:35,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 03:58:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:58:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:58:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-08 03:58:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:58:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-08 03:58:35,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-08 03:58:35,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:58:35,802 INFO L225 Difference]: With dead ends: 35 [2022-04-08 03:58:35,803 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 03:58:35,806 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:58:35,809 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:58:35,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:58:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 03:58:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 03:58:35,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:58:35,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:58:35,852 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:58:35,852 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:58:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:58:35,858 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 03:58:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 03:58:35,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:58:35,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:58:35,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-08 03:58:35,860 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-08 03:58:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:58:35,862 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 03:58:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 03:58:35,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:58:35,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:58:35,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:58:35,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:58:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:58:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 03:58:35,867 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 03:58:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:58:35,869 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 03:58:35,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:58:35,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 03:58:35,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:58:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 03:58:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:58:35,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:58:35,902 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:58:35,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:58:35,902 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:58:35,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:58:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 1 times [2022-04-08 03:58:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:58:35,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243937734] [2022-04-08 03:58:35,906 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:58:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 2 times [2022-04-08 03:58:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:58:35,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944711501] [2022-04-08 03:58:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:58:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:58:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:58:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:58:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:58:36,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(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); {171#true} is VALID [2022-04-08 03:58:36,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-08 03:58:36,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #60#return; {171#true} is VALID [2022-04-08 03:58:36,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:58:36,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(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); {171#true} is VALID [2022-04-08 03:58:36,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-08 03:58:36,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #60#return; {171#true} is VALID [2022-04-08 03:58:36,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret3 := main(); {171#true} is VALID [2022-04-08 03:58:36,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-08 03:58:36,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} assume !(~x~0 < ~n~0); {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-08 03:58:36,044 INFO L272 TraceCheckUtils]: 7: Hoare triple {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:58:36,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:58:36,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {172#false} is VALID [2022-04-08 03:58:36,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-08 03:58:36,046 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-08 03:58:36,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:58:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944711501] [2022-04-08 03:58:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944711501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:58:36,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:58:36,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:58:36,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:58:36,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243937734] [2022-04-08 03:58:36,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243937734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:58:36,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:58:36,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:58:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93743714] [2022-04-08 03:58:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:58:36,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-08 03:58:36,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:58:36,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-08 03:58:36,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:58:36,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:58:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:58:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:58:36,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:58:36,067 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-08 03:58:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:58:36,258 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 03:58:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:58:36,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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 11 [2022-04-08 03:58:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:58:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-08 03:58:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 03:58:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-08 03:58:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 03:58:36,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-08 03:58:36,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:58:36,301 INFO L225 Difference]: With dead ends: 28 [2022-04-08 03:58:36,301 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 03:58:36,302 INFO L912 BasicCegarLoop]: 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-08 03:58:36,303 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:58:36,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:58:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 03:58:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 03:58:36,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:58:36,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:58:36,324 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:58:36,325 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:58:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:58:36,333 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 03:58:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 03:58:36,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:58:36,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:58:36,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 03:58:36,334 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 03:58:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:58:36,339 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 03:58:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 03:58:36,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:58:36,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:58:36,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:58:36,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:58:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:58:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-08 03:58:36,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-04-08 03:58:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:58:36,342 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-08 03:58:36,343 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 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-08 03:58:36,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-08 03:58:36,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:58:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-08 03:58:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 03:58:36,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:58:36,381 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:58:36,381 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:58:36,381 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:58:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:58:36,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1147629988, now seen corresponding path program 1 times [2022-04-08 03:58:36,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:58:36,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [378110285] [2022-04-08 03:58:40,772 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 03:58:41,020 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 03:58:41,021 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) 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:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 03:58:41,024 INFO L158 Benchmark]: Toolchain (without parser) took 6410.58ms. Allocated memory was 178.3MB in the beginning and 226.5MB in the end (delta: 48.2MB). Free memory was 124.6MB in the beginning and 165.0MB in the end (delta: -40.4MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. [2022-04-08 03:58:41,024 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:58:41,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.33ms. Allocated memory was 178.3MB in the beginning and 226.5MB in the end (delta: 48.2MB). Free memory was 124.5MB in the beginning and 202.1MB in the end (delta: -77.6MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-04-08 03:58:41,025 INFO L158 Benchmark]: Boogie Preprocessor took 47.63ms. Allocated memory is still 226.5MB. Free memory was 202.1MB in the beginning and 200.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 03:58:41,025 INFO L158 Benchmark]: RCFGBuilder took 298.91ms. Allocated memory is still 226.5MB. Free memory was 200.5MB in the beginning and 189.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 03:58:41,025 INFO L158 Benchmark]: TraceAbstraction took 5829.26ms. Allocated memory is still 226.5MB. Free memory was 189.0MB in the beginning and 165.0MB in the end (delta: 24.0MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. [2022-04-08 03:58:41,027 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.33ms. Allocated memory was 178.3MB in the beginning and 226.5MB in the end (delta: 48.2MB). Free memory was 124.5MB in the beginning and 202.1MB in the end (delta: -77.6MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.63ms. Allocated memory is still 226.5MB. Free memory was 202.1MB in the beginning and 200.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 298.91ms. Allocated memory is still 226.5MB. Free memory was 200.5MB in the beginning and 189.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5829.26ms. Allocated memory is still 226.5MB. Free memory was 189.0MB in the beginning and 165.0MB in the end (delta: 24.0MB). Peak memory consumption was 75.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 03:58:41,044 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...