/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/loops/sum04-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:43:21,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:43:21,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:43:21,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:43:21,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:43:21,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:43:21,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:43:21,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:43:21,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:43:21,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:43:21,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:43:21,123 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:43:21,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:43:21,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:43:21,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:43:21,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:43:21,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:43:21,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:43:21,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:43:21,137 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:43:21,138 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:43:21,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:43:21,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:43:21,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:43:21,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:43:21,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:43:21,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:43:21,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:43:21,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:43:21,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:43:21,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:43:21,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:43:21,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:43:21,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:43:21,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:43:21,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:43:21,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:43:21,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:43:21,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:43:21,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:43:21,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:43:21,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:43:21,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:43:21,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:43:21,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:43:21,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:43:21,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:43:21,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:43:21,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:43:21,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:43:21,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:43:21,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:43:21,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:43:21,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:43:21,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:43:21,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:43:21,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:43:21,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:43:21,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:43:21,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:43:21,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:43:21,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:43:21,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:43:21,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:43:21,176 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:43:21,176 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-07 16:43:21,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:43:21,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:43:21,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:43:21,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:43:21,379 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:43:21,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2022-04-07 16:43:21,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acaf0955f/6147c914a1ec4d11bf7e9fee7e595e2b/FLAG864b01636 [2022-04-07 16:43:21,822 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:43:21,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2022-04-07 16:43:21,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acaf0955f/6147c914a1ec4d11bf7e9fee7e595e2b/FLAG864b01636 [2022-04-07 16:43:21,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acaf0955f/6147c914a1ec4d11bf7e9fee7e595e2b [2022-04-07 16:43:21,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:43:21,840 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:43:21,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:43:21,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:43:21,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:43:21,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:43:21" (1/1) ... [2022-04-07 16:43:21,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ee0353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:21, skipping insertion in model container [2022-04-07 16:43:21,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:43:21" (1/1) ... [2022-04-07 16:43:21,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:43:21,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:43:22,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i[808,821] [2022-04-07 16:43:22,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:43:22,023 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:43:22,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i[808,821] [2022-04-07 16:43:22,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:43:22,046 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:43:22,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22 WrapperNode [2022-04-07 16:43:22,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:43:22,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:43:22,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:43:22,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:43:22,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:43:22,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:43:22,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:43:22,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:43:22,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:43:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:22,096 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-07 16:43:22,109 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-07 16:43:22,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:43:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:43:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:43:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:43:22,138 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:43:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:43:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:43:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:43:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:43:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:43:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:43:22,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:43:22,186 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:43:22,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:43:22,259 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:43:22,263 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:43:22,263 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:43:22,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:22 BoogieIcfgContainer [2022-04-07 16:43:22,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:43:22,265 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:43:22,265 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:43:22,265 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:43:22,267 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:22" (1/1) ... [2022-04-07 16:43:22,268 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:43:22,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:43:22 BasicIcfg [2022-04-07 16:43:22,279 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:43:22,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:43:22,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:43:22,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:43:22,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:43:21" (1/4) ... [2022-04-07 16:43:22,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9e518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:43:22, skipping insertion in model container [2022-04-07 16:43:22,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:43:22" (2/4) ... [2022-04-07 16:43:22,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9e518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:43:22, skipping insertion in model container [2022-04-07 16:43:22,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:43:22" (3/4) ... [2022-04-07 16:43:22,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9e518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:43:22, skipping insertion in model container [2022-04-07 16:43:22,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:43:22" (4/4) ... [2022-04-07 16:43:22,284 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-1.iJordan [2022-04-07 16:43:22,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:43:22,287 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:43:22,311 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:43:22,315 INFO L340 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 [2022-04-07 16:43:22,316 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:43:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 16:43:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:43:22,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:22,332 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:22,332 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash -423489079, now seen corresponding path program 1 times [2022-04-07 16:43:22,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:22,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66150990] [2022-04-07 16:43:22,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:22,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {23#true} is VALID [2022-04-07 16:43:22,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 16:43:22,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 16:43:22,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:22,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {23#true} is VALID [2022-04-07 16:43:22,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 16:43:22,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 16:43:22,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 16:43:22,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {23#true} is VALID [2022-04-07 16:43:22,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [56] L24-3-->L24-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 16:43:22,519 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {24#false} is VALID [2022-04-07 16:43:22,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-07 16:43:22,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 16:43:22,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 16:43:22,520 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-07 16:43:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:22,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66150990] [2022-04-07 16:43:22,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66150990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:43:22,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:43:22,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 16:43:22,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253250623] [2022-04-07 16:43:22,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:43:22,526 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-07 16:43:22,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:22,529 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-07 16:43:22,549 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-07 16:43:22,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 16:43:22,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 16:43:22,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:43:22,566 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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-07 16:43:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:22,626 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-07 16:43:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 16:43:22,627 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-07 16:43:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:22,628 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-07 16:43:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 16:43:22,640 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-07 16:43:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 16:43:22,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-07 16:43:22,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:22,678 INFO L225 Difference]: With dead ends: 20 [2022-04-07 16:43:22,678 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 16:43:22,679 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-07 16:43:22,683 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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-07 16:43:22,684 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 16:43:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 16:43:22,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:22,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:22,702 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:22,702 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:22,706 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 16:43:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 16:43:22,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:22,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:22,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-07 16:43:22,709 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-07 16:43:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:22,713 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 16:43:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 16:43:22,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:22,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:22,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:22,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-07 16:43:22,716 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-07 16:43:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:22,716 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-07 16:43:22,717 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-07 16:43:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 16:43:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:43:22,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:22,719 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:22,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:43:22,721 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash -422565558, now seen corresponding path program 1 times [2022-04-07 16:43:22,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:22,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099373017] [2022-04-07 16:43:22,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:22,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {93#true} is VALID [2022-04-07 16:43:22,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 16:43:22,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93#true} {93#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 16:43:22,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {93#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:22,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {93#true} is VALID [2022-04-07 16:43:22,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 16:43:22,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93#true} {93#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 16:43:22,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {93#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-04-07 16:43:22,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {98#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:22,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#(= (+ (- 1) main_~i~0) 0)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-07 16:43:22,787 INFO L272 TraceCheckUtils]: 7: Hoare triple {94#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {94#false} is VALID [2022-04-07 16:43:22,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {94#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {94#false} is VALID [2022-04-07 16:43:22,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {94#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-07 16:43:22,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {94#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-04-07 16:43:22,788 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-07 16:43:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:22,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099373017] [2022-04-07 16:43:22,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099373017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:43:22,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:43:22,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:43:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900660206] [2022-04-07 16:43:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:43:22,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 16:43:22,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:22,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 16:43:22,798 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-07 16:43:22,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:43:22,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:43:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:43:22,799 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 16:43:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:22,852 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 16:43:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:43:22,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 16:43:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 16:43:22,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-07 16:43:22,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 16:43:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-07 16:43:22,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-07 16:43:22,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:22,871 INFO L225 Difference]: With dead ends: 17 [2022-04-07 16:43:22,871 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 16:43:22,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:43:22,872 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:22,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 16:43:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-07 16:43:22,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:22,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-07 16:43:22,874 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-07 16:43:22,875 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-07 16:43:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:22,876 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 16:43:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 16:43:22,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:22,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:22,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 17 states. [2022-04-07 16:43:22,876 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 17 states. [2022-04-07 16:43:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:22,877 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-07 16:43:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-07 16:43:22,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:22,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:22,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:22,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-07 16:43:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-07 16:43:22,879 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-07 16:43:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:22,879 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-07 16:43:22,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-07 16:43:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-07 16:43:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 16:43:22,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:22,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:22,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:43:22,880 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1744981802, now seen corresponding path program 1 times [2022-04-07 16:43:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:22,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766156561] [2022-04-07 16:43:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {171#true} is VALID [2022-04-07 16:43:22,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:22,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:22,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:22,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {171#true} is VALID [2022-04-07 16:43:22,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:22,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:22,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:22,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {176#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:22,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {176#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:22,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {176#(= (+ (- 1) main_~i~0) 0)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {176#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:22,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#(= (+ (- 1) main_~i~0) 0)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {177#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:22,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#(<= main_~i~0 2)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:22,928 INFO L272 TraceCheckUtils]: 10: Hoare triple {172#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {172#false} is VALID [2022-04-07 16:43:22,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {172#false} is VALID [2022-04-07 16:43:22,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:22,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766156561] [2022-04-07 16:43:22,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766156561] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:43:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351974696] [2022-04-07 16:43:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:22,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:22,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:22,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:43:22,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 16:43:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 16:43:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:22,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:43:23,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {171#true} is VALID [2022-04-07 16:43:23,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {197#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:23,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(<= main_~i~0 1)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {197#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:23,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(<= main_~i~0 1)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {197#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:23,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#(<= main_~i~0 1)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {177#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:23,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {177#(<= main_~i~0 2)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:23,053 INFO L272 TraceCheckUtils]: 10: Hoare triple {172#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {172#false} is VALID [2022-04-07 16:43:23,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {172#false} is VALID [2022-04-07 16:43:23,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:23,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:23,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:43:23,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:23,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:23,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {172#false} is VALID [2022-04-07 16:43:23,117 INFO L272 TraceCheckUtils]: 10: Hoare triple {172#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {172#false} is VALID [2022-04-07 16:43:23,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(<= main_~i~0 8)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {172#false} is VALID [2022-04-07 16:43:23,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#(<= main_~i~0 7)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {234#(<= main_~i~0 8)} is VALID [2022-04-07 16:43:23,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(<= main_~i~0 7)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {238#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:23,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#(<= main_~i~0 7)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {238#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:23,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {238#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:23,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {171#true} is VALID [2022-04-07 16:43:23,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#true} is VALID [2022-04-07 16:43:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:23,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351974696] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:43:23,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:43:23,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-07 16:43:23,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615109831] [2022-04-07 16:43:23,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:43:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 16:43:23,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:23,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:23,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:23,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 16:43:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:23,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 16:43:23,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 16:43:23,139 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:23,241 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 16:43:23,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 16:43:23,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-07 16:43:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-07 16:43:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2022-04-07 16:43:23,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2022-04-07 16:43:23,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:23,267 INFO L225 Difference]: With dead ends: 24 [2022-04-07 16:43:23,267 INFO L226 Difference]: Without dead ends: 24 [2022-04-07 16:43:23,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:43:23,268 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:23,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-07 16:43:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-07 16:43:23,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:23,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-07 16:43:23,270 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-07 16:43:23,271 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-07 16:43:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:23,272 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 16:43:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 16:43:23,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:23,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:23,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 24 states. [2022-04-07 16:43:23,273 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 24 states. [2022-04-07 16:43:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:23,274 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-07 16:43:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 16:43:23,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:23,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:23,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:23,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-07 16:43:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-07 16:43:23,275 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-07 16:43:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:23,276 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-07 16:43:23,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-07 16:43:23,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 16:43:23,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:23,276 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:23,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 16:43:23,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:23,484 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2062709365, now seen corresponding path program 1 times [2022-04-07 16:43:23,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492891919] [2022-04-07 16:43:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:43:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:23,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {369#true} is VALID [2022-04-07 16:43:23,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {369#true} {369#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:43:23,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {369#true} is VALID [2022-04-07 16:43:23,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369#true} {369#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {369#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {374#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:23,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {374#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {374#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:23,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {374#(= (+ (- 1) main_~i~0) 0)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {374#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:43:23,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#(= (+ (- 1) main_~i~0) 0)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {375#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:23,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {375#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:23,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {375#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {375#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:23,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {375#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {376#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:23,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {376#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:23,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {376#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:23,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {376#(<= main_~i~0 3)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {377#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= main_~i~0 4)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {378#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:23,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {378#(<= main_~i~0 5)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,591 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {370#false} is VALID [2022-04-07 16:43:23,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {370#false} is VALID [2022-04-07 16:43:23,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:23,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:43:23,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492891919] [2022-04-07 16:43:23,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492891919] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:43:23,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417620329] [2022-04-07 16:43:23,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:23,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:43:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:43:23,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 16:43:23,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 16:43:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:23,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 16:43:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:43:23,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:43:23,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {369#true} is VALID [2022-04-07 16:43:23,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369#true} {369#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {369#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {398#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:23,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(<= main_~i~0 1)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {398#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:23,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#(<= main_~i~0 1)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {398#(<= main_~i~0 1)} is VALID [2022-04-07 16:43:23,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#(<= main_~i~0 1)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {375#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:23,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {375#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {375#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:23,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {375#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {375#(<= main_~i~0 2)} is VALID [2022-04-07 16:43:23,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {375#(<= main_~i~0 2)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {376#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:23,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {376#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:23,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {376#(<= main_~i~0 3)} is VALID [2022-04-07 16:43:23,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {376#(<= main_~i~0 3)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {377#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= main_~i~0 4)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {378#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:23,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {378#(<= main_~i~0 5)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,736 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {370#false} is VALID [2022-04-07 16:43:23,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {370#false} is VALID [2022-04-07 16:43:23,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:23,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:43:23,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} [65] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} [63] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {370#false} is VALID [2022-04-07 16:43:23,865 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= (ite (or (= v_main_~sn~0_5 16) (= v_main_~sn~0_5 0)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~sn~0=v_main_~sn~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0] {370#false} is VALID [2022-04-07 16:43:23,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {462#(<= main_~i~0 8)} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 8)) InVars {main_~i~0=v_main_~i~0_8} OutVars{main_~i~0=v_main_~i~0_8} AuxVars[] AssignedVars[] {370#false} is VALID [2022-04-07 16:43:23,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {466#(<= main_~i~0 7)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {462#(<= main_~i~0 8)} is VALID [2022-04-07 16:43:23,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {466#(<= main_~i~0 7)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 4)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {466#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:23,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {466#(<= main_~i~0 7)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {466#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:23,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {476#(<= main_~i~0 6)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {466#(<= main_~i~0 7)} is VALID [2022-04-07 16:43:23,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {476#(<= main_~i~0 6)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {476#(<= main_~i~0 6)} is VALID [2022-04-07 16:43:23,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {476#(<= main_~i~0 6)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {476#(<= main_~i~0 6)} is VALID [2022-04-07 16:43:23,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {378#(<= main_~i~0 5)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {476#(<= main_~i~0 6)} is VALID [2022-04-07 16:43:23,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {378#(<= main_~i~0 5)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {378#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:23,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {378#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:23,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= main_~i~0 4)} [64] L24-2-->L24-3: Formula: (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_3, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {378#(<= main_~i~0 5)} is VALID [2022-04-07 16:43:23,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= main_~i~0 4)} [60] L25-->L24-2: Formula: (and (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1) (< v_main_~i~0_1 4)) InVars {main_~sn~0=v_main_~sn~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~sn~0=v_main_~sn~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~sn~0] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 8) InVars {main_~i~0=v_main_~i~0_9} OutVars{main_~i~0=v_main_~i~0_9} AuxVars[] AssignedVars[] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~i~0_5 1)) InVars {} OutVars{main_~sn~0=v_main_~sn~0_3, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[main_~sn~0, main_~i~0] {377#(<= main_~i~0 4)} is VALID [2022-04-07 16:43:23,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {369#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {369#true} {369#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {369#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} [52] 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_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 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] {369#true} is VALID [2022-04-07 16:43:23,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {369#true} is VALID [2022-04-07 16:43:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:43:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417620329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:43:23,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:43:23,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-07 16:43:23,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372314804] [2022-04-07 16:43:23,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:43:23,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 16:43:23,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:43:23,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:23,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:23,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 16:43:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:43:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 16:43:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-07 16:43:23,898 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:24,071 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 16:43:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 16:43:24,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-07 16:43:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:43:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-07 16:43:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-07 16:43:24,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-07 16:43:24,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:43:24,111 INFO L225 Difference]: With dead ends: 36 [2022-04-07 16:43:24,111 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 16:43:24,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2022-04-07 16:43:24,112 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:43:24,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:43:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 16:43:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 16:43:24,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:43:24,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-07 16:43:24,115 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-07 16:43:24,116 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-07 16:43:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:24,117 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 16:43:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 16:43:24,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:24,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:24,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-07 16:43:24,118 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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 36 states. [2022-04-07 16:43:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:43:24,119 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 16:43:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 16:43:24,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:43:24,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:43:24,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:43:24,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:43:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-07 16:43:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-07 16:43:24,129 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 23 [2022-04-07 16:43:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:43:24,129 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-07 16:43:24,129 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:43:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 16:43:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 16:43:24,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:43:24,130 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:43:24,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 16:43:24,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 16:43:24,346 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:43:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:43:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash 838331851, now seen corresponding path program 2 times [2022-04-07 16:43:24,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:43:24,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423130236] [2022-04-07 16:43:24,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:43:24,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:43:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:43:24,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 16:43:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:43:24,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 16:43:24,392 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 16:43:24,393 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:43:24,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 16:43:24,396 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-07 16:43:24,398 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:43:24,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:43:24 BasicIcfg [2022-04-07 16:43:24,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:43:24,414 INFO L158 Benchmark]: Toolchain (without parser) took 2573.52ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 114.0MB in the beginning and 63.6MB in the end (delta: 50.4MB). Peak memory consumption was 84.8MB. Max. memory is 8.0GB. [2022-04-07 16:43:24,414 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 164.6MB. Free memory was 130.2MB in the beginning and 130.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:43:24,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.47ms. Allocated memory is still 164.6MB. Free memory was 113.9MB in the beginning and 140.6MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 16:43:24,414 INFO L158 Benchmark]: Boogie Preprocessor took 25.29ms. Allocated memory is still 164.6MB. Free memory was 140.6MB in the beginning and 139.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 16:43:24,415 INFO L158 Benchmark]: RCFGBuilder took 191.43ms. Allocated memory is still 164.6MB. Free memory was 139.2MB in the beginning and 128.7MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 16:43:24,415 INFO L158 Benchmark]: IcfgTransformer took 14.51ms. Allocated memory is still 164.6MB. Free memory was 128.7MB in the beginning and 127.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 16:43:24,415 INFO L158 Benchmark]: TraceAbstraction took 2132.95ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 127.0MB in the beginning and 63.6MB in the end (delta: 63.3MB). Peak memory consumption was 97.6MB. Max. memory is 8.0GB. [2022-04-07 16:43:24,416 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.09ms. Allocated memory is still 164.6MB. Free memory was 130.2MB in the beginning and 130.1MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.47ms. Allocated memory is still 164.6MB. Free memory was 113.9MB in the beginning and 140.6MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.29ms. Allocated memory is still 164.6MB. Free memory was 140.6MB in the beginning and 139.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 191.43ms. Allocated memory is still 164.6MB. Free memory was 139.2MB in the beginning and 128.7MB in the end (delta: 10.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 14.51ms. Allocated memory is still 164.6MB. Free memory was 128.7MB in the beginning and 127.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2132.95ms. Allocated memory was 164.6MB in the beginning and 198.2MB in the end (delta: 33.6MB). Free memory was 127.0MB in the beginning and 63.6MB in the end (delta: 63.3MB). Peak memory consumption was 97.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int i, sn=0; [L24] i=1 VAL [i=1, sn=0] [L24] COND TRUE i<=8 VAL [i=1, sn=0] [L25] COND TRUE i<4 [L26] sn = sn + (2) VAL [i=1, sn=2] [L24] i++ VAL [i=2, sn=2] [L24] COND TRUE i<=8 VAL [i=2, sn=2] [L25] COND TRUE i<4 [L26] sn = sn + (2) VAL [i=2, sn=4] [L24] i++ VAL [i=3, sn=4] [L24] COND TRUE i<=8 VAL [i=3, sn=4] [L25] COND TRUE i<4 [L26] sn = sn + (2) VAL [i=3, sn=6] [L24] i++ VAL [i=4, sn=6] [L24] COND TRUE i<=8 VAL [i=4, sn=6] [L25] COND FALSE !(i<4) VAL [i=4, sn=6] [L24] i++ VAL [i=5, sn=6] [L24] COND TRUE i<=8 VAL [i=5, sn=6] [L25] COND FALSE !(i<4) VAL [i=5, sn=6] [L24] i++ VAL [i=6, sn=6] [L24] COND TRUE i<=8 VAL [i=6, sn=6] [L25] COND FALSE !(i<4) VAL [i=6, sn=6] [L24] i++ VAL [i=7, sn=6] [L24] COND TRUE i<=8 VAL [i=7, sn=6] [L25] COND FALSE !(i<4) VAL [i=7, sn=6] [L24] i++ VAL [i=8, sn=6] [L24] COND TRUE i<=8 VAL [i=8, sn=6] [L25] COND FALSE !(i<4) VAL [i=8, sn=6] [L24] i++ VAL [i=9, sn=6] [L24] COND FALSE !(i<=8) VAL [i=9, sn=6] [L28] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 54 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 126 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/69 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-07 16:43:24,441 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...