/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark51_polynomial.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:08:15,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:08:15,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:08:16,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:08:16,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:08:16,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:08:16,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:08:16,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:08:16,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:08:16,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:08:16,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:08:16,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:08:16,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:08:16,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:08:16,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:08:16,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:08:16,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:08:16,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:08:16,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:08:16,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:08:16,051 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:08:16,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:08:16,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:08:16,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:08:16,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:08:16,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:08:16,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:08:16,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:08:16,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:08:16,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:08:16,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:08:16,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:08:16,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:08:16,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:08:16,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:08:16,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:08:16,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:08:16,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:08:16,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:08:16,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:08:16,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:08:16,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:08:16,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:08:16,095 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:08:16,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:08:16,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:08:16,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:08:16,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:08:16,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:08:16,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:08:16,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:08:16,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:08:16,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:08:16,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:08:16,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:08:16,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:08:16,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:08:16,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:08:16,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:08:16,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:08:16,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:08:16,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:08:16,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:08:16,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:08:16,100 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:08:16,101 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 17:08:16,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:08:16,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:08:16,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:08:16,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:08:16,406 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:08:16,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark51_polynomial.i [2022-04-27 17:08:16,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390583bf4/d866d86262164bbba5c9cf862fe46eaa/FLAG78250a316 [2022-04-27 17:08:16,843 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:08:16,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark51_polynomial.i [2022-04-27 17:08:16,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390583bf4/d866d86262164bbba5c9cf862fe46eaa/FLAG78250a316 [2022-04-27 17:08:17,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390583bf4/d866d86262164bbba5c9cf862fe46eaa [2022-04-27 17:08:17,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:08:17,252 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:08:17,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:08:17,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:08:17,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:08:17,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76274bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17, skipping insertion in model container [2022-04-27 17:08:17,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:08:17,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:08:17,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark51_polynomial.i[872,885] [2022-04-27 17:08:17,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:08:17,427 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:08:17,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark51_polynomial.i[872,885] [2022-04-27 17:08:17,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:08:17,484 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:08:17,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17 WrapperNode [2022-04-27 17:08:17,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:08:17,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:08:17,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:08:17,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:08:17,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:08:17,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:08:17,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:08:17,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:08:17,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:08:17,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:08:17,568 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-27 17:08:17,583 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-27 17:08:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:08:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:08:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:08:17,601 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:08:17,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 17:08:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:08:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:08:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:08:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:08:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:08:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:08:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:08:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:08:17,656 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:08:17,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:08:17,852 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:08:17,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:08:17,858 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 17:08:17,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:08:17 BoogieIcfgContainer [2022-04-27 17:08:17,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:08:17,860 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:08:17,860 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:08:17,876 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:08:17,878 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:08:17" (1/1) ... [2022-04-27 17:08:17,880 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:08:17,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:08:17 BasicIcfg [2022-04-27 17:08:17,921 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:08:17,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:08:17,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:08:17,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:08:17,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:08:17" (1/4) ... [2022-04-27 17:08:17,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47046d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:08:17, skipping insertion in model container [2022-04-27 17:08:17,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:17" (2/4) ... [2022-04-27 17:08:17,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47046d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:08:17, skipping insertion in model container [2022-04-27 17:08:17,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:08:17" (3/4) ... [2022-04-27 17:08:17,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47046d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:08:17, skipping insertion in model container [2022-04-27 17:08:17,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:08:17" (4/4) ... [2022-04-27 17:08:17,928 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark51_polynomial.iJordan [2022-04-27 17:08:17,941 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:08:17,941 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:08:17,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:08:18,011 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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@528c4e52, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@278864e0 [2022-04-27 17:08:18,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:08:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 17:08:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 17:08:18,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:08:18,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:08:18,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:08:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:08:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -383999135, now seen corresponding path program 1 times [2022-04-27 17:08:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:08:18,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154466282] [2022-04-27 17:08:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:08:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:08:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:08:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:18,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 17:08:18,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 17:08:18,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [84] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 17:08:18,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:08:18,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-27 17:08:18,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 17:08:18,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [84] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 17:08:18,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 17:08:18,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [64] mainENTRY-->L21: Formula: (and (= v_main_~x~0_2 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1] {25#true} is VALID [2022-04-27 17:08:18,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [67] L21-->L24-1: Formula: (and (<= v_main_~x~0_4 50) (<= 0 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-27 17:08:18,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} [69] L24-1-->L22-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 17:08:18,226 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [72] L22-2-->__VERIFIER_assertENTRY: Formula: (= (ite (and (<= v_main_~x~0_12 50) (<= 0 v_main_~x~0_12)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {26#false} is VALID [2022-04-27 17:08:18,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [76] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-27 17:08:18,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [79] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 17:08:18,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [81] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-27 17:08:18,227 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-27 17:08:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:08:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154466282] [2022-04-27 17:08:18,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154466282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:08:18,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:08:18,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:08:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488482482] [2022-04-27 17:08:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:08:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-27 17:08:18,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:08:18,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-27 17:08:18,255 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-27 17:08:18,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:08:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:08:18,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:08:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:08:18,276 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-27 17:08:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:18,332 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-27 17:08:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:08:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-27 17:08:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:08:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-27 17:08:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-27 17:08:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-27 17:08:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-04-27 17:08:18,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-04-27 17:08:18,376 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-27 17:08:18,382 INFO L225 Difference]: With dead ends: 22 [2022-04-27 17:08:18,383 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 17:08:18,384 INFO L412 NwaCegarLoop]: 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-27 17:08:18,387 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:08:18,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:08:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 17:08:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 17:08:18,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:08:18,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:08:18,412 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:08:18,413 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:08:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:18,415 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 17:08:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 17:08:18,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:18,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:18,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 17:08:18,417 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 17:08:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:18,419 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-27 17:08:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 17:08:18,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:18,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:18,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:08:18,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:08:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 17:08:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-27 17:08:18,423 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-04-27 17:08:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:08:18,423 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-27 17:08:18,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-27 17:08:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-27 17:08:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 17:08:18,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:08:18,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:08:18,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:08:18,425 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:08:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:08:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -383075614, now seen corresponding path program 1 times [2022-04-27 17:08:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:08:18,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117722015] [2022-04-27 17:08:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:08:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:08:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:08:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:18,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 17:08:18,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 17:08:18,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [84] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 17:08:18,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [60] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:08:18,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [62] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_1| 1) 1) (= (select |v_#length_1| 2) 25) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-27 17:08:18,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [65] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 17:08:18,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [84] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 17:08:18,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [61] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-27 17:08:18,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [64] mainENTRY-->L21: Formula: (and (= v_main_~x~0_2 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1] {100#true} is VALID [2022-04-27 17:08:18,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#true} [67] L21-->L24-1: Formula: (and (<= v_main_~x~0_4 50) (<= 0 v_main_~x~0_4)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {105#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-27 17:08:18,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#(and (<= 0 main_~x~0) (<= main_~x~0 50))} [70] L24-1-->L22-2: Formula: (= (mod |v_main_#t~nondet2_2| 256) 0) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet2] {105#(and (<= 0 main_~x~0) (<= main_~x~0 50))} is VALID [2022-04-27 17:08:18,584 INFO L272 TraceCheckUtils]: 8: Hoare triple {105#(and (<= 0 main_~x~0) (<= main_~x~0 50))} [72] L22-2-->__VERIFIER_assertENTRY: Formula: (= (ite (and (<= v_main_~x~0_12 50) (<= 0 v_main_~x~0_12)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {106#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:08:18,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {106#(not (= |__VERIFIER_assert_#in~cond| 0))} [76] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {107#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:08:18,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#(not (= __VERIFIER_assert_~cond 0))} [79] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 17:08:18,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#false} [81] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-27 17:08:18,586 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-27 17:08:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:08:18,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117722015] [2022-04-27 17:08:18,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117722015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:08:18,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:08:18,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:08:18,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699373203] [2022-04-27 17:08:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:08:18,588 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-27 17:08:18,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:08:18,589 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-27 17:08:18,607 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-27 17:08:18,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:08:18,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:08:18,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:08:18,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:08:18,609 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. 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-27 17:08:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:18,748 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 17:08:18,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 17:08:18,748 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-27 17:08:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:08:18,749 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-27 17:08:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2022-04-27 17:08:18,753 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-27 17:08:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2022-04-27 17:08:18,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 16 transitions. [2022-04-27 17:08:18,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:08:18,778 INFO L225 Difference]: With dead ends: 13 [2022-04-27 17:08:18,778 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 17:08:18,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 17:08:18,783 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:08:18,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 27 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:08:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 17:08:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 17:08:18,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:08:18,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:08:18,786 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:08:18,786 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:08:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:18,786 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:08:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:08:18,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:18,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:18,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 17:08:18,787 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 17:08:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:18,787 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:08:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:08:18,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:18,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:18,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:08:18,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:08:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 17:08:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 17:08:18,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-04-27 17:08:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:08:18,790 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 17:08:18,790 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-27 17:08:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:08:18,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:18,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:08:18,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:08:18,797 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-27 17:08:18,801 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:08:18,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:08:18 BasicIcfg [2022-04-27 17:08:18,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:08:18,811 INFO L158 Benchmark]: Toolchain (without parser) took 1558.55ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 111.9MB in the beginning and 128.5MB in the end (delta: -16.6MB). Peak memory consumption was 33.3MB. Max. memory is 8.0GB. [2022-04-27 17:08:18,812 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:08:18,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.43ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 111.8MB in the beginning and 192.9MB in the end (delta: -81.1MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-04-27 17:08:18,814 INFO L158 Benchmark]: Boogie Preprocessor took 47.89ms. Allocated memory is still 218.1MB. Free memory was 192.9MB in the beginning and 191.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 17:08:18,818 INFO L158 Benchmark]: RCFGBuilder took 324.50ms. Allocated memory is still 218.1MB. Free memory was 191.4MB in the beginning and 179.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 17:08:18,819 INFO L158 Benchmark]: IcfgTransformer took 61.17ms. Allocated memory is still 218.1MB. Free memory was 179.9MB in the beginning and 178.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:08:18,819 INFO L158 Benchmark]: TraceAbstraction took 886.50ms. Allocated memory is still 218.1MB. Free memory was 177.8MB in the beginning and 128.5MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-04-27 17:08:18,820 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.13ms. Allocated memory is still 167.8MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.43ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 111.8MB in the beginning and 192.9MB in the end (delta: -81.1MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.89ms. Allocated memory is still 218.1MB. Free memory was 192.9MB in the beginning and 191.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 324.50ms. Allocated memory is still 218.1MB. Free memory was 191.4MB in the beginning and 179.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 61.17ms. Allocated memory is still 218.1MB. Free memory was 179.9MB in the beginning and 178.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 886.50ms. Allocated memory is still 218.1MB. Free memory was 177.8MB in the beginning and 128.5MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 34 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 52 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 17:08:18,854 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...