/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/sum_array-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:57:51,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:57:51,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:57:51,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:57:51,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:57:51,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:57:51,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:57:51,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:57:51,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:57:51,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:57:51,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:57:51,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:57:51,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:57:51,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:57:51,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:57:51,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:57:51,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:57:51,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:57:51,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:57:51,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:57:51,758 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:57:51,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:57:51,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:57:51,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:57:51,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:57:51,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:57:51,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:57:51,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:57:51,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:57:51,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:57:51,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:57:51,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:57:51,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:57:51,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:57:51,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:57:51,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:57:51,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:57:51,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:57:51,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:57:51,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:57:51,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:57:51,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:57:51,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:57:51,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:57:51,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:57:51,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:57:51,780 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:57:51,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:57:51,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:57:51,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:57:51,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:57:51,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:57:51,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:57:51,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:57:51,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:57:51,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:57:51,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:57:51,782 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:57:51,782 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:57:51,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:57:51,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:57:51,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:57:51,973 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:57:51,975 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:57:51,976 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array-1.c [2022-04-27 15:57:52,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e1f95b3/fb09547d3e5c426fa3f582e883056aeb/FLAGf061a8e1b [2022-04-27 15:57:52,348 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:57:52,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array-1.c [2022-04-27 15:57:52,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e1f95b3/fb09547d3e5c426fa3f582e883056aeb/FLAGf061a8e1b [2022-04-27 15:57:52,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e1f95b3/fb09547d3e5c426fa3f582e883056aeb [2022-04-27 15:57:52,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:57:52,776 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:57:52,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:57:52,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:57:52,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:57:52,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:52,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f06c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52, skipping insertion in model container [2022-04-27 15:57:52,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:52,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:57:52,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:57:52,909 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/sum_array-1.c[363,376] [2022-04-27 15:57:52,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:57:52,930 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:57:52,938 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/sum_array-1.c[363,376] [2022-04-27 15:57:52,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:57:52,963 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:57:52,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52 WrapperNode [2022-04-27 15:57:52,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:57:52,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:57:52,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:57:52,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:57:52,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:52,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:52,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:52,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:52,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:53,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:53,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:53,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:57:53,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:57:53,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:57:53,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:57:53,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (1/1) ... [2022-04-27 15:57:53,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:57:53,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:57:53,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:57:53,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:57:53,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:57:53,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:57:53,067 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:57:53,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:57:53,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:57:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 15:57:53,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 15:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:57:53,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:57:53,131 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:57:53,133 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:57:53,349 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:57:53,354 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:57:53,354 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 15:57:53,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:53 BoogieIcfgContainer [2022-04-27 15:57:53,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:57:53,356 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:57:53,356 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:57:53,357 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:57:53,359 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:53" (1/1) ... [2022-04-27 15:57:53,361 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:57:53,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:57:53 BasicIcfg [2022-04-27 15:57:53,412 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:57:53,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:57:53,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:57:53,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:57:53,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:57:52" (1/4) ... [2022-04-27 15:57:53,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428dfa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:57:53, skipping insertion in model container [2022-04-27 15:57:53,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:57:52" (2/4) ... [2022-04-27 15:57:53,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428dfa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:57:53, skipping insertion in model container [2022-04-27 15:57:53,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:57:53" (3/4) ... [2022-04-27 15:57:53,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428dfa5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:57:53, skipping insertion in model container [2022-04-27 15:57:53,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:57:53" (4/4) ... [2022-04-27 15:57:53,424 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_array-1.cJordan [2022-04-27 15:57:53,434 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:57:53,434 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:57:53,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:57:53,469 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ced5c1e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15b701bd [2022-04-27 15:57:53,469 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:57:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:57:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:57:53,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:53,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:53,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash -369292380, now seen corresponding path program 1 times [2022-04-27 15:57:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:53,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326066678] [2022-04-27 15:57:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:53,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:53,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-27 15:57:53,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 15:57:53,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 15:57:53,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:53,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-27 15:57:53,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 15:57:53,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 15:57:53,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 15:57:53,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [88] mainENTRY-->L20-3: Formula: (let ((.cse1 (store |v_#valid_4| |v_main_~#A~0.base_1| 1))) (let ((.cse0 (store .cse1 |v_main_~#B~0.base_1| 1))) (and (= 0 |v_main_~#A~0.offset_1|) (= (select .cse0 |v_main_~#C~0.base_1|) 0) (= v_main_~i~0_1 0) (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_1|) (not (= |v_main_~#C~0.base_1| 0)) (= v_main_~M~0_1 |v_main_#t~nondet4_2|) (= |v_main_~#C~0.offset_1| 0) (= (select |v_#valid_4| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (not (= |v_main_~#B~0.base_1| 0)) (= (store .cse0 |v_main_~#C~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_1|) (= 0 |v_main_~#B~0.offset_1|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= (select .cse1 |v_main_~#B~0.base_1|) 0) (= (let ((.cse2 (* (let ((.cse3 (mod v_main_~M~0_1 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296)))) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_1| .cse2) |v_main_~#B~0.base_1| .cse2) |v_main_~#C~0.base_1| .cse2)) |v_#length_1|)))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_1, main_~M~0=v_main_~M~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_~#B~0.offset, main_#t~nondet4, main_~#C~0.offset, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {33#true} is VALID [2022-04-27 15:57:53,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} [90] L20-3-->L20-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 15:57:53,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#false} [93] L20-4-->L23-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {34#false} is VALID [2022-04-27 15:57:53,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#false} [96] L23-3-->L23-4: Formula: (not (< (mod v_main_~i~0_15 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 15:57:53,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [98] L23-4-->L26-3: Formula: (= v_main_~i~0_21 0) InVars {} OutVars{main_~i~0=v_main_~i~0_21} AuxVars[] AssignedVars[main_~i~0] {34#false} is VALID [2022-04-27 15:57:53,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#false} [100] L26-3-->L26-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 15:57:53,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} [103] L26-4-->L29-3: Formula: (= v_main_~i~0_11 0) InVars {} OutVars{main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_~i~0] {34#false} is VALID [2022-04-27 15:57:53,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} [107] L29-3-->L30: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4))) (and (= (select (select |v_#memory_int_5| |v_main_~#C~0.base_3|) (+ |v_main_~#C~0.offset_3| .cse0)) |v_main_#t~mem15_1|) (< .cse1 (mod v_main_~M~0_7 4294967296)) (= (select (select |v_#memory_int_5| |v_main_~#A~0.base_4|) (+ .cse0 |v_main_~#A~0.offset_4|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_5| |v_main_~#B~0.base_3|) (+ .cse0 |v_main_~#B~0.offset_3|)) |v_main_#t~mem14_1|)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#C~0.base=|v_main_~#C~0.base_3|} OutVars{main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_#t~mem15=|v_main_#t~mem15_1|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~#C~0.base=|v_main_~#C~0.base_3|} AuxVars[] AssignedVars[main_#t~mem13, main_#t~mem14, main_#t~mem15] {34#false} is VALID [2022-04-27 15:57:53,706 INFO L272 TraceCheckUtils]: 13: Hoare triple {34#false} [109] L30-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ |v_main_#t~mem13_4| (* (- 1) |v_main_#t~mem14_4|)) |v_main_#t~mem15_4|) 1 0)) InVars {main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|, main_#t~mem15=|v_main_#t~mem15_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14, main_#t~mem15] {34#false} is VALID [2022-04-27 15:57:53,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-27 15:57:53,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [114] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 15:57:53,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [116] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 15:57:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:53,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:53,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326066678] [2022-04-27 15:57:53,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326066678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:57:53,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:57:53,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:57:53,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993249199] [2022-04-27 15:57:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:57:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-27 15:57:53,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:53,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:53,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:53,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:57:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:57:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:57:53,775 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:53,830 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 15:57:53,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:57:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 17 [2022-04-27 15:57:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:53,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 15:57:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 15:57:53,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 15:57:53,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:53,899 INFO L225 Difference]: With dead ends: 30 [2022-04-27 15:57:53,899 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 15:57:53,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:57:53,906 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:53,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:57:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 15:57:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 15:57:53,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:53,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:53,936 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:53,937 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:53,943 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 15:57:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 15:57:53,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:53,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:53,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-27 15:57:53,945 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 25 states. [2022-04-27 15:57:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:53,954 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 15:57:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 15:57:53,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:53,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:53,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:53,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 15:57:53,960 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-27 15:57:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:53,962 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 15:57:53,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 15:57:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:57:53,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:53,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:53,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:57:53,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:53,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1278740058, now seen corresponding path program 1 times [2022-04-27 15:57:53,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:53,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926299721] [2022-04-27 15:57:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:53,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:57:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:57:54,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {146#true} is VALID [2022-04-27 15:57:54,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 15:57:54,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {146#true} {146#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 15:57:54,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {146#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:57:54,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_8| 1))) (and (= (select |v_#valid_9| 2) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select .cse0 0) 48) (= 14 (select |v_#length_5| 2)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_9| 0) 0) (= (select |v_#valid_9| 1) 1) (= (select |v_#valid_9| 3) 1) (= (select .cse0 1) 0) (= (select |v_#length_5| 3) 12) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_8|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_8|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_5|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {146#true} is VALID [2022-04-27 15:57:54,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 15:57:54,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146#true} {146#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 15:57:54,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {146#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#true} is VALID [2022-04-27 15:57:54,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} [88] mainENTRY-->L20-3: Formula: (let ((.cse1 (store |v_#valid_4| |v_main_~#A~0.base_1| 1))) (let ((.cse0 (store .cse1 |v_main_~#B~0.base_1| 1))) (and (= 0 |v_main_~#A~0.offset_1|) (= (select .cse0 |v_main_~#C~0.base_1|) 0) (= v_main_~i~0_1 0) (< |v_#StackHeapBarrier_1| |v_main_~#B~0.base_1|) (not (= |v_main_~#C~0.base_1| 0)) (= v_main_~M~0_1 |v_main_#t~nondet4_2|) (= |v_main_~#C~0.offset_1| 0) (= (select |v_#valid_4| |v_main_~#A~0.base_1|) 0) (not (= |v_main_~#A~0.base_1| 0)) (not (= |v_main_~#B~0.base_1| 0)) (= (store .cse0 |v_main_~#C~0.base_1| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_main_~#C~0.base_1|) (= 0 |v_main_~#B~0.offset_1|) (< |v_#StackHeapBarrier_1| |v_main_~#A~0.base_1|) (= (select .cse1 |v_main_~#B~0.base_1|) 0) (= (let ((.cse2 (* (let ((.cse3 (mod v_main_~M~0_1 4294967296))) (ite (<= .cse3 2147483647) .cse3 (+ .cse3 (- 4294967296)))) 4))) (store (store (store |v_#length_4| |v_main_~#A~0.base_1| .cse2) |v_main_~#B~0.base_1| .cse2) |v_main_~#C~0.base_1| .cse2)) |v_#length_1|)))) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{main_~#B~0.offset=|v_main_~#B~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#C~0.offset=|v_main_~#C~0.offset_1|, main_~#A~0.offset=|v_main_~#A~0.offset_1|, #valid=|v_#valid_1|, main_~#B~0.base=|v_main_~#B~0.base_1|, main_~i~0=v_main_~i~0_1, main_~M~0=v_main_~M~0_1, #length=|v_#length_1|, main_~#A~0.base=|v_main_~#A~0.base_1|, main_~#C~0.base=|v_main_~#C~0.base_1|} AuxVars[] AssignedVars[main_~#B~0.offset, main_#t~nondet4, main_~#C~0.offset, main_~#A~0.offset, #valid, main_~#B~0.base, main_~i~0, main_~M~0, #length, main_~#A~0.base, main_~#C~0.base] {151#(= main_~i~0 0)} is VALID [2022-04-27 15:57:54,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#(= main_~i~0 0)} [91] L20-3-->L20-4: Formula: (not (< (mod v_main_~i~0_5 4294967296) (mod v_main_~M~0_4 4294967296))) InVars {main_~i~0=v_main_~i~0_5, main_~M~0=v_main_~M~0_4} OutVars{main_~i~0=v_main_~i~0_5, main_~M~0=v_main_~M~0_4} AuxVars[] AssignedVars[] {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} is VALID [2022-04-27 15:57:54,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} [93] L20-4-->L23-3: Formula: (= v_main_~i~0_12 0) InVars {} OutVars{main_~i~0=v_main_~i~0_12} AuxVars[] AssignedVars[main_~i~0] {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} is VALID [2022-04-27 15:57:54,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} [96] L23-3-->L23-4: Formula: (not (< (mod v_main_~i~0_15 4294967296) (mod v_main_~M~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} OutVars{main_~i~0=v_main_~i~0_15, main_~M~0=v_main_~M~0_8} AuxVars[] AssignedVars[] {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} is VALID [2022-04-27 15:57:54,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} [98] L23-4-->L26-3: Formula: (= v_main_~i~0_21 0) InVars {} OutVars{main_~i~0=v_main_~i~0_21} AuxVars[] AssignedVars[main_~i~0] {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} is VALID [2022-04-27 15:57:54,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} [101] L26-3-->L26-4: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~M~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~M~0=v_main_~M~0_2} OutVars{main_~i~0=v_main_~i~0_3, main_~M~0=v_main_~M~0_2} AuxVars[] AssignedVars[] {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} is VALID [2022-04-27 15:57:54,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} [103] L26-4-->L29-3: Formula: (= v_main_~i~0_11 0) InVars {} OutVars{main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_~i~0] {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} is VALID [2022-04-27 15:57:54,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#(<= main_~M~0 (* (div main_~M~0 4294967296) 4294967296))} [107] L29-3-->L30: Formula: (let ((.cse1 (mod v_main_~i~0_14 4294967296))) (let ((.cse0 (* (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296))) 4))) (and (= (select (select |v_#memory_int_5| |v_main_~#C~0.base_3|) (+ |v_main_~#C~0.offset_3| .cse0)) |v_main_#t~mem15_1|) (< .cse1 (mod v_main_~M~0_7 4294967296)) (= (select (select |v_#memory_int_5| |v_main_~#A~0.base_4|) (+ .cse0 |v_main_~#A~0.offset_4|)) |v_main_#t~mem13_1|) (= (select (select |v_#memory_int_5| |v_main_~#B~0.base_3|) (+ .cse0 |v_main_~#B~0.offset_3|)) |v_main_#t~mem14_1|)))) InVars {main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#C~0.base=|v_main_~#C~0.base_3|} OutVars{main_#t~mem13=|v_main_#t~mem13_1|, main_#t~mem14=|v_main_#t~mem14_1|, main_#t~mem15=|v_main_#t~mem15_1|, main_~#C~0.offset=|v_main_~#C~0.offset_3|, main_~#A~0.offset=|v_main_~#A~0.offset_4|, main_~M~0=v_main_~M~0_7, main_~#A~0.base=|v_main_~#A~0.base_4|, main_~#B~0.offset=|v_main_~#B~0.offset_3|, main_~#B~0.base=|v_main_~#B~0.base_3|, main_~i~0=v_main_~i~0_14, #memory_int=|v_#memory_int_5|, main_~#C~0.base=|v_main_~#C~0.base_3|} AuxVars[] AssignedVars[main_#t~mem13, main_#t~mem14, main_#t~mem15] {147#false} is VALID [2022-04-27 15:57:54,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {147#false} [109] L30-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (+ |v_main_#t~mem13_4| (* (- 1) |v_main_#t~mem14_4|)) |v_main_#t~mem15_4|) 1 0)) InVars {main_#t~mem13=|v_main_#t~mem13_4|, main_#t~mem14=|v_main_#t~mem14_4|, main_#t~mem15=|v_main_#t~mem15_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem13, __VERIFIER_assert_#in~cond, main_#t~mem14, main_#t~mem15] {147#false} is VALID [2022-04-27 15:57:54,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {147#false} [112] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {147#false} is VALID [2022-04-27 15:57:54,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {147#false} [114] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 15:57:54,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {147#false} [116] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {147#false} is VALID [2022-04-27 15:57:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:57:54,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:57:54,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926299721] [2022-04-27 15:57:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926299721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:57:54,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:57:54,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:57:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749304256] [2022-04-27 15:57:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:57:54,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 15:57:54,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:57:54,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:54,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:54,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:57:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:57:54,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:57:54,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:57:54,132 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:54,309 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-27 15:57:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:57:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 15:57:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:57:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 15:57:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 15:57:54,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 15:57:54,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:57:54,360 INFO L225 Difference]: With dead ends: 41 [2022-04-27 15:57:54,361 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 15:57:54,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:57:54,364 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:57:54,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 28 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:57:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 15:57:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-27 15:57:54,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:57:54,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:54,370 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:54,372 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:54,378 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 15:57:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 15:57:54,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:54,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:54,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-27 15:57:54,379 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-27 15:57:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:57:54,385 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-27 15:57:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 15:57:54,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:57:54,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:57:54,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:57:54,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:57:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:57:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-27 15:57:54,392 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2022-04-27 15:57:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:57:54,392 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-27 15:57:54,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:57:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 15:57:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:57:54,395 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:57:54,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:57:54,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:57:54,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:57:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:57:54,396 INFO L85 PathProgramCache]: Analyzing trace with hash -869806592, now seen corresponding path program 1 times [2022-04-27 15:57:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:57:54,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315649713] [2022-04-27 15:57:54,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:57:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:57:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:57:54,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:57:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:57:54,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:57:54,602 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:57:54,602 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:57:54,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:57:54,606 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 15:57:54,615 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:57:54,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:57:54 BasicIcfg [2022-04-27 15:57:54,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:57:54,651 INFO L158 Benchmark]: Toolchain (without parser) took 1875.32ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 124.2MB in the beginning and 105.8MB in the end (delta: 18.4MB). Peak memory consumption was 76.2MB. Max. memory is 8.0GB. [2022-04-27 15:57:54,652 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:57:54,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.26ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 124.0MB in the beginning and 210.1MB in the end (delta: -86.1MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-04-27 15:57:54,652 INFO L158 Benchmark]: Boogie Preprocessor took 41.82ms. Allocated memory is still 239.1MB. Free memory was 210.1MB in the beginning and 208.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:57:54,652 INFO L158 Benchmark]: RCFGBuilder took 348.64ms. Allocated memory is still 239.1MB. Free memory was 208.6MB in the beginning and 192.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-27 15:57:54,659 INFO L158 Benchmark]: IcfgTransformer took 55.50ms. Allocated memory is still 239.1MB. Free memory was 192.8MB in the beginning and 190.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:57:54,660 INFO L158 Benchmark]: TraceAbstraction took 1237.04ms. Allocated memory is still 239.1MB. Free memory was 190.2MB in the beginning and 105.8MB in the end (delta: 84.4MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2022-04-27 15:57:54,663 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.11ms. Allocated memory is still 180.4MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.26ms. Allocated memory was 180.4MB in the beginning and 239.1MB in the end (delta: 58.7MB). Free memory was 124.0MB in the beginning and 210.1MB in the end (delta: -86.1MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.82ms. Allocated memory is still 239.1MB. Free memory was 210.1MB in the beginning and 208.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 348.64ms. Allocated memory is still 239.1MB. Free memory was 208.6MB in the beginning and 192.8MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 55.50ms. Allocated memory is still 239.1MB. Free memory was 192.8MB in the beginning and 190.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1237.04ms. Allocated memory is still 239.1MB. Free memory was 190.2MB in the beginning and 105.8MB in the end (delta: 84.4MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 8]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] unsigned int M = __VERIFIER_nondet_uint(); [L17] int A[M], B[M], C[M]; [L18] unsigned int i; [L20] i=0 VAL [A={6:0}, B={5:0}, C={7:0}, i=0, M=1] [L20] COND TRUE i