/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:30:34,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:30:34,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:30:34,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:30:34,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:30:34,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:30:34,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:30:34,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:30:34,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:30:34,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:30:34,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:30:34,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:30:34,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:30:34,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:30:34,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:30:34,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:30:34,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:30:34,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:30:34,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:30:34,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:30:34,872 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:30:34,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:30:34,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:30:34,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:30:34,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:30:34,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:30:34,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:30:34,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:30:34,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:30:34,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:30:34,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:30:34,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:30:34,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:30:34,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:30:34,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:30:34,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:30:34,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:30:34,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:30:34,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:30:34,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:30:34,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:30:34,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:30:34,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:30:34,918 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:30:34,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:30:34,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:30:34,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:30:34,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:30:34,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:30:34,921 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:30:34,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:30:34,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:30:34,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:30:34,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:30:34,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:30:34,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:30:34,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:30:34,922 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:30:34,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:30:34,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:30:34,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:30:34,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:30:34,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:30:34,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:30:34,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:30:34,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:30:34,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:30:34,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:30:34,924 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:30:34,924 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:30:34,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:30:34,925 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:30:34,925 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-15 01:30:35,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:30:35,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:30:35,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:30:35,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:30:35,165 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:30:35,166 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c [2022-04-15 01:30:35,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a758f1df5/4e2b733cb6974ab291b3ba74b30c1746/FLAG78b7d5953 [2022-04-15 01:30:35,548 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:30:35,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c [2022-04-15 01:30:35,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a758f1df5/4e2b733cb6974ab291b3ba74b30c1746/FLAG78b7d5953 [2022-04-15 01:30:35,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a758f1df5/4e2b733cb6974ab291b3ba74b30c1746 [2022-04-15 01:30:35,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:30:35,568 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:30:35,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:30:35,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:30:35,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:30:35,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@feb67da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35, skipping insertion in model container [2022-04-15 01:30:35,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:30:35,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:30:35,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[557,570] [2022-04-15 01:30:35,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[613,626] [2022-04-15 01:30:35,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:30:35,746 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:30:35,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[557,570] [2022-04-15 01:30:35,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/linear-inequality-inv-b.c[613,626] [2022-04-15 01:30:35,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:30:35,776 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:30:35,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35 WrapperNode [2022-04-15 01:30:35,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:30:35,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:30:35,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:30:35,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:30:35,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:30:35,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:30:35,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:30:35,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:30:35,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (1/1) ... [2022-04-15 01:30:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:30:35,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:30:35,848 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-15 01:30:35,852 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-15 01:30:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:30:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:30:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:30:35,877 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:30:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:30:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:30:35,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:30:35,931 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:30:35,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:30:36,037 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:30:36,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:30:36,043 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:30:36,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:36 BoogieIcfgContainer [2022-04-15 01:30:36,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:30:36,045 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:30:36,045 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:30:36,046 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:30:36,048 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:36" (1/1) ... [2022-04-15 01:30:36,050 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:30:36,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:30:36 BasicIcfg [2022-04-15 01:30:36,066 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:30:36,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:30:36,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:30:36,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:30:36,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:30:35" (1/4) ... [2022-04-15 01:30:36,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95df320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:36, skipping insertion in model container [2022-04-15 01:30:36,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:35" (2/4) ... [2022-04-15 01:30:36,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95df320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:36, skipping insertion in model container [2022-04-15 01:30:36,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:36" (3/4) ... [2022-04-15 01:30:36,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95df320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:30:36, skipping insertion in model container [2022-04-15 01:30:36,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:30:36" (4/4) ... [2022-04-15 01:30:36,073 INFO L111 eAbstractionObserver]: Analyzing ICFG linear-inequality-inv-b.cqvasr [2022-04-15 01:30:36,076 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:30:36,077 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-04-15 01:30:36,146 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:30:36,152 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-15 01:30:36,152 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-04-15 01:30:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 01:30:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 01:30:36,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:30:36,170 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:30:36,171 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:30:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:30:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash 733275225, now seen corresponding path program 1 times [2022-04-15 01:30:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:30:36,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152105772] [2022-04-15 01:30:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:30:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:36,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:30:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:36,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 01:30:36,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 01:30:36,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 01:30:36,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:30:36,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 01:30:36,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 01:30:36,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 01:30:36,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 01:30:36,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [45] mainENTRY-->L6: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~n~0] {21#true} is VALID [2022-04-15 01:30:36,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [48] L6-->L12-2: Formula: (and (= v_main_~i~0_1 0) (= v_main_~s~0_3 0) (= v_main_~v~0_1 0) (not (= (mod v_main_~n~0_3 256) 0))) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_3, main_~s~0=v_main_~s~0_3} AuxVars[] AssignedVars[main_~v~0, main_~i~0, main_~s~0] {21#true} is VALID [2022-04-15 01:30:36,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {21#true} [50] L12-2-->L12-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 01:30:36,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [53] L12-3-->L18: Formula: (< (mod v_main_~s~0_6 256) (mod v_main_~v~0_3 256)) InVars {main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} OutVars{main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 01:30:36,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [55] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 01:30:36,380 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-15 01:30:36,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:30:36,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152105772] [2022-04-15 01:30:36,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152105772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:30:36,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:30:36,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:30:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774446406] [2022-04-15 01:30:36,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:30:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 01:30:36,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:30:36,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:36,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:30:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:30:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:30:36,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:30:36,442 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:36,507 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 01:30:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:30:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 01:30:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:30:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-04-15 01:30:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-04-15 01:30:36,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-04-15 01:30:36,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:36,572 INFO L225 Difference]: With dead ends: 26 [2022-04-15 01:30:36,572 INFO L226 Difference]: Without dead ends: 11 [2022-04-15 01:30:36,575 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-15 01:30:36,578 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:30:36,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:30:36,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-04-15 01:30:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-04-15 01:30:36,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:30:36,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,607 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,607 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:36,613 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-15 01:30:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-15 01:30:36,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:36,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:36,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-15 01:30:36,614 INFO L87 Difference]: Start difference. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-15 01:30:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:36,616 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-15 01:30:36,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-15 01:30:36,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:36,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:36,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:30:36,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:30:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-04-15 01:30:36,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 10 [2022-04-15 01:30:36,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:30:36,620 INFO L478 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-04-15 01:30:36,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-15 01:30:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-15 01:30:36,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:30:36,625 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:30:36,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:30:36,625 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:30:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:30:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash 733276186, now seen corresponding path program 1 times [2022-04-15 01:30:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:30:36,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555488577] [2022-04-15 01:30:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:36,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:30:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:30:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:36,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98#true} is VALID [2022-04-15 01:30:36,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#true} is VALID [2022-04-15 01:30:36,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98#true} {98#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#true} is VALID [2022-04-15 01:30:36,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {98#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:30:36,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {104#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {98#true} is VALID [2022-04-15 01:30:36,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {98#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#true} is VALID [2022-04-15 01:30:36,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#true} is VALID [2022-04-15 01:30:36,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {98#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#true} is VALID [2022-04-15 01:30:36,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {98#true} [45] mainENTRY-->L6: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~n~0] {98#true} is VALID [2022-04-15 01:30:36,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {98#true} [48] L6-->L12-2: Formula: (and (= v_main_~i~0_1 0) (= v_main_~s~0_3 0) (= v_main_~v~0_1 0) (not (= (mod v_main_~n~0_3 256) 0))) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_3, main_~s~0=v_main_~s~0_3} AuxVars[] AssignedVars[main_~v~0, main_~i~0, main_~s~0] {103#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} is VALID [2022-04-15 01:30:36,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {103#(and (= main_~i~0 0) (not (<= main_~n~0 (* 256 (div main_~n~0 256)))))} [51] L12-2-->L12-3: Formula: (not (< (mod v_main_~i~0_2 4294967296) (mod v_main_~n~0_4 256))) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {99#false} is VALID [2022-04-15 01:30:36,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {99#false} [53] L12-3-->L18: Formula: (< (mod v_main_~s~0_6 256) (mod v_main_~v~0_3 256)) InVars {main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} OutVars{main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} AuxVars[] AssignedVars[] {99#false} is VALID [2022-04-15 01:30:36,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {99#false} [55] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#false} is VALID [2022-04-15 01:30:36,763 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-15 01:30:36,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:30:36,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555488577] [2022-04-15 01:30:36,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555488577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:30:36,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:30:36,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:30:36,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764306124] [2022-04-15 01:30:36,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:30:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 01:30:36,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:30:36,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:36,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:30:36,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:30:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:30:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:30:36,786 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:36,834 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:30:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:30:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-04-15 01:30:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:30:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-15 01:30:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-15 01:30:36,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-04-15 01:30:36,865 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-15 01:30:36,866 INFO L225 Difference]: With dead ends: 15 [2022-04-15 01:30:36,866 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 01:30:36,866 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:30:36,867 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:30:36,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:30:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 01:30:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 01:30:36,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:30:36,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,879 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,879 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:36,882 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 01:30:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 01:30:36,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:36,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:36,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 01:30:36,884 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 01:30:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:36,885 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 01:30:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 01:30:36,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:36,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:36,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:30:36,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:30:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 01:30:36,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2022-04-15 01:30:36,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:30:36,889 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 01:30:36,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 01:30:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 01:30:36,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:30:36,890 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:30:36,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:30:36,890 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:30:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:30:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1256753148, now seen corresponding path program 1 times [2022-04-15 01:30:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:30:36,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978365993] [2022-04-15 01:30:36,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:30:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:30:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:37,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-15 01:30:37,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:30:37,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-15 01:30:37,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} [45] mainENTRY-->L6: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~n~0] {172#true} is VALID [2022-04-15 01:30:37,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#true} [48] L6-->L12-2: Formula: (and (= v_main_~i~0_1 0) (= v_main_~s~0_3 0) (= v_main_~v~0_1 0) (not (= (mod v_main_~n~0_3 256) 0))) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_3, main_~s~0=v_main_~s~0_3} AuxVars[] AssignedVars[main_~v~0, main_~i~0, main_~s~0] {177#(= main_~s~0 0)} is VALID [2022-04-15 01:30:37,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(= main_~s~0 0)} [52] L12-2-->L12-2: Formula: (and (= v_main_~s~0_4 (+ (mod v_main_~v~0_2 256) (mod v_main_~s~0_5 256))) (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) (< (mod v_main_~i~0_4 4294967296) (mod v_main_~n~0_5 256)) (= v_main_~v~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~v~0=v_main_~v~0_2, main_~n~0=v_main_~n~0_5, main_#t~pre6=|v_main_#t~pre6_1|, main_~s~0=v_main_~s~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_~v~0, main_~i~0, main_#t~pre6, main_~s~0] {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 01:30:37,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} [51] L12-2-->L12-3: Formula: (not (< (mod v_main_~i~0_2 4294967296) (mod v_main_~n~0_4 256))) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 01:30:37,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} [53] L12-3-->L18: Formula: (< (mod v_main_~s~0_6 256) (mod v_main_~v~0_3 256)) InVars {main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} OutVars{main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-15 01:30:37,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#false} [55] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-15 01:30:37,024 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-15 01:30:37,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:30:37,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978365993] [2022-04-15 01:30:37,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978365993] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:30:37,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46025800] [2022-04-15 01:30:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:37,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:30:37,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:30:37,027 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-15 01:30:37,028 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-15 01:30:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:37,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 01:30:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:30:37,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:30:37,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-15 01:30:37,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:37,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} [45] mainENTRY-->L6: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~n~0] {172#true} is VALID [2022-04-15 01:30:37,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#true} [48] L6-->L12-2: Formula: (and (= v_main_~i~0_1 0) (= v_main_~s~0_3 0) (= v_main_~v~0_1 0) (not (= (mod v_main_~n~0_3 256) 0))) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_3, main_~s~0=v_main_~s~0_3} AuxVars[] AssignedVars[main_~v~0, main_~i~0, main_~s~0] {177#(= main_~s~0 0)} is VALID [2022-04-15 01:30:37,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {177#(= main_~s~0 0)} [52] L12-2-->L12-2: Formula: (and (= v_main_~s~0_4 (+ (mod v_main_~v~0_2 256) (mod v_main_~s~0_5 256))) (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) (< (mod v_main_~i~0_4 4294967296) (mod v_main_~n~0_5 256)) (= v_main_~v~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~v~0=v_main_~v~0_2, main_~n~0=v_main_~n~0_5, main_#t~pre6=|v_main_#t~pre6_1|, main_~s~0=v_main_~s~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_~v~0, main_~i~0, main_#t~pre6, main_~s~0] {204#(= main_~s~0 (mod main_~v~0 256))} is VALID [2022-04-15 01:30:37,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#(= main_~s~0 (mod main_~v~0 256))} [51] L12-2-->L12-3: Formula: (not (< (mod v_main_~i~0_2 4294967296) (mod v_main_~n~0_4 256))) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {204#(= main_~s~0 (mod main_~v~0 256))} is VALID [2022-04-15 01:30:37,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#(= main_~s~0 (mod main_~v~0 256))} [53] L12-3-->L18: Formula: (< (mod v_main_~s~0_6 256) (mod v_main_~v~0_3 256)) InVars {main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} OutVars{main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-15 01:30:37,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#false} [55] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-15 01:30:37,178 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-15 01:30:37,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:30:38,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#false} [55] L18-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-15 01:30:38,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} [53] L12-3-->L18: Formula: (< (mod v_main_~s~0_6 256) (mod v_main_~v~0_3 256)) InVars {main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} OutVars{main_~v~0=v_main_~v~0_3, main_~s~0=v_main_~s~0_6} AuxVars[] AssignedVars[] {173#false} is VALID [2022-04-15 01:30:38,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} [51] L12-2-->L12-3: Formula: (not (< (mod v_main_~i~0_2 4294967296) (mod v_main_~n~0_4 256))) InVars {main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 01:30:38,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(<= (div (+ (- 256) (* (mod main_~s~0 256) (- 1))) (- 256)) (+ (div (mod main_~s~0 256) 256) 1))} [52] L12-2-->L12-2: Formula: (and (= v_main_~s~0_4 (+ (mod v_main_~v~0_2 256) (mod v_main_~s~0_5 256))) (= v_main_~i~0_3 (+ v_main_~i~0_4 1)) (< (mod v_main_~i~0_4 4294967296) (mod v_main_~n~0_5 256)) (= v_main_~v~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_5, main_~s~0=v_main_~s~0_5} OutVars{main_~i~0=v_main_~i~0_3, main_~v~0=v_main_~v~0_2, main_~n~0=v_main_~n~0_5, main_#t~pre6=|v_main_#t~pre6_1|, main_~s~0=v_main_~s~0_4} AuxVars[] AssignedVars[main_#t~nondet5, main_~v~0, main_~i~0, main_#t~pre6, main_~s~0] {178#(<= (+ (* 256 (div main_~s~0 256)) main_~v~0) (+ main_~s~0 (* (div main_~v~0 256) 256)))} is VALID [2022-04-15 01:30:38,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#true} [48] L6-->L12-2: Formula: (and (= v_main_~i~0_1 0) (= v_main_~s~0_3 0) (= v_main_~v~0_1 0) (not (= (mod v_main_~n~0_3 256) 0))) InVars {main_~n~0=v_main_~n~0_3} OutVars{main_~i~0=v_main_~i~0_1, main_~v~0=v_main_~v~0_1, main_~n~0=v_main_~n~0_3, main_~s~0=v_main_~s~0_3} AuxVars[] AssignedVars[main_~v~0, main_~i~0, main_~s~0] {223#(<= (div (+ (- 256) (* (mod main_~s~0 256) (- 1))) (- 256)) (+ (div (mod main_~s~0 256) 256) 1))} is VALID [2022-04-15 01:30:38,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} [45] mainENTRY-->L6: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~n~0] {172#true} is VALID [2022-04-15 01:30:38,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} [42] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:38,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} [61] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:38,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} [46] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:38,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} [43] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 26) (< 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{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {172#true} is VALID [2022-04-15 01:30:38,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} [41] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {172#true} is VALID [2022-04-15 01:30:38,341 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-15 01:30:38,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46025800] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:30:38,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:30:38,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 01:30:38,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51921478] [2022-04-15 01:30:38,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:30:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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 11 [2022-04-15 01:30:38,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:30:38,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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-15 01:30:38,363 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-15 01:30:38,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 01:30:38,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:30:38,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 01:30:38,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 01:30:38,364 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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-15 01:30:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:38,460 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 01:30:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 01:30:38,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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 11 [2022-04-15 01:30:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:30:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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-15 01:30:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-15 01:30:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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-15 01:30:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-04-15 01:30:38,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-04-15 01:30:38,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:38,493 INFO L225 Difference]: With dead ends: 16 [2022-04-15 01:30:38,493 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 01:30:38,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:30:38,494 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:30:38,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:30:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 01:30:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 01:30:38,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:30:38,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:38,499 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:38,499 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:38,500 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:30:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:30:38,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:38,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:38,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:30:38,501 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 01:30:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:30:38,502 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 01:30:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:30:38,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:30:38,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:30:38,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:30:38,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:30:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:30:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 01:30:38,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 01:30:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:30:38,504 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 01:30:38,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 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-15 01:30:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 01:30:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 01:30:38,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:30:38,505 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:30:38,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 01:30:38,719 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-15 01:30:38,720 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:30:38,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:30:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash 304669786, now seen corresponding path program 2 times [2022-04-15 01:30:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:30:38,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879353361] [2022-04-15 01:30:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:30:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:30:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 01:30:38,746 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 01:30:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 01:30:38,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 01:30:38,775 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 01:30:38,777 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-04-15 01:30:38,778 INFO L788 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-04-15 01:30:38,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 01:30:38,781 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 01:30:38,784 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 01:30:38,799 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 01:30:38,799 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 01:30:38,800 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:30:38,801 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-15 01:30:38,801 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 01:30:38,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:30:38 BasicIcfg [2022-04-15 01:30:38,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 01:30:38,803 INFO L158 Benchmark]: Toolchain (without parser) took 3235.09ms. Allocated memory was 177.2MB in the beginning and 259.0MB in the end (delta: 81.8MB). Free memory was 120.1MB in the beginning and 168.4MB in the end (delta: -48.4MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. [2022-04-15 01:30:38,804 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 144.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 01:30:38,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.82ms. Allocated memory is still 177.2MB. Free memory was 119.9MB in the beginning and 153.9MB in the end (delta: -34.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-15 01:30:38,804 INFO L158 Benchmark]: Boogie Preprocessor took 34.51ms. Allocated memory is still 177.2MB. Free memory was 153.9MB in the beginning and 152.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:30:38,805 INFO L158 Benchmark]: RCFGBuilder took 231.58ms. Allocated memory is still 177.2MB. Free memory was 152.3MB in the beginning and 142.4MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 01:30:38,805 INFO L158 Benchmark]: IcfgTransformer took 21.16ms. Allocated memory is still 177.2MB. Free memory was 142.4MB in the beginning and 141.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 01:30:38,805 INFO L158 Benchmark]: TraceAbstraction took 2734.67ms. Allocated memory was 177.2MB in the beginning and 259.0MB in the end (delta: 81.8MB). Free memory was 140.4MB in the beginning and 168.4MB in the end (delta: -28.1MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2022-04-15 01:30:38,807 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 177.2MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 144.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.82ms. Allocated memory is still 177.2MB. Free memory was 119.9MB in the beginning and 153.9MB in the end (delta: -34.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.51ms. Allocated memory is still 177.2MB. Free memory was 153.9MB in the beginning and 152.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.58ms. Allocated memory is still 177.2MB. Free memory was 152.3MB in the beginning and 142.4MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 21.16ms. Allocated memory is still 177.2MB. Free memory was 142.4MB in the beginning and 141.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2734.67ms. Allocated memory was 177.2MB in the beginning and 259.0MB in the end (delta: 81.8MB). Free memory was 140.4MB in the beginning and 168.4MB in the end (delta: -28.1MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5] unsigned char n = __VERIFIER_nondet_uchar(); [L6] COND FALSE !(n == 0) [L9] unsigned char v = 0; [L10] unsigned char s = 0; [L11] unsigned int i = 0; VAL [i=0, n=2, s=0, v=0] [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i VAL [i=1, n=2, s=255, v=255] [L12] COND TRUE i < n [L13] v = __VERIFIER_nondet_uchar() [L14] s += v [L15] ++i VAL [i=2, n=2, s=0, v=1] [L12] COND FALSE !(i < n) VAL [i=2, n=2, s=0, v=1] [L17] COND TRUE s < v VAL [i=2, n=2, s=0, v=1] [L18] reach_error() VAL [i=2, n=2, s=0, v=1] - UnprovableResult [Line: 22]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 37 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 161 SizeOfPredicates, 2 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 01:30:38,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...