/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/array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:41:43,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:41:43,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:41:43,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:41:43,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:41:43,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:41:43,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:41:43,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:41:43,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:41:43,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:41:43,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:41:43,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:41:43,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:41:43,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:41:43,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:41:43,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:41:43,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:41:43,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:41:43,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:41:43,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:41:43,701 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:41:43,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:41:43,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:41:43,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:41:43,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:41:43,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:41:43,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:41:43,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:41:43,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:41:43,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:41:43,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:41:43,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:41:43,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:41:43,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:41:43,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:41:43,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:41:43,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:41:43,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:41:43,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:41:43,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:41:43,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:41:43,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:41:43,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:41:43,735 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:41:43,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:41:43,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:41:43,737 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:41:43,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:41:43,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:41:43,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:41:43,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:41:43,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:41:43,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:41:43,738 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:41:43,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:41:43,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:41:43,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:41:43,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:41:43,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:41:43,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:41:43,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:41:43,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:43,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:41:43,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:41:43,740 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:41:43,741 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:41:43,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:41:43,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:41:44,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:41:44,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:41:44,002 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:41:44,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/array-1.c [2022-04-07 16:41:44,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0a63e13/3b6a100aef244d4680a660ba6c358d5b/FLAGcc6fdbba6 [2022-04-07 16:41:44,444 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:41:44,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/array-1.c [2022-04-07 16:41:44,455 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0a63e13/3b6a100aef244d4680a660ba6c358d5b/FLAGcc6fdbba6 [2022-04-07 16:41:44,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0a63e13/3b6a100aef244d4680a660ba6c358d5b [2022-04-07 16:41:44,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:41:44,876 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:41:44,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:44,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:41:44,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:41:44,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aba2399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:44, skipping insertion in model container [2022-04-07 16:41:44,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:44" (1/1) ... [2022-04-07 16:41:44,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:41:44,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:41:45,031 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/array-1.c[319,332] [2022-04-07 16:41:45,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:45,086 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:41:45,099 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/array-1.c[319,332] [2022-04-07 16:41:45,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:45,117 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:41:45,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45 WrapperNode [2022-04-07 16:41:45,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:45,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:41:45,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:41:45,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:41:45,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:41:45,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:41:45,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:41:45,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:41:45,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:41:45,201 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:41:45,212 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:41:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:41:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:41:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:41:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:41:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:41:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:41:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:41:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:41:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:41:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:41:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 16:41:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:41:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-07 16:41:45,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:41:45,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:41:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:41:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:41:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:41:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:41:45,314 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:41:45,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:41:45,504 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:41:45,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:41:45,511 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:41:45,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:45 BoogieIcfgContainer [2022-04-07 16:41:45,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:41:45,513 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:41:45,513 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:41:45,528 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:41:45,531 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:45" (1/1) ... [2022-04-07 16:41:45,533 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:41:45,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:45 BasicIcfg [2022-04-07 16:41:45,586 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:41:45,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:41:45,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:41:45,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:41:45,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:41:44" (1/4) ... [2022-04-07 16:41:45,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dea3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:45, skipping insertion in model container [2022-04-07 16:41:45,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:45" (2/4) ... [2022-04-07 16:41:45,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dea3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:45, skipping insertion in model container [2022-04-07 16:41:45,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:45" (3/4) ... [2022-04-07 16:41:45,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72dea3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:41:45, skipping insertion in model container [2022-04-07 16:41:45,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:45" (4/4) ... [2022-04-07 16:41:45,593 INFO L111 eAbstractionObserver]: Analyzing ICFG array-1.cJordan [2022-04-07 16:41:45,599 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:41:45,599 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:41:45,655 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:41:45,672 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:41:45,673 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:41:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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:41:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 16:41:45,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:45,702 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:41:45,703 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash -822380801, now seen corresponding path program 1 times [2022-04-07 16:41:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:45,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941162909] [2022-04-07 16:41:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:45,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:45,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 16:41:45,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 16:41:45,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 16:41:45,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:41:45,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {25#true} is VALID [2022-04-07 16:41:45,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 16:41:45,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 16:41:45,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#true} is VALID [2022-04-07 16:41:45,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_1| (* (let ((.cse0 (mod v_main_~SIZE~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4))) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {25#true} is VALID [2022-04-07 16:41:45,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} [53] L21-3-->L21-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 16:41:45,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {26#false} is VALID [2022-04-07 16:41:45,985 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {26#false} is VALID [2022-04-07 16:41:45,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {26#false} is VALID [2022-04-07 16:41:45,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 16:41:45,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#false} is VALID [2022-04-07 16:41:45,987 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:41:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:45,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941162909] [2022-04-07 16:41:45,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941162909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:45,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:45,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 16:41:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581158897] [2022-04-07 16:41:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:45,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 16:41:45,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:46,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:46,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 16:41:46,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:46,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 16:41:46,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 16:41:46,060 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:46,135 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-07 16:41:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 16:41:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 16:41:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-07 16:41:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-07 16:41:46,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-07 16:41:46,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:46,229 INFO L225 Difference]: With dead ends: 22 [2022-04-07 16:41:46,230 INFO L226 Difference]: Without dead ends: 15 [2022-04-07 16:41:46,231 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:41:46,234 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 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:41:46,236 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:41:46,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-07 16:41:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-07 16:41:46,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:46,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:41:46,263 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:41:46,264 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:41:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:46,269 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 16:41:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 16:41:46,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:46,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:46,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 16:41:46,270 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-07 16:41:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:46,272 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-07 16:41:46,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 16:41:46,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:46,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:46,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:46,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:41:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-07 16:41:46,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-07 16:41:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:46,276 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-07 16:41:46,276 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-07 16:41:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 16:41:46,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:46,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:41:46,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:41:46,277 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:46,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -793751650, now seen corresponding path program 1 times [2022-04-07 16:41:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:46,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647673741] [2022-04-07 16:41:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:46,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-07 16:41:46,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:46,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {100#true} {100#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:46,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {100#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:41:46,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {100#true} is VALID [2022-04-07 16:41:46,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:46,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} [69] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:46,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {100#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#true} is VALID [2022-04-07 16:41:46,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_1| (* (let ((.cse0 (mod v_main_~SIZE~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4))) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {105#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-07 16:41:46,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-07 16:41:46,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {101#false} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {101#false} is VALID [2022-04-07 16:41:46,487 INFO L272 TraceCheckUtils]: 8: Hoare triple {101#false} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {101#false} is VALID [2022-04-07 16:41:46,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {101#false} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {101#false} is VALID [2022-04-07 16:41:46,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#false} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-07 16:41:46,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {101#false} is VALID [2022-04-07 16:41:46,488 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:41:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647673741] [2022-04-07 16:41:46,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647673741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:46,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:46,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:41:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784216219] [2022-04-07 16:41:46,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:46,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 16:41:46,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:46,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:46,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:41:46,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:41:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:41:46,519 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:46,610 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 16:41:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 16:41:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 16:41:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-07 16:41:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-07 16:41:46,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2022-04-07 16:41:46,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:46,642 INFO L225 Difference]: With dead ends: 18 [2022-04-07 16:41:46,642 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 16:41:46,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:41:46,644 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 16:41:46,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 16:41:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 16:41:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-04-07 16:41:46,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:46,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,647 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,647 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:46,649 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 16:41:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 16:41:46,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:46,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:46,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 16:41:46,650 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-07 16:41:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:46,651 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-07 16:41:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-07 16:41:46,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:46,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:46,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:46,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-07 16:41:46,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-04-07 16:41:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:46,653 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-07 16:41:46,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-07 16:41:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 16:41:46,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:46,654 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 16:41:46,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:41:46,655 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:46,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:46,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2020817898, now seen corresponding path program 1 times [2022-04-07 16:41:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:46,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818697588] [2022-04-07 16:41:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:47,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {181#true} is VALID [2022-04-07 16:41:47,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:47,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181#true} {181#true} [69] 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:41:47,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 16:41:47,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {181#true} is VALID [2022-04-07 16:41:47,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:47,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [69] 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:41:47,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:47,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_1| (* (let ((.cse0 (mod v_main_~SIZE~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4))) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {186#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (= |main_~#array~0.offset| 0) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (or (<= main_~SIZE~0 1) (not (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296))))) (<= (+ (* main_~j~0 4) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 4294967296)))))} is VALID [2022-04-07 16:41:47,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (= |main_~#array~0.offset| 0) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (or (<= main_~SIZE~0 1) (not (<= main_~j~0 (+ 2147483647 (* 4294967296 (div main_~j~0 4294967296))))) (<= (+ (* main_~j~0 4) |main_~#array~0.offset|) (* 17179869184 (div main_~j~0 4294967296)))))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) |v_main_~#array~0.offset_5|))) (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0) |v_main_#t~mem7_1|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {187#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|) |main_~#array~0.offset|) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} is VALID [2022-04-07 16:41:47,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|) |main_~#array~0.offset|) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (= |main_#t~mem7| (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~j~0 4) (* (- 17179869184) (div main_~j~0 4294967296)) |main_~#array~0.offset|))))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= v_main_~menor~0_4 (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (let ((.cse0 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) |v_main_~#array~0.offset_6|)))) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {188#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (* 17179869184 (div main_~j~0 4294967296)) (* main_~j~0 4)) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-07 16:41:47,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#(and (= (* 17179869184 (div main_~j~0 4294967296)) (+ (* main_~j~0 4) |main_~#array~0.offset|)) (= (* 17179869184 (div main_~j~0 4294967296)) (* main_~j~0 4)) (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {189#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-07 16:41:47,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {189#(and (<= main_~SIZE~0 (+ 2147483647 (* (div main_~SIZE~0 4294967296) 4294967296))) (< 0 (+ (div main_~SIZE~0 4294967296) 1)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {190#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-07 16:41:47,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {191#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-07 16:41:47,575 INFO L272 TraceCheckUtils]: 11: Hoare triple {191#(<= main_~menor~0 |main_#t~mem9|)} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 16:41:47,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 16:41:47,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:41:47,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {182#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:41:47,577 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:41:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:47,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818697588] [2022-04-07 16:41:47,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818697588] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:41:47,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701886581] [2022-04-07 16:41:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:41:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:41:47,581 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:41:47,582 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:41:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:47,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 16:41:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:47,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:41:47,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2022-04-07 16:41:47,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-04-07 16:41:48,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-07 16:41:48,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:48,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {181#true} is VALID [2022-04-07 16:41:48,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:48,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [69] 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:41:48,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:48,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_1| (* (let ((.cse0 (mod v_main_~SIZE~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4))) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {213#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-07 16:41:48,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) |v_main_~#array~0.offset_5|))) (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0) |v_main_#t~mem7_1|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {213#(and (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-07 16:41:48,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {213#(and (= main_~j~0 0) (= main_~SIZE~0 1))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= v_main_~menor~0_4 (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (let ((.cse0 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) |v_main_~#array~0.offset_6|)))) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {220#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|))) (= main_~j~0 0) (= main_~SIZE~0 1))} is VALID [2022-04-07 16:41:48,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|))) (= main_~j~0 0) (= main_~SIZE~0 1))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {224#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~j~0) 0) (= main_~SIZE~0 1))} is VALID [2022-04-07 16:41:48,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(and (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod (+ main_~j~0 4294967295) 4294967296) 4) |main_~#array~0.offset|))) (= (+ (- 1) main_~j~0) 0) (= main_~SIZE~0 1))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {190#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-07 16:41:48,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {191#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-07 16:41:48,107 INFO L272 TraceCheckUtils]: 11: Hoare triple {191#(<= main_~menor~0 |main_#t~mem9|)} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {234#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:41:48,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {238#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:41:48,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= 1 __VERIFIER_assert_~cond)} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:41:48,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {182#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:41:48,109 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:41:48,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:41:48,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-04-07 16:41:48,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 16:41:48,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-07 16:41:48,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 88 [2022-04-07 16:41:48,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-07 16:41:48,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 12 [2022-04-07 16:41:48,616 INFO L356 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2022-04-07 16:41:48,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2022-04-07 16:41:48,651 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-04-07 16:41:48,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 3 [2022-04-07 16:41:48,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {182#false} [66] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:41:48,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {238#(<= 1 __VERIFIER_assert_~cond)} [64] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {182#false} is VALID [2022-04-07 16:41:48,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {238#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 16:41:48,741 INFO L272 TraceCheckUtils]: 11: Hoare triple {191#(<= main_~menor~0 |main_#t~mem9|)} [59] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= v_main_~menor~0_7 |v_main_#t~mem9_4|) 1 0)) InVars {main_#t~mem9=|v_main_#t~mem9_4|, main_~menor~0=v_main_~menor~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~menor~0, main_#t~mem9] {234#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 16:41:48,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} [56] L21-4-->L28: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#array~0.base_2|) |v_main_~#array~0.offset_2|)) InVars {#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|} OutVars{#memory_int=|v_#memory_int_1|, main_~#array~0.offset=|v_main_~#array~0.offset_2|, main_~#array~0.base=|v_main_~#array~0.base_2|, main_#t~mem9=|v_main_#t~mem9_1|} AuxVars[] AssignedVars[main_#t~mem9] {191#(<= main_~menor~0 |main_#t~mem9|)} is VALID [2022-04-07 16:41:48,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} [54] L21-3-->L21-4: Formula: (not (< (mod v_main_~j~0_5 4294967296) (mod v_main_~SIZE~0_2 4294967296))) InVars {main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} OutVars{main_~SIZE~0=v_main_~SIZE~0_2, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {190#(<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2022-04-07 16:41:48,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} [60] L21-2-->L21-3: Formula: (= v_main_~j~0_1 (+ v_main_~j~0_2 1)) InVars {main_~j~0=v_main_~j~0_2} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {260#(or (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-07 16:41:48,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} [57] L24-->L21-2: Formula: (and (<= |v_main_#t~mem7_3| v_main_~menor~0_5) (= v_main_~menor~0_4 (select (select |v_#memory_int_4| |v_main_~#array~0.base_6|) (+ (* 4 (let ((.cse0 (mod v_main_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) |v_main_~#array~0.offset_6|)))) InVars {main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem7=|v_main_#t~mem7_3|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_5} OutVars{main_~#array~0.base=|v_main_~#array~0.base_6|, main_~j~0=v_main_~j~0_7, #memory_int=|v_#memory_int_4|, main_#t~mem8=|v_main_#t~mem8_1|, main_~#array~0.offset=|v_main_~#array~0.offset_6|, main_~menor~0=v_main_~menor~0_4} AuxVars[] AssignedVars[main_#t~mem7, main_#t~mem8, main_~menor~0] {264#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (<= main_~menor~0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2022-04-07 16:41:48,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (mod main_~j~0 4294967296) 4) 0))} [55] L21-3-->L24: Formula: (let ((.cse1 (mod v_main_~j~0_6 4294967296))) (let ((.cse0 (+ (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4) |v_main_~#array~0.offset_5|))) (and (= (select (select |v_#memory_int_2| |v_main_~#array~0.base_5|) .cse0) |v_main_#t~mem7_1|) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= (store |v_#memory_int_3| |v_main_~#array~0.base_5| (store (select |v_#memory_int_3| |v_main_~#array~0.base_5|) .cse0 |v_main_#t~nondet6_2|)) |v_#memory_int_2|) (< .cse1 (mod v_main_~SIZE~0_3 4294967296))))) InVars {main_~SIZE~0=v_main_~SIZE~0_3, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, #memory_int=|v_#memory_int_3|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} OutVars{main_~SIZE~0=v_main_~SIZE~0_3, main_~#array~0.base=|v_main_~#array~0.base_5|, main_~j~0=v_main_~j~0_6, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_2|, main_~#array~0.offset=|v_main_~#array~0.offset_5|} AuxVars[] AssignedVars[main_#t~nondet6, main_#t~mem7, #memory_int] {268#(or (and (or (not (<= (mod main_~j~0 4294967296) 2147483647)) (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))) (or (<= (select (select |#memory_int| |main_~#array~0.base|) (+ (- 17179869184) (* (mod main_~j~0 4294967296) 4) |main_~#array~0.offset|)) (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (<= (mod main_~j~0 4294967296) 2147483647))) (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)))} is VALID [2022-04-07 16:41:48,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#true} [51] mainENTRY-->L21-3: Formula: (and (= |v_main_#t~nondet4_2| v_main_~menor~0_1) (not (= |v_main_~#array~0.base_1| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#array~0.base_1| 1)) (= v_main_~j~0_3 0) (< |v_#StackHeapBarrier_1| |v_main_~#array~0.base_1|) (= (select |v_#valid_2| |v_main_~#array~0.base_1|) 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (= v_main_~SIZE~0_1 1) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_#length_1| (store |v_#length_2| |v_main_~#array~0.base_1| (* (let ((.cse0 (mod v_main_~SIZE~0_1 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4))) (= |v_main_~#array~0.offset_1| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{main_~SIZE~0=v_main_~SIZE~0_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#array~0.base=|v_main_~#array~0.base_1|, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3, #valid=|v_#valid_1|, main_~#array~0.offset=|v_main_~#array~0.offset_1|, #length=|v_#length_1|, main_~menor~0=v_main_~menor~0_1} AuxVars[] AssignedVars[main_~SIZE~0, main_#t~nondet4, main_~#array~0.base, main_~k~0, main_~j~0, #valid, main_~#array~0.offset, #length, main_~menor~0] {272#(or (< (mod (+ main_~j~0 1) 4294967296) (mod main_~SIZE~0 4294967296)) (not (< (mod main_~j~0 4294967296) (mod main_~SIZE~0 4294967296))) (= (* (mod main_~j~0 4294967296) 4) 0))} is VALID [2022-04-07 16:41:48,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {181#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:48,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181#true} {181#true} [69] 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:41:48,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {181#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:48,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= (select |v_#length_3| 2) 10) (= (select .cse0 1) 0) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {181#true} is VALID [2022-04-07 16:41:48,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {181#true} is VALID [2022-04-07 16:41:48,750 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:41:48,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701886581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 16:41:48,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 16:41:48,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 20 [2022-04-07 16:41:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648786286] [2022-04-07 16:41:48,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 16:41:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 16:41:48,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:48,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:48,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:48,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-07 16:41:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-07 16:41:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-07 16:41:48,809 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:49,353 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 16:41:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 16:41:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 16:41:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2022-04-07 16:41:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2022-04-07 16:41:49,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 16 transitions. [2022-04-07 16:41:49,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:49,385 INFO L225 Difference]: With dead ends: 14 [2022-04-07 16:41:49,385 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 16:41:49,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-04-07 16:41:49,387 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:41:49,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 63 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 16:41:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 16:41:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 16:41:49,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:49,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:49,388 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:49,389 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:49,389 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:41:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:41:49,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:49,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:49,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 16:41:49,389 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 16:41:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:49,390 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 16:41:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:41:49,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:49,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:49,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:49,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 16:41:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 16:41:49,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-04-07 16:41:49,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:49,391 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 16:41:49,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 16:41:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 16:41:49,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:49,394 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 16:41:49,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 16:41:49,595 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:41:49,598 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 16:41:49,600 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 16:41:49,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:41:49 BasicIcfg [2022-04-07 16:41:49,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 16:41:49,614 INFO L158 Benchmark]: Toolchain (without parser) took 4738.84ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 124.6MB in the beginning and 152.3MB in the end (delta: -27.7MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2022-04-07 16:41:49,615 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 16:41:49,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.47ms. Allocated memory is still 180.4MB. Free memory was 124.4MB in the beginning and 151.7MB in the end (delta: -27.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-04-07 16:41:49,615 INFO L158 Benchmark]: Boogie Preprocessor took 40.59ms. Allocated memory is still 180.4MB. Free memory was 151.7MB in the beginning and 150.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 16:41:49,615 INFO L158 Benchmark]: RCFGBuilder took 351.91ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 138.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 16:41:49,616 INFO L158 Benchmark]: IcfgTransformer took 72.94ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 136.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 16:41:49,616 INFO L158 Benchmark]: TraceAbstraction took 4026.20ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 136.2MB in the beginning and 152.3MB in the end (delta: -16.2MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2022-04-07 16:41:49,617 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.17ms. Allocated memory is still 180.4MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.47ms. Allocated memory is still 180.4MB. Free memory was 124.4MB in the beginning and 151.7MB in the end (delta: -27.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.59ms. Allocated memory is still 180.4MB. Free memory was 151.7MB in the beginning and 150.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.91ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 138.5MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 72.94ms. Allocated memory is still 180.4MB. Free memory was 138.2MB in the beginning and 136.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4026.20ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 136.2MB in the beginning and 152.3MB in the end (delta: -16.2MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 42 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 457 SizeOfPredicates, 9 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 16:41:49,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...