/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/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:42:51,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:42:51,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:42:51,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:42:51,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:42:51,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:42:51,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:42:51,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:42:51,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:42:51,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:42:51,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:42:51,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:42:51,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:42:51,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:42:51,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:42:51,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:42:51,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:42:51,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:42:51,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:42:51,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:42:51,113 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:42:51,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:42:51,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:42:51,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:42:51,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:42:51,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:42:51,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:42:51,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:42:51,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:42:51,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:42:51,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:42:51,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:42:51,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:42:51,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:42:51,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:42:51,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:42:51,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:42:51,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:42:51,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:42:51,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:42:51,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:42:51,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:42:51,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:42:51,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:42:51,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:42:51,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:42:51,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:42:51,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:42:51,132 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:42:51,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:42:51,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:42:51,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:42:51,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:42:51,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:42:51,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:42:51,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:42:51,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:42:51,134 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:42:51,134 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:42:51,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:42:51,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:42:51,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:42:51,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:42:51,320 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:42:51,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2022-04-07 16:42:51,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65426e6a9/1b443805fbb84944bc17d08ea98cbfb2/FLAGc7335ab24 [2022-04-07 16:42:51,644 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:42:51,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2022-04-07 16:42:51,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65426e6a9/1b443805fbb84944bc17d08ea98cbfb2/FLAGc7335ab24 [2022-04-07 16:42:52,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65426e6a9/1b443805fbb84944bc17d08ea98cbfb2 [2022-04-07 16:42:52,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:42:52,078 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:42:52,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:42:52,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:42:52,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:42:52,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c81a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52, skipping insertion in model container [2022-04-07 16:42:52,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:42:52,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:42:52,236 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/sum01-1.i[808,821] [2022-04-07 16:42:52,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:42:52,277 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:42:52,287 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/sum01-1.i[808,821] [2022-04-07 16:42:52,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:42:52,305 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:42:52,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52 WrapperNode [2022-04-07 16:42:52,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:42:52,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:42:52,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:42:52,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:42:52,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:42:52,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:42:52,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:42:52,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:42:52,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:42:52,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:42:52,365 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:42:52,366 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:42:52,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:42:52,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:42:52,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:42:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:42:52,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:42:52,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:42:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:42:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:42:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:42:52,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:42:52,497 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:42:52,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:42:52,669 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:42:52,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:42:52,673 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:42:52,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:42:52 BoogieIcfgContainer [2022-04-07 16:42:52,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:42:52,675 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:42:52,675 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:42:52,678 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:42:52,680 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:42:52" (1/1) ... [2022-04-07 16:42:52,682 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:42:52,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:42:52 BasicIcfg [2022-04-07 16:42:52,710 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:42:52,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:42:52,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:42:52,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:42:52,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:42:52" (1/4) ... [2022-04-07 16:42:52,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c71a976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:42:52, skipping insertion in model container [2022-04-07 16:42:52,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:42:52" (2/4) ... [2022-04-07 16:42:52,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c71a976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:42:52, skipping insertion in model container [2022-04-07 16:42:52,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:42:52" (3/4) ... [2022-04-07 16:42:52,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c71a976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:42:52, skipping insertion in model container [2022-04-07 16:42:52,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:42:52" (4/4) ... [2022-04-07 16:42:52,715 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01-1.iJordan [2022-04-07 16:42:52,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:42:52,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:42:52,742 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:42:52,746 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:42:52,746 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:42:52,756 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:42:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:42:52,768 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:52,769 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:42:52,769 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:52,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash -423489079, now seen corresponding path program 1 times [2022-04-07 16:42:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:52,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702036083] [2022-04-07 16:42:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:42:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:52,921 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:42:52,922 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:42:52,922 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:42:52,923 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:42:52,924 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:42:52,924 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:42:52,925 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:42:52,925 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:42:52,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {23#true} is VALID [2022-04-07 16:42:52,926 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:42:52,927 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {24#false} is VALID [2022-04-07 16:42:52,928 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:42:52,928 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:42:52,928 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:42:52,929 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:42:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:42:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702036083] [2022-04-07 16:42:52,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702036083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:42:52,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:42:52,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 16:42:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392048242] [2022-04-07 16:42:52,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:42:52,939 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:42:52,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:42:52,942 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:42:52,961 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:42:52,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 16:42:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:42:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 16:42:52,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:42:52,986 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:42:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:53,048 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-07 16:42:53,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 16:42:53,048 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:42:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:42:53,049 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:42:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 16:42:53,056 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:42:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 16:42:53,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-07 16:42:53,080 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:42:53,084 INFO L225 Difference]: With dead ends: 20 [2022-04-07 16:42:53,085 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 16:42:53,086 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:42:53,088 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:42:53,089 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:42:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 16:42:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 16:42:53,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:42:53,110 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:42:53,110 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:42:53,110 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:42:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:53,114 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 16:42:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 16:42:53,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:53,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:53,115 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:42:53,115 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:42:53,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:53,117 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-07 16:42:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 16:42:53,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:53,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:53,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:42:53,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:42:53,121 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:42:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-07 16:42:53,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-07 16:42:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:42:53,127 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-07 16:42:53,128 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:42:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-07 16:42:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 16:42:53,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:53,130 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:42:53,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:42:53,131 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -422565558, now seen corresponding path program 1 times [2022-04-07 16:42:53,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:53,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876584827] [2022-04-07 16:42:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:53,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:53,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:42:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:53,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#(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:42:53,218 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:42:53,218 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:42:53,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {93#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:42:53,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#(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:42:53,219 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:42:53,219 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:42:53,219 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:42:53,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:53,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:53,222 INFO L272 TraceCheckUtils]: 7: Hoare triple {98#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {99#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:42:53,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {99#(not (= |__VERIFIER_assert_#in~cond| 0))} [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] {100#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:42:53,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {100#(not (= __VERIFIER_assert_~cond 0))} [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:42:53,223 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:42:53,223 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:42:53,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:42:53,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876584827] [2022-04-07 16:42:53,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876584827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:42:53,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:42:53,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 16:42:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875142521] [2022-04-07 16:42:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:42:53,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 16:42:53,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:42:53,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:53,234 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:42:53,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 16:42:53,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:42:53,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 16:42:53,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:42:53,236 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:53,367 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-07 16:42:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 16:42:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-07 16:42:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:42:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-07 16:42:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-07 16:42:53,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-07 16:42:53,398 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:42:53,399 INFO L225 Difference]: With dead ends: 20 [2022-04-07 16:42:53,399 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 16:42:53,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 16:42:53,400 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:42:53,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:42:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 16:42:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-07 16:42:53,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:42:53,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:42:53,403 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:42:53,403 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:42:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:53,404 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 16:42:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 16:42:53,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:53,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:53,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:42:53,405 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:42:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:53,406 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-07 16:42:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 16:42:53,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:53,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:53,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:42:53,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:42:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:42:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-07 16:42:53,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-07 16:42:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:42:53,424 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-07 16:42:53,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-07 16:42:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 16:42:53,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:53,424 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:42:53,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:42:53,425 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:53,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1744981802, now seen corresponding path program 1 times [2022-04-07 16:42:53,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:53,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308193198] [2022-04-07 16:42:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:53,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:42:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:53,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(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] {181#true} is VALID [2022-04-07 16:42:53,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:53,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:53,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:42:53,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(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] {181#true} is VALID [2022-04-07 16:42:53,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:53,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:53,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:53,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:53,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {187#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:53,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {188#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~0)))} is VALID [2022-04-07 16:42:53,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#(and (or (<= (* main_~n~0 2) main_~sn~0) (<= 2 main_~sn~0)) (= (+ (- 1) main_~i~0) 0) (not (<= (+ (* main_~n~0 2) 1) main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {189#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-07 16:42:53,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {189#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {190#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:53,651 INFO L272 TraceCheckUtils]: 10: Hoare triple {190#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:42:53,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} [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] {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:42:53,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} [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[] {182#false} is VALID [2022-04-07 16:42:53,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:42:53,654 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:42:53,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:42:53,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308193198] [2022-04-07 16:42:53,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308193198] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:42:53,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431092898] [2022-04-07 16:42:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:53,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:42:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:42:53,656 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:42:53,683 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:42:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:53,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 16:42:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:53,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:42:54,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#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] {181#true} is VALID [2022-04-07 16:42:54,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:54,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {187#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:54,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(and (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {218#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-07 16:42:54,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 2) main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {222#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-07 16:42:54,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {222#(and (<= 1 main_~n~0) (<= main_~i~0 2) (= (+ (- 2) main_~sn~0) 0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {226#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} is VALID [2022-04-07 16:42:54,076 INFO L272 TraceCheckUtils]: 10: Hoare triple {226#(and (<= 1 main_~n~0) (< main_~n~0 2) (= (+ (- 2) main_~sn~0) 0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:42:54,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} [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] {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:42:54,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} [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[] {182#false} is VALID [2022-04-07 16:42:54,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:42:54,078 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:42:54,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:42:54,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:42:54,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} [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[] {182#false} is VALID [2022-04-07 16:42:54,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} [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] {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:42:54,374 INFO L272 TraceCheckUtils]: 10: Hoare triple {250#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:42:54,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {250#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:54,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {258#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {254#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:54,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {258#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:54,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {262#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 16:42:54,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {266#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 16:42:54,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#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] {181#true} is VALID [2022-04-07 16:42:54,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:42:54,379 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:42:54,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431092898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:42:54,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:42:54,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-04-07 16:42:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827957111] [2022-04-07 16:42:54,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:42:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 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:42:54,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:42:54,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:54,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:42:54,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-07 16:42:54,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:42:54,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-07 16:42:54,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-07 16:42:54,412 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:54,860 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 16:42:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 16:42:54,860 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 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:42:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:42:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2022-04-07 16:42:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2022-04-07 16:42:54,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 31 transitions. [2022-04-07 16:42:54,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:42:54,888 INFO L225 Difference]: With dead ends: 26 [2022-04-07 16:42:54,888 INFO L226 Difference]: Without dead ends: 22 [2022-04-07 16:42:54,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2022-04-07 16:42:54,889 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:42:54,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 16:42:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-07 16:42:54,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-07 16:42:54,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:42:54,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:42:54,891 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:42:54,892 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:42:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:54,893 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-07 16:42:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-07 16:42:54,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:54,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:54,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 22 states. [2022-04-07 16:42:54,893 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 22 states. [2022-04-07 16:42:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:54,894 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-07 16:42:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-07 16:42:54,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:54,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:54,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:42:54,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:42:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:42:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-07 16:42:54,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-07 16:42:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:42:54,896 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-07 16:42:54,896 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-07 16:42:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 16:42:54,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:54,897 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:42:54,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 16:42:55,115 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:42:55,115 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1411179434, now seen corresponding path program 2 times [2022-04-07 16:42:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:55,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529209973] [2022-04-07 16:42:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:55,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:42:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:55,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#(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] {400#true} is VALID [2022-04-07 16:42:55,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {400#true} {400#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {400#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:42:55,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#(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] {400#true} is VALID [2022-04-07 16:42:55,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {400#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {400#true} {400#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {400#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:55,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:55,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {406#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:42:55,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {407#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-07 16:42:55,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {407#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {407#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-07 16:42:55,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {407#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {408#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:55,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {408#(and (<= main_~sn~0 (* main_~i~0 2)) (<= (* main_~i~0 2) main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {407#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} is VALID [2022-04-07 16:42:55,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {407#(and (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (+ 2 main_~sn~0) (* main_~i~0 2)))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {409#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} is VALID [2022-04-07 16:42:55,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {409#(and (<= (+ 2 main_~sn~0) (* main_~n~0 2)) (<= (* main_~i~0 2) (+ 2 main_~sn~0)))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {410#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-07 16:42:55,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {410#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) main_~sn~0) (<= (* main_~n~0 2) main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {411#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} is VALID [2022-04-07 16:42:55,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {411#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (or (<= (* main_~i~0 2) (+ 2 main_~sn~0)) (<= (* main_~n~0 2) main_~sn~0)))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {412#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:55,336 INFO L272 TraceCheckUtils]: 16: Hoare triple {412#(and (< main_~sn~0 (+ (* main_~n~0 2) 1)) (<= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {413#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:42:55,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {413#(not (= |__VERIFIER_assert_#in~cond| 0))} [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] {414#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:42:55,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {414#(not (= __VERIFIER_assert_~cond 0))} [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[] {401#false} is VALID [2022-04-07 16:42:55,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {401#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#false} is VALID [2022-04-07 16:42:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 16:42:55,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:42:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529209973] [2022-04-07 16:42:55,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529209973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:42:55,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948667228] [2022-04-07 16:42:55,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 16:42:55,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:42:55,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:42:55,344 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:42:55,349 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:42:55,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 16:42:55,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 16:42:55,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 16:42:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:55,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:42:55,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {400#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#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] {400#true} is VALID [2022-04-07 16:42:55,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {400#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {400#true} {400#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {400#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:55,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:55,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-07 16:42:55,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#(and (= main_~sn~0 0) (= (+ (- 1) main_~i~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {406#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:42:55,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {406#(and (<= main_~sn~0 2) (= (+ (- 1) main_~i~0) 0) (<= 2 main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {443#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:42:55,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {443#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {443#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2022-04-07 16:42:55,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {443#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {450#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= main_~i~0 2))} is VALID [2022-04-07 16:42:55,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {454#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-07 16:42:55,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (= (+ (- 1) main_~i~0) 2))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {458#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-07 16:42:55,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#(and (<= 4 main_~sn~0) (<= main_~sn~0 4) (<= main_~i~0 main_~n~0) (= (+ (- 1) main_~i~0) 2))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {462#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) main_~i~0) 2))} is VALID [2022-04-07 16:42:55,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#(and (<= 6 main_~sn~0) (<= main_~i~0 main_~n~0) (<= main_~sn~0 6) (= (+ (- 1) 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {466#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2022-04-07 16:42:55,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {466#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (<= main_~sn~0 6) (<= main_~i~0 4))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {470#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} is VALID [2022-04-07 16:42:55,802 INFO L272 TraceCheckUtils]: 16: Hoare triple {470#(and (<= 6 main_~sn~0) (<= 3 main_~n~0) (< main_~n~0 4) (<= main_~sn~0 6))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {474#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:42:55,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {474#(<= 1 |__VERIFIER_assert_#in~cond|)} [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] {478#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:42:55,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#(<= 1 __VERIFIER_assert_~cond)} [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[] {401#false} is VALID [2022-04-07 16:42:55,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {401#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#false} is VALID [2022-04-07 16:42:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:42:55,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:42:56,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {401#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {401#false} is VALID [2022-04-07 16:42:56,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#(<= 1 __VERIFIER_assert_~cond)} [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[] {401#false} is VALID [2022-04-07 16:42:56,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {474#(<= 1 |__VERIFIER_assert_#in~cond|)} [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] {478#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:42:56,276 INFO L272 TraceCheckUtils]: 16: Hoare triple {494#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {474#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:42:56,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {494#(or (= main_~sn~0 0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:56,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {502#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {498#(or (= main_~sn~0 0) (<= main_~i~0 main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:56,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {506#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {502#(or (= main_~sn~0 0) (<= (+ main_~i~0 1) main_~n~0) (= (* main_~n~0 2) main_~sn~0))} is VALID [2022-04-07 16:42:56,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {510#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {506#(or (<= (+ main_~i~0 1) main_~n~0) (= (+ 2 main_~sn~0) (* main_~n~0 2)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 16:42:56,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {514#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {510#(or (and (<= (+ main_~i~0 1) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) main_~i~0)) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 16:42:56,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {514#(or (and (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 3)) (- 2))) (<= (div (+ (- 2) (* (- 1) main_~sn~0)) (- 2)) (+ main_~i~0 1))) (= (+ 2 main_~sn~0) 0))} is VALID [2022-04-07 16:42:56,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {518#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 16:42:56,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {525#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {518#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 1)) (<= (+ main_~i~0 2) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 16:42:56,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {525#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 4)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 5)) (- 2)))) (= (+ main_~sn~0 4) 0))} is VALID [2022-04-07 16:42:56,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {529#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-07 16:42:56,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {400#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {529#(or (and (<= (div (+ (* (- 1) main_~sn~0) (- 6)) (- 2)) (+ main_~i~0 2)) (<= (+ main_~i~0 3) (div (+ (* (- 1) main_~sn~0) (- 7)) (- 2)))) (= (+ 6 main_~sn~0) 0))} is VALID [2022-04-07 16:42:56,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {400#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:56,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {400#true} {400#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:56,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {400#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:56,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {400#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] {400#true} is VALID [2022-04-07 16:42:56,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {400#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {400#true} is VALID [2022-04-07 16:42:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:42:56,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948667228] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:42:56,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:42:56,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-04-07 16:42:56,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670660028] [2022-04-07 16:42:56,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:42:56,289 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 16:42:56,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:42:56,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:56,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:42:56,320 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-07 16:42:56,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:42:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-07 16:42:56,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2022-04-07 16:42:56,321 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:57,296 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-07 16:42:57,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 16:42:57,297 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 16:42:57,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:42:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-07 16:42:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-07 16:42:57,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 40 transitions. [2022-04-07 16:42:57,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:42:57,333 INFO L225 Difference]: With dead ends: 34 [2022-04-07 16:42:57,333 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 16:42:57,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 16:42:57,335 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 16:42:57,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 86 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 16:42:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 16:42:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-07 16:42:57,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:42:57,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:42:57,337 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:42:57,337 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:42:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:57,338 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-07 16:42:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-07 16:42:57,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:57,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:57,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 30 states. [2022-04-07 16:42:57,339 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 30 states. [2022-04-07 16:42:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:57,340 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-07 16:42:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-07 16:42:57,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:57,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:57,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:42:57,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:42:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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:42:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-07 16:42:57,341 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2022-04-07 16:42:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:42:57,341 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-07 16:42:57,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:42:57,341 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-07 16:42:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 16:42:57,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:57,342 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:42:57,368 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:42:57,569 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:42:57,569 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:57,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1657807639, now seen corresponding path program 1 times [2022-04-07 16:42:57,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:57,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517099717] [2022-04-07 16:42:57,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:57,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:42:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:57,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {723#(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] {713#true} is VALID [2022-04-07 16:42:57,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {713#true} {713#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {713#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:42:57,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {723#(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] {713#true} is VALID [2022-04-07 16:42:57,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {713#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {718#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:42:57,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {718#(= (+ (- 1) main_~i~0) 0)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {718#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:42:57,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {718#(= (+ (- 1) main_~i~0) 0)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {718#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-07 16:42:57,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {718#(= (+ (- 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {719#(<= main_~i~0 2)} is VALID [2022-04-07 16:42:57,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {719#(<= main_~i~0 2)} is VALID [2022-04-07 16:42:57,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {719#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {719#(<= main_~i~0 2)} is VALID [2022-04-07 16:42:57,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {719#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {720#(<= main_~i~0 3)} is VALID [2022-04-07 16:42:57,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {720#(<= main_~i~0 3)} is VALID [2022-04-07 16:42:57,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {720#(<= main_~i~0 3)} is VALID [2022-04-07 16:42:57,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {721#(<= main_~i~0 4)} is VALID [2022-04-07 16:42:57,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {721#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {721#(<= main_~i~0 4)} is VALID [2022-04-07 16:42:57,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {721#(<= main_~i~0 4)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {721#(<= main_~i~0 4)} is VALID [2022-04-07 16:42:57,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {721#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {722#(<= main_~i~0 5)} is VALID [2022-04-07 16:42:57,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {722#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {722#(<= main_~i~0 5)} is VALID [2022-04-07 16:42:57,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {722#(<= main_~i~0 5)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 10)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {714#false} [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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {714#false} is VALID [2022-04-07 16:42:57,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,664 INFO L272 TraceCheckUtils]: 22: Hoare triple {714#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {714#false} is VALID [2022-04-07 16:42:57,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {714#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] {714#false} is VALID [2022-04-07 16:42:57,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {714#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[] {714#false} is VALID [2022-04-07 16:42:57,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {714#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,665 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:42:57,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:42:57,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517099717] [2022-04-07 16:42:57,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517099717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:42:57,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35867671] [2022-04-07 16:42:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:57,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:42:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:42:57,668 INFO L229 MonitoredProcess]: Starting monitored process 4 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:42:57,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 16:42:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:57,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 16:42:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:42:57,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {713#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#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] {713#true} is VALID [2022-04-07 16:42:57,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {713#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {742#(<= main_~i~0 1)} is VALID [2022-04-07 16:42:57,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {742#(<= main_~i~0 1)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {742#(<= main_~i~0 1)} is VALID [2022-04-07 16:42:57,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {742#(<= main_~i~0 1)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {742#(<= main_~i~0 1)} is VALID [2022-04-07 16:42:57,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {742#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {719#(<= main_~i~0 2)} is VALID [2022-04-07 16:42:57,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#(<= main_~i~0 2)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {719#(<= main_~i~0 2)} is VALID [2022-04-07 16:42:57,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {719#(<= main_~i~0 2)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {719#(<= main_~i~0 2)} is VALID [2022-04-07 16:42:57,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {719#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {720#(<= main_~i~0 3)} is VALID [2022-04-07 16:42:57,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#(<= main_~i~0 3)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {720#(<= main_~i~0 3)} is VALID [2022-04-07 16:42:57,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#(<= main_~i~0 3)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {720#(<= main_~i~0 3)} is VALID [2022-04-07 16:42:57,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {721#(<= main_~i~0 4)} is VALID [2022-04-07 16:42:57,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {721#(<= main_~i~0 4)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {721#(<= main_~i~0 4)} is VALID [2022-04-07 16:42:57,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {721#(<= main_~i~0 4)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {721#(<= main_~i~0 4)} is VALID [2022-04-07 16:42:57,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {721#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {722#(<= main_~i~0 5)} is VALID [2022-04-07 16:42:57,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {722#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {722#(<= main_~i~0 5)} is VALID [2022-04-07 16:42:57,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {722#(<= main_~i~0 5)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 10)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {714#false} [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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {714#false} is VALID [2022-04-07 16:42:57,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,841 INFO L272 TraceCheckUtils]: 22: Hoare triple {714#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {714#false} is VALID [2022-04-07 16:42:57,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {714#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] {714#false} is VALID [2022-04-07 16:42:57,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {714#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[] {714#false} is VALID [2022-04-07 16:42:57,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {714#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:42:57,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:42:57,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {714#false} [67] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {714#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[] {714#false} is VALID [2022-04-07 16:42:57,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {714#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] {714#false} is VALID [2022-04-07 16:42:57,967 INFO L272 TraceCheckUtils]: 22: Hoare triple {714#false} [59] L24-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~sn~0_5 (* v_main_~n~0_5 2)) (= v_main_~sn~0_5 0)) 1 0)) InVars {main_~sn~0=v_main_~sn~0_5, main_~n~0=v_main_~n~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~sn~0, main_~n~0] {714#false} is VALID [2022-04-07 16:42:57,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#false} [57] L24-3-->L24-4: Formula: (not (<= v_main_~i~0_8 v_main_~n~0_3)) InVars {main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_3} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {714#false} [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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {714#false} is VALID [2022-04-07 16:42:57,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(< main_~i~0 10)} [61] L25-->L24-2: Formula: (not (< v_main_~i~0_2 10)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_~i~0=v_main_~i~0_2} AuxVars[] AssignedVars[] {714#false} is VALID [2022-04-07 16:42:57,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(< main_~i~0 10)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {821#(< main_~i~0 10)} is VALID [2022-04-07 16:42:57,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {828#(< main_~i~0 9)} [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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {821#(< main_~i~0 10)} is VALID [2022-04-07 16:42:57,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#(< main_~i~0 9)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {828#(< main_~i~0 9)} is VALID [2022-04-07 16:42:57,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#(< main_~i~0 9)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {828#(< main_~i~0 9)} is VALID [2022-04-07 16:42:57,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {838#(< main_~i~0 8)} [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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {828#(< main_~i~0 9)} is VALID [2022-04-07 16:42:57,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#(< main_~i~0 8)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {838#(< main_~i~0 8)} is VALID [2022-04-07 16:42:57,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#(< main_~i~0 8)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {838#(< main_~i~0 8)} is VALID [2022-04-07 16:42:57,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {848#(< 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {838#(< main_~i~0 8)} is VALID [2022-04-07 16:42:57,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {848#(< main_~i~0 7)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {848#(< main_~i~0 7)} is VALID [2022-04-07 16:42:57,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#(< main_~i~0 7)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {848#(< main_~i~0 7)} is VALID [2022-04-07 16:42:57,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(<= 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~post2=|v_main_#t~post2_1|} AuxVars[] AssignedVars[main_~i~0, main_#t~post2] {848#(< main_~i~0 7)} is VALID [2022-04-07 16:42:57,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {722#(<= main_~i~0 5)} [60] L25-->L24-2: Formula: (and (< v_main_~i~0_1 10) (= (+ v_main_~sn~0_2 2) v_main_~sn~0_1)) 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] {722#(<= main_~i~0 5)} is VALID [2022-04-07 16:42:57,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {722#(<= main_~i~0 5)} [58] L24-3-->L25: Formula: (<= v_main_~i~0_9 v_main_~n~0_4) InVars {main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_9, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {722#(<= main_~i~0 5)} is VALID [2022-04-07 16:42:57,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#true} [54] mainENTRY-->L24-3: Formula: (and (= v_main_~sn~0_3 0) (= v_main_~n~0_1 (let ((.cse0 (mod |v_main_#t~nondet1_2| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_main_~i~0_5 1)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_1, main_~sn~0=v_main_~sn~0_3} AuxVars[] AssignedVars[main_~sn~0, main_#t~nondet1, main_~i~0, main_~n~0] {722#(<= main_~i~0 5)} is VALID [2022-04-07 16:42:57,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {713#true} [51] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} [70] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#true} [55] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#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] {713#true} is VALID [2022-04-07 16:42:57,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {713#true} [50] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {713#true} is VALID [2022-04-07 16:42:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 16:42:57,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35867671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:42:57,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:42:57,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-07 16:42:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326624109] [2022-04-07 16:42:57,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:42:57,976 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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 26 [2022-04-07 16:42:57,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:42:57,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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:42:58,005 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:42:58,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-07 16:42:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:42:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-07 16:42:58,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-07 16:42:58,006 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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:42:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:58,206 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-07 16:42:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-07 16:42:58,206 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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 26 [2022-04-07 16:42:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:42:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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:42:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-07 16:42:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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:42:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2022-04-07 16:42:58,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2022-04-07 16:42:58,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:42:58,255 INFO L225 Difference]: With dead ends: 44 [2022-04-07 16:42:58,255 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 16:42:58,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2022-04-07 16:42:58,256 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:42:58,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 39 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 16:42:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 16:42:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-07 16:42:58,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:42:58,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:42:58,261 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:42:58,261 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:42:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:58,262 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-07 16:42:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-07 16:42:58,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:58,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:58,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 44 states. [2022-04-07 16:42:58,263 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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 44 states. [2022-04-07 16:42:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:58,264 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-07 16:42:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-07 16:42:58,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:58,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:58,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:42:58,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:42:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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:42:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-07 16:42:58,265 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 26 [2022-04-07 16:42:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:42:58,266 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-07 16:42:58,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 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:42:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-07 16:42:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 16:42:58,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:58,266 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:42:58,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 16:42:58,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:42:58,476 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2063074549, now seen corresponding path program 2 times [2022-04-07 16:42:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:58,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274879247] [2022-04-07 16:42:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:42:58,513 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 16:42:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 16:42:58,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 16:42:58,558 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 16:42:58,559 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:42:58,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 16:42:58,568 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-07 16:42:58,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:42:58,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:42:58 BasicIcfg [2022-04-07 16:42:58,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:42:58,594 INFO L158 Benchmark]: Toolchain (without parser) took 6515.71ms. Allocated memory was 205.5MB in the beginning and 319.8MB in the end (delta: 114.3MB). Free memory was 151.5MB in the beginning and 221.3MB in the end (delta: -69.8MB). Peak memory consumption was 44.5MB. Max. memory is 8.0GB. [2022-04-07 16:42:58,594 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 167.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:42:58,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.60ms. Allocated memory was 205.5MB in the beginning and 266.3MB in the end (delta: 60.8MB). Free memory was 151.3MB in the beginning and 236.5MB in the end (delta: -85.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-07 16:42:58,595 INFO L158 Benchmark]: Boogie Preprocessor took 32.50ms. Allocated memory is still 266.3MB. Free memory was 236.5MB in the beginning and 234.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 16:42:58,595 INFO L158 Benchmark]: RCFGBuilder took 334.88ms. Allocated memory is still 266.3MB. Free memory was 234.8MB in the beginning and 224.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-07 16:42:58,595 INFO L158 Benchmark]: IcfgTransformer took 34.76ms. Allocated memory is still 266.3MB. Free memory was 224.3MB in the beginning and 222.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:42:58,595 INFO L158 Benchmark]: TraceAbstraction took 5882.52ms. Allocated memory was 266.3MB in the beginning and 319.8MB in the end (delta: 53.5MB). Free memory was 222.3MB in the beginning and 221.3MB in the end (delta: 927.1kB). Peak memory consumption was 55.4MB. Max. memory is 8.0GB. [2022-04-07 16:42:58,596 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 205.5MB. Free memory is still 167.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.60ms. Allocated memory was 205.5MB in the beginning and 266.3MB in the end (delta: 60.8MB). Free memory was 151.3MB in the beginning and 236.5MB in the end (delta: -85.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.50ms. Allocated memory is still 266.3MB. Free memory was 236.5MB in the beginning and 234.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 334.88ms. Allocated memory is still 266.3MB. Free memory was 234.8MB in the beginning and 224.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 34.76ms. Allocated memory is still 266.3MB. Free memory was 224.3MB in the beginning and 222.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5882.52ms. Allocated memory was 266.3MB in the beginning and 319.8MB in the end (delta: 53.5MB). Free memory was 222.3MB in the beginning and 221.3MB in the end (delta: 927.1kB). Peak memory consumption was 55.4MB. 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, n=__VERIFIER_nondet_uint(), sn=0; [L23] int i, n=__VERIFIER_nondet_uint(), sn=0; [L24] i=1 VAL [i=1, n=10, n=0] [L24] COND TRUE i<=n VAL [i=1, n=10, n=0] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=1, n=10, n=2] [L24] i++ VAL [i=2, n=2, n=10] [L24] COND TRUE i<=n VAL [i=2, n=10, n=2] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=2, n=4, n=10] [L24] i++ VAL [i=3, n=4, n=10] [L24] COND TRUE i<=n VAL [i=3, n=10, n=4] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=3, n=6, n=10] [L24] i++ VAL [i=4, n=10, n=6] [L24] COND TRUE i<=n VAL [i=4, n=10, n=6] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=4, n=10, n=8] [L24] i++ VAL [i=5, n=8, n=10] [L24] COND TRUE i<=n VAL [i=5, n=8, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=5, n=10, n=10] [L24] i++ VAL [i=6, n=10, n=10] [L24] COND TRUE i<=n VAL [i=6, n=10, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=6, n=12, n=10] [L24] i++ VAL [i=7, n=10, n=12] [L24] COND TRUE i<=n VAL [i=7, n=12, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=7, n=14, n=10] [L24] i++ VAL [i=8, n=10, n=14] [L24] COND TRUE i<=n VAL [i=8, n=10, n=14] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=8, n=10, n=16] [L24] i++ VAL [i=9, n=10, n=16] [L24] COND TRUE i<=n VAL [i=9, n=16, n=10] [L25] COND TRUE i<10 [L26] sn = sn + (2) VAL [i=9, n=18, n=10] [L24] i++ VAL [i=10, n=18, n=10] [L24] COND TRUE i<=n VAL [i=10, n=18, n=10] [L25] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L24] i++ VAL [i=11, n=18, n=10] [L24] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L28] CALL __VERIFIER_assert(sn==n*(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: 5.8s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 522 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 62 mSDtfsCounter, 522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=5, InterpolantAutomatonStates: 57, 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, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1066 SizeOfPredicates, 6 NumberOfNonLiveVariables, 205 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 28/144 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:42:58,621 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...