/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-crafted-1/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 19:57:11,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:57:11,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:57:11,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:57:11,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:57:11,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:57:11,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:57:11,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:57:11,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:57:11,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:57:11,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:57:11,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:57:11,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:57:11,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:57:11,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:57:11,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:57:11,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:57:11,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:57:11,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:57:11,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:57:11,919 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:57:11,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:57:11,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:57:11,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:57:11,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:57:11,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:57:11,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:57:11,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:57:11,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:57:11,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:57:11,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:57:11,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:57:11,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:57:11,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:57:11,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:57:11,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:57:11,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:57:11,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:57:11,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:57:11,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:57:11,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:57:11,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:57:11,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:57:11,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:57:11,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:57:11,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:57:11,940 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:57:11,940 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:57:11,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:57:11,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:57:11,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:57:11,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:57:11,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:57:11,941 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:57:11,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:57:11,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:57:11,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:57:11,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:57:11,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:57:11,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:57:11,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:57:11,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:57:11,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:57:11,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:57:11,943 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:57:11,943 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-14 19:57:12,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:57:12,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:57:12,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:57:12,128 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:57:12,129 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:57:12,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-14 19:57:12,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8667a712/3ae3b319e5c04b1aabd1f846ff4785bf/FLAG865bd986f [2022-04-14 19:57:12,533 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:57:12,533 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-14 19:57:12,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8667a712/3ae3b319e5c04b1aabd1f846ff4785bf/FLAG865bd986f [2022-04-14 19:57:12,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8667a712/3ae3b319e5c04b1aabd1f846ff4785bf [2022-04-14 19:57:12,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:57:12,547 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:57:12,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:57:12,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:57:12,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:57:12,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a5d520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12, skipping insertion in model container [2022-04-14 19:57:12,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:57:12,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:57:12,688 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-crafted-1/sumt4.c[403,416] [2022-04-14 19:57:12,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:57:12,706 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:57:12,714 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-crafted-1/sumt4.c[403,416] [2022-04-14 19:57:12,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:57:12,727 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:57:12,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12 WrapperNode [2022-04-14 19:57:12,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:57:12,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:57:12,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:57:12,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:57:12,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:57:12,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:57:12,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:57:12,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:57:12,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (1/1) ... [2022-04-14 19:57:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:57:12,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:12,785 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-14 19:57:12,804 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-14 19:57:12,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:57:12,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:57:12,815 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:57:12,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 19:57:12,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 19:57:12,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:57:12,815 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:57:12,815 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:57:12,815 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:57:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:57:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 19:57:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:57:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 19:57:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:57:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:57:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:57:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:57:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:57:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:57:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:57:12,862 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:57:12,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:57:15,143 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:57:15,147 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:57:15,148 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 19:57:15,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:57:15 BoogieIcfgContainer [2022-04-14 19:57:15,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:57:15,149 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:57:15,149 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:57:15,150 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:57:15,152 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:57:15" (1/1) ... [2022-04-14 19:57:15,153 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:57:15,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:57:15 BasicIcfg [2022-04-14 19:57:15,168 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:57:15,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:57:15,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:57:15,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:57:15,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:57:12" (1/4) ... [2022-04-14 19:57:15,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f2b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:57:15, skipping insertion in model container [2022-04-14 19:57:15,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:57:12" (2/4) ... [2022-04-14 19:57:15,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f2b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:57:15, skipping insertion in model container [2022-04-14 19:57:15,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:57:15" (3/4) ... [2022-04-14 19:57:15,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8f2b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:57:15, skipping insertion in model container [2022-04-14 19:57:15,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:57:15" (4/4) ... [2022-04-14 19:57:15,173 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.cJordan [2022-04-14 19:57:15,176 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:57:15,176 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:57:15,207 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:57:15,211 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-14 19:57:15,211 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:57:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-14 19:57:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:57:15,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:15,234 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:15,235 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2028912826, now seen corresponding path program 1 times [2022-04-14 19:57:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:15,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348531668] [2022-04-14 19:57:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:15,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-14 19:57:15,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-14 19:57:15,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-14 19:57:15,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:15,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-14 19:57:15,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-14 19:57:15,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-14 19:57:15,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-14 19:57:15,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {27#true} is VALID [2022-04-14 19:57:15,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-14 19:57:15,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} [78] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-14 19:57:15,404 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {28#false} is VALID [2022-04-14 19:57:15,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [85] __VERIFIER_assertENTRY-->L9: 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] {28#false} is VALID [2022-04-14 19:57:15,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [89] L9-->L10: 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[] {28#false} is VALID [2022-04-14 19:57:15,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-14 19:57:15,404 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-14 19:57:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:15,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348531668] [2022-04-14 19:57:15,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348531668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:57:15,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:57:15,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 19:57:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487774333] [2022-04-14 19:57:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:15,411 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-14 19:57:15,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:15,415 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-14 19:57:15,432 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-14 19:57:15,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 19:57:15,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:15,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 19:57:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 19:57:15,456 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-14 19:57:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:17,709 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-14 19:57:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 19:57:17,710 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-14 19:57:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:17,711 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-14 19:57:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-14 19:57:17,722 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-14 19:57:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-04-14 19:57:17,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2022-04-14 19:57:17,773 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-14 19:57:17,780 INFO L225 Difference]: With dead ends: 24 [2022-04-14 19:57:17,780 INFO L226 Difference]: Without dead ends: 17 [2022-04-14 19:57:17,781 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-14 19:57:17,783 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:17,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 19:57:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-14 19:57:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-14 19:57:17,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:17,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-14 19:57:17,801 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-14 19:57:17,802 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-14 19:57:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:17,804 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-14 19:57:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-14 19:57:17,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:17,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:17,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-14 19:57:17,805 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-14 19:57:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:17,806 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-14 19:57:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-14 19:57:17,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:17,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:17,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:17,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-14 19:57:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-14 19:57:17,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-14 19:57:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:17,809 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-14 19:57:17,809 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-14 19:57:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-14 19:57:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:57:17,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:17,810 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:17,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:57:17,811 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:17,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2027989305, now seen corresponding path program 1 times [2022-04-14 19:57:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816203704] [2022-04-14 19:57:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:18,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:18,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {110#true} is VALID [2022-04-14 19:57:18,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-14 19:57:18,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-14 19:57:18,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {118#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:18,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {110#true} is VALID [2022-04-14 19:57:18,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-14 19:57:18,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-14 19:57:18,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-14 19:57:18,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {115#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:18,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {115#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:18,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {115#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {115#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:18,139 INFO L272 TraceCheckUtils]: 8: Hoare triple {115#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:57:18,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L9: 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] {117#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:57:18,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {117#(not (= __VERIFIER_assert_~cond 0))} [89] L9-->L10: 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[] {111#false} is VALID [2022-04-14 19:57:18,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {111#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-14 19:57:18,141 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-14 19:57:18,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816203704] [2022-04-14 19:57:18,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816203704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:57:18,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:57:18,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:57:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475999068] [2022-04-14 19:57:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:18,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 19:57:18,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:18,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:18,157 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-14 19:57:18,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:18,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:57:18,160 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:22,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:24,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:26,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:27,089 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-14 19:57:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:57:27,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 19:57:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-14 19:57:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-14 19:57:27,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-14 19:57:27,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:27,125 INFO L225 Difference]: With dead ends: 22 [2022-04-14 19:57:27,125 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 19:57:27,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-14 19:57:27,127 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:27,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-14 19:57:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 19:57:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-14 19:57:27,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:27,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:27,133 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:27,133 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:27,138 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-14 19:57:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-14 19:57:27,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:27,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:27,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-14 19:57:27,139 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-14 19:57:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:27,140 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-14 19:57:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-14 19:57:27,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:27,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:27,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:27,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-14 19:57:27,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-14 19:57:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:27,143 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-14 19:57:27,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-14 19:57:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 19:57:27,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:27,149 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:27,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:57:27,149 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -169964717, now seen corresponding path program 1 times [2022-04-14 19:57:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:27,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418242779] [2022-04-14 19:57:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:27,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {206#true} is VALID [2022-04-14 19:57:27,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:27,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:27,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:27,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {206#true} is VALID [2022-04-14 19:57:27,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:27,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:27,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:27,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:27,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:27,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {212#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-14 19:57:27,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {212#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {213#(and (= main_~k~0 0) (<= main_~v4~0 1) (= main_~j~0 0) (<= 1 main_~v4~0) (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v4~0)) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-14 19:57:27,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#(and (= main_~k~0 0) (<= main_~v4~0 1) (= main_~j~0 0) (<= 1 main_~v4~0) (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v4~0)) (= main_~l~0 0) (= main_~i~0 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {214#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (<= main_~v4~0 main_~l~0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} is VALID [2022-04-14 19:57:27,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {214#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (<= main_~v4~0 main_~l~0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {215#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= main_~v4~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} is VALID [2022-04-14 19:57:27,776 INFO L272 TraceCheckUtils]: 11: Hoare triple {215#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= main_~v4~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 19:57:27,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L9: 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] {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 19:57:27,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} [89] L9-->L10: 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[] {207#false} is VALID [2022-04-14 19:57:27,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-14 19:57:27,778 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-14 19:57:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418242779] [2022-04-14 19:57:27,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418242779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382681115] [2022-04-14 19:57:27,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:27,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:27,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:27,781 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-14 19:57:27,783 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-14 19:57:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:27,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 19:57:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:27,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:57:28,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {206#true} is VALID [2022-04-14 19:57:28,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:28,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:28,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:28,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {246#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:28,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {250#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:28,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {250#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:28,115 INFO L272 TraceCheckUtils]: 11: Hoare triple {250#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:28,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:28,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {207#false} is VALID [2022-04-14 19:57:28,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-14 19:57:28,116 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-14 19:57:28,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:57:28,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-14 19:57:28,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {207#false} is VALID [2022-04-14 19:57:28,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:28,369 INFO L272 TraceCheckUtils]: 11: Hoare triple {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:28,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:28,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:28,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {284#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:28,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:28,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:28,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {277#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:28,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {206#true} is VALID [2022-04-14 19:57:28,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 19:57:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 19:57:28,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382681115] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:28,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:57:28,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-14 19:57:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252499655] [2022-04-14 19:57:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:28,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-14 19:57:28,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:28,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:28,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:28,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:28,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:28,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-14 19:57:28,413 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:32,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:34,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:34,935 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-14 19:57:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:57:34,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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 15 [2022-04-14 19:57:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-14 19:57:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-14 19:57:34,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-14 19:57:34,982 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-14 19:57:34,982 INFO L225 Difference]: With dead ends: 26 [2022-04-14 19:57:34,982 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 19:57:34,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-14 19:57:34,983 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:34,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-14 19:57:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 19:57:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-14 19:57:34,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:34,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:34,986 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:34,986 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:34,988 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-14 19:57:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-14 19:57:34,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:34,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:34,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-14 19:57:34,989 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-14 19:57:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:34,994 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-14 19:57:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-14 19:57:34,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:34,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:34,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:34,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 19:57:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-14 19:57:34,998 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-14 19:57:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:34,998 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-14 19:57:34,999 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 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-14 19:57:34,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-14 19:57:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 19:57:34,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:34,999 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:35,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 19:57:35,207 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-14 19:57:35,208 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1246245489, now seen corresponding path program 1 times [2022-04-14 19:57:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:35,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895422622] [2022-04-14 19:57:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:35,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:35,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 19:57:35,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 19:57:35,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {410#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:57:35,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {410#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:35,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 19:57:35,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 19:57:35,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {410#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:57:35,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {415#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:57:35,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {415#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {416#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 19:57:35,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {416#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {417#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 19:57:35,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {417#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {417#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 19:57:35,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {417#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 19:57:35,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {418#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) 8569934592 main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-14 19:57:35,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) 8569934592 main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {419#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} is VALID [2022-04-14 19:57:35,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {419#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} is VALID [2022-04-14 19:57:35,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {411#false} is VALID [2022-04-14 19:57:35,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {411#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {411#false} is VALID [2022-04-14 19:57:35,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {411#false} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {411#false} is VALID [2022-04-14 19:57:35,485 INFO L272 TraceCheckUtils]: 15: Hoare triple {411#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {411#false} is VALID [2022-04-14 19:57:35,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {411#false} [85] __VERIFIER_assertENTRY-->L9: 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] {411#false} is VALID [2022-04-14 19:57:35,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {411#false} [89] L9-->L10: 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[] {411#false} is VALID [2022-04-14 19:57:35,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {411#false} is VALID [2022-04-14 19:57:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:35,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:35,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895422622] [2022-04-14 19:57:35,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895422622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:35,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914000021] [2022-04-14 19:57:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:35,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:35,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:35,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:57:35,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 19:57:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:35,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-14 19:57:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:35,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:57:35,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {410#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:35,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {410#true} is VALID [2022-04-14 19:57:35,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:35,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {410#true} {410#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:35,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {410#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:35,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {440#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:35,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {440#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {440#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:35,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {440#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {440#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:35,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {440#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {450#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:35,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {454#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:35,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {454#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:35,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {454#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:35,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {464#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:35,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {464#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {468#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:35,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {468#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-14 19:57:35,877 INFO L272 TraceCheckUtils]: 15: Hoare triple {468#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {475#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:35,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {475#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {479#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:35,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {411#false} is VALID [2022-04-14 19:57:35,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {411#false} is VALID [2022-04-14 19:57:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:35,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:57:36,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {411#false} is VALID [2022-04-14 19:57:36,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {411#false} is VALID [2022-04-14 19:57:36,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {475#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {479#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:36,173 INFO L272 TraceCheckUtils]: 15: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {475#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:36,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:36,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,277 WARN L290 TraceCheckUtils]: 12: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {502#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-14 19:57:38,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {502#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:38,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {410#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {495#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:38,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {410#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:38,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {410#true} {410#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:38,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {410#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:38,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {410#true} is VALID [2022-04-14 19:57:38,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {410#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {410#true} is VALID [2022-04-14 19:57:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 19:57:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914000021] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:38,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:57:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 18 [2022-04-14 19:57:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275117080] [2022-04-14 19:57:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:38,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 19 [2022-04-14 19:57:38,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:38,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:40,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:40,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:40,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:40,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:40,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-14 19:57:40,526 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:42,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:42,868 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-14 19:57:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:57:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 19 [2022-04-14 19:57:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-14 19:57:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-14 19:57:42,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-14 19:57:45,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:45,011 INFO L225 Difference]: With dead ends: 29 [2022-04-14 19:57:45,012 INFO L226 Difference]: Without dead ends: 26 [2022-04-14 19:57:45,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-14 19:57:45,012 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:45,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 19:57:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-14 19:57:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-14 19:57:45,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:45,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-14 19:57:45,015 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-14 19:57:45,015 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-14 19:57:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:45,016 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-14 19:57:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-14 19:57:45,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:45,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:45,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 26 states. [2022-04-14 19:57:45,016 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 26 states. [2022-04-14 19:57:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:45,017 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-14 19:57:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-14 19:57:45,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:45,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:45,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:45,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-14 19:57:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-14 19:57:45,018 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 19 [2022-04-14 19:57:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:45,019 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-14 19:57:45,019 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 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-14 19:57:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-14 19:57:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 19:57:45,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:45,019 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:45,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 19:57:45,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-14 19:57:45,240 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2062699915, now seen corresponding path program 1 times [2022-04-14 19:57:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:45,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956576801] [2022-04-14 19:57:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:45,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:45,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {657#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {650#true} is VALID [2022-04-14 19:57:45,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {650#true} {650#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {650#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {657#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:45,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {650#true} is VALID [2022-04-14 19:57:45,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {650#true} {650#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {655#(= main_~l~0 0)} is VALID [2022-04-14 19:57:45,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {655#(= main_~l~0 0)} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {655#(= main_~l~0 0)} is VALID [2022-04-14 19:57:45,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {655#(= main_~l~0 0)} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {655#(= main_~l~0 0)} is VALID [2022-04-14 19:57:45,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {655#(= main_~l~0 0)} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {655#(= main_~l~0 0)} is VALID [2022-04-14 19:57:45,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {655#(= main_~l~0 0)} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 19:57:45,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 19:57:45,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 19:57:45,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 19:57:45,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {656#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {651#false} is VALID [2022-04-14 19:57:45,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {651#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {651#false} is VALID [2022-04-14 19:57:45,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {651#false} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {651#false} is VALID [2022-04-14 19:57:45,331 INFO L272 TraceCheckUtils]: 16: Hoare triple {651#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {651#false} is VALID [2022-04-14 19:57:45,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {651#false} [85] __VERIFIER_assertENTRY-->L9: 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] {651#false} is VALID [2022-04-14 19:57:45,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {651#false} [89] L9-->L10: 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[] {651#false} is VALID [2022-04-14 19:57:45,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {651#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#false} is VALID [2022-04-14 19:57:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:45,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956576801] [2022-04-14 19:57:45,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956576801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:45,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173488243] [2022-04-14 19:57:45,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:45,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:45,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:57:45,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 19:57:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:45,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-14 19:57:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:45,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:57:45,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {650#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {650#true} is VALID [2022-04-14 19:57:45,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {650#true} {650#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:45,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:45,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:45,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:45,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {676#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {686#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {690#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {703#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {703#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {707#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {707#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {707#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:45,713 INFO L272 TraceCheckUtils]: 16: Hoare triple {707#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {714#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:45,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {718#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:45,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {718#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {651#false} is VALID [2022-04-14 19:57:45,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {651#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#false} is VALID [2022-04-14 19:57:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:45,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:57:45,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {651#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {651#false} is VALID [2022-04-14 19:57:45,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {718#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {651#false} is VALID [2022-04-14 19:57:45,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {718#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:45,917 INFO L272 TraceCheckUtils]: 16: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {714#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:45,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:45,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {741#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:45,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {741#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:45,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:45,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:45,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:45,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {741#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:46,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {741#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:46,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:46,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:46,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {734#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:46,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:46,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {650#true} {650#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:46,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:46,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {650#true} is VALID [2022-04-14 19:57:46,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {650#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#true} is VALID [2022-04-14 19:57:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 19:57:46,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173488243] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:46,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:57:46,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 19:57:46,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247836415] [2022-04-14 19:57:46,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 20 [2022-04-14 19:57:46,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:46,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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-14 19:57:46,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:46,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-14 19:57:46,067 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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-14 19:57:48,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:50,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:52,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:54,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:57:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:54,802 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-14 19:57:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:57:54,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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 20 [2022-04-14 19:57:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:57:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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-14 19:57:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-14 19:57:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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-14 19:57:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-14 19:57:54,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-14 19:57:54,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:54,885 INFO L225 Difference]: With dead ends: 35 [2022-04-14 19:57:54,885 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 19:57:54,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-14 19:57:54,887 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-14 19:57:54,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 4 Unknown, 0 Unchecked, 8.6s Time] [2022-04-14 19:57:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 19:57:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 19:57:54,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:57:54,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-14 19:57:54,895 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-14 19:57:54,895 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-14 19:57:54,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:54,896 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 19:57:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 19:57:54,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:54,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:54,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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 32 states. [2022-04-14 19:57:54,897 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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 32 states. [2022-04-14 19:57:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:57:54,898 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-14 19:57:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 19:57:54,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:57:54,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:57:54,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:57:54,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:57:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-14 19:57:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 19:57:54,903 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 20 [2022-04-14 19:57:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:57:54,903 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 19:57:54,903 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 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-14 19:57:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 19:57:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 19:57:54,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:57:54,905 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:57:54,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 19:57:55,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:55,116 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:57:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:57:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1398118099, now seen corresponding path program 1 times [2022-04-14 19:57:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:57:55,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668499522] [2022-04-14 19:57:55,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:57:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:57:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:55,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {926#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {919#true} is VALID [2022-04-14 19:57:55,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {919#true} {919#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {919#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {926#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 19:57:55,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {919#true} is VALID [2022-04-14 19:57:55,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {919#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {924#(= main_~l~0 0)} is VALID [2022-04-14 19:57:55,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {924#(= main_~l~0 0)} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {924#(= main_~l~0 0)} is VALID [2022-04-14 19:57:55,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {924#(= main_~l~0 0)} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {924#(= main_~l~0 0)} is VALID [2022-04-14 19:57:55,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#(= main_~l~0 0)} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {924#(= main_~l~0 0)} is VALID [2022-04-14 19:57:55,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {924#(= main_~l~0 0)} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {925#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-14 19:57:55,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {925#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {925#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-14 19:57:55,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {925#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-14 19:57:55,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {925#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {920#false} is VALID [2022-04-14 19:57:55,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {920#false} is VALID [2022-04-14 19:57:55,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#false} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#false} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#false} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#false} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {920#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {920#false} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L272 TraceCheckUtils]: 20: Hoare triple {920#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {920#false} [85] __VERIFIER_assertENTRY-->L9: 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] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {920#false} [89] L9-->L10: 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[] {920#false} is VALID [2022-04-14 19:57:55,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {920#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#false} is VALID [2022-04-14 19:57:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 19:57:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:57:55,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668499522] [2022-04-14 19:57:55,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668499522] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:55,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866268719] [2022-04-14 19:57:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:57:55,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:57:55,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:57:55,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 19:57:55,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 19:57:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:55,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 19:57:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:57:55,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:57:55,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {919#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {919#true} is VALID [2022-04-14 19:57:55,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {919#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:55,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {945#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:55,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {945#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:55,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {945#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-14 19:57:55,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {955#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {955#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {959#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {959#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {959#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {959#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {959#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {969#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {969#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {973#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {986#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {986#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {990#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {990#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {990#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} is VALID [2022-04-14 19:57:55,732 INFO L272 TraceCheckUtils]: 20: Hoare triple {990#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {997#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:55,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {1001#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:55,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {1001#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {920#false} is VALID [2022-04-14 19:57:55,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {920#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#false} is VALID [2022-04-14 19:57:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 19:57:55,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:57:55,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {920#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {920#false} is VALID [2022-04-14 19:57:55,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {1001#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {920#false} is VALID [2022-04-14 19:57:55,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {997#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {1001#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 19:57:55,995 INFO L272 TraceCheckUtils]: 20: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {997#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 19:57:55,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:55,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {1024#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1024#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:56,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {1024#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:56,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {1024#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-14 19:57:56,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {919#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {1017#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-14 19:57:56,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {919#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:56,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {919#true} {919#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:56,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {919#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:56,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {919#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {919#true} is VALID [2022-04-14 19:57:56,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {919#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {919#true} is VALID [2022-04-14 19:57:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-14 19:57:56,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866268719] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:57:56,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:57:56,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 19:57:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949934392] [2022-04-14 19:57:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:57:56,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 24 [2022-04-14 19:57:56,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:57:56,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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-14 19:57:58,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:57:58,266 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:57:58,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:57:58,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:57:58,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-14 19:57:58,266 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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-14 19:58:00,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:58:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:00,578 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-14 19:58:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:58:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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 24 [2022-04-14 19:58:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:58:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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-14 19:58:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-14 19:58:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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-14 19:58:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-04-14 19:58:00,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2022-04-14 19:58:02,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:58:02,754 INFO L225 Difference]: With dead ends: 30 [2022-04-14 19:58:02,754 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 19:58:02,755 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-04-14 19:58:02,755 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 19:58:02,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 19:58:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 19:58:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 19:58:02,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:58:02,756 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-14 19:58:02,756 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-14 19:58:02,756 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-14 19:58:02,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:02,756 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:58:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:58:02,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:58:02,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:58:02,757 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-14 19:58:02,757 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-14 19:58:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:02,757 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 19:58:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:58:02,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:58:02,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:58:02,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:58:02,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:58:02,757 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-14 19:58:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 19:58:02,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-14 19:58:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:58:02,757 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 19:58:02,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 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-14 19:58:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 19:58:02,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:58:02,759 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 19:58:02,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 19:58:02,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:58:02,962 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-14 19:58:02,963 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 19:58:02,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:58:02 BasicIcfg [2022-04-14 19:58:02,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 19:58:02,965 INFO L158 Benchmark]: Toolchain (without parser) took 50418.27ms. Allocated memory was 198.2MB in the beginning and 264.2MB in the end (delta: 66.1MB). Free memory was 147.2MB in the beginning and 176.2MB in the end (delta: -28.9MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. [2022-04-14 19:58:02,966 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 19:58:02,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.50ms. Allocated memory is still 198.2MB. Free memory was 147.1MB in the beginning and 173.6MB in the end (delta: -26.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 19:58:02,966 INFO L158 Benchmark]: Boogie Preprocessor took 26.83ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 172.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 19:58:02,966 INFO L158 Benchmark]: RCFGBuilder took 2392.97ms. Allocated memory is still 198.2MB. Free memory was 172.1MB in the beginning and 160.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 19:58:02,966 INFO L158 Benchmark]: IcfgTransformer took 19.17ms. Allocated memory is still 198.2MB. Free memory was 160.6MB in the beginning and 159.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 19:58:02,966 INFO L158 Benchmark]: TraceAbstraction took 47795.13ms. Allocated memory was 198.2MB in the beginning and 264.2MB in the end (delta: 66.1MB). Free memory was 158.9MB in the beginning and 176.2MB in the end (delta: -17.3MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. [2022-04-14 19:58:02,971 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 198.2MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 176.50ms. Allocated memory is still 198.2MB. Free memory was 147.1MB in the beginning and 173.6MB in the end (delta: -26.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.83ms. Allocated memory is still 198.2MB. Free memory was 173.6MB in the beginning and 172.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 2392.97ms. Allocated memory is still 198.2MB. Free memory was 172.1MB in the beginning and 160.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 19.17ms. Allocated memory is still 198.2MB. Free memory was 160.6MB in the beginning and 159.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 47795.13ms. Allocated memory was 198.2MB in the beginning and 264.2MB in the end (delta: 66.1MB). Free memory was 158.9MB in the beginning and 176.2MB in the end (delta: -17.3MB). Peak memory consumption was 49.7MB. 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: 10]: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 22.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 82 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 126 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2161 SizeOfPredicates, 4 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 41/72 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-14 19:58:02,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...