/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/loops/n.c11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:04:16,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:04:16,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:04:16,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:04:16,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:04:16,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:04:16,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:04:16,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:04:16,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:04:16,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:04:16,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:04:16,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:04:16,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:04:16,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:04:16,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:04:16,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:04:16,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:04:16,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:04:16,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:04:16,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:04:16,123 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:04:16,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:04:16,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:04:16,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:04:16,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:04:16,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:04:16,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:04:16,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:04:16,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:04:16,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:04:16,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:04:16,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:04:16,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:04:16,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:04:16,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:04:16,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:04:16,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:04:16,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:04:16,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:04:16,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:04:16,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:04:16,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:04:16,139 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 00:04:16,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:04:16,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:04:16,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:04:16,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:04:16,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:04:16,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:04:16,162 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:04:16,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:04:16,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:04:16,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:04:16,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:04:16,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:04:16,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:04:16,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:04:16,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:04:16,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:04:16,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:04:16,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:04:16,164 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:04:16,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:04:16,165 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:04:16,165 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 00:04:16,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:04:16,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:04:16,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:04:16,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:04:16,374 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:04:16,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c11.c [2022-04-15 00:04:16,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eeb8647f/2eff29bd94b045adb91194b4f60ec5f6/FLAGe718d9888 [2022-04-15 00:04:16,770 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:04:16,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11.c [2022-04-15 00:04:16,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eeb8647f/2eff29bd94b045adb91194b4f60ec5f6/FLAGe718d9888 [2022-04-15 00:04:16,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eeb8647f/2eff29bd94b045adb91194b4f60ec5f6 [2022-04-15 00:04:16,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:04:16,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:04:16,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:16,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:04:16,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:04:16,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:16,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd56d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16, skipping insertion in model container [2022-04-15 00:04:16,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:16,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:04:16,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:04:16,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11.c[317,330] [2022-04-15 00:04:16,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:16,953 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:04:16,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c11.c[317,330] [2022-04-15 00:04:16,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:16,983 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:04:16,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16 WrapperNode [2022-04-15 00:04:16,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:16,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:04:16,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:04:16,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:04:16,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:16,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:16,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:16,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:17,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:17,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:17,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:17,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:04:17,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:04:17,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:04:17,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:04:17,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (1/1) ... [2022-04-15 00:04:17,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:04:17,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:04:17,053 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 00:04:17,071 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 00:04:17,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:04:17,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:04:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:04:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:04:17,084 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:04:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:04:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:04:17,085 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:04:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:04:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:04:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-15 00:04:17,086 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:04:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:04:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:04:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:04:17,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:04:17,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:04:17,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:04:17,131 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:04:17,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:04:17,277 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:04:17,282 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:04:17,282 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:04:17,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:17 BoogieIcfgContainer [2022-04-15 00:04:17,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:04:17,284 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:04:17,284 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:04:17,285 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:04:17,287 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:17" (1/1) ... [2022-04-15 00:04:17,288 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:04:17,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:17 BasicIcfg [2022-04-15 00:04:17,300 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:04:17,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:04:17,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:04:17,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:04:17,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:04:16" (1/4) ... [2022-04-15 00:04:17,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c435d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:17, skipping insertion in model container [2022-04-15 00:04:17,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:16" (2/4) ... [2022-04-15 00:04:17,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c435d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:17, skipping insertion in model container [2022-04-15 00:04:17,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:17" (3/4) ... [2022-04-15 00:04:17,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c435d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:04:17, skipping insertion in model container [2022-04-15 00:04:17,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:17" (4/4) ... [2022-04-15 00:04:17,305 INFO L111 eAbstractionObserver]: Analyzing ICFG n.c11.cqvasr [2022-04-15 00:04:17,324 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:04:17,324 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:04:17,395 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:04:17,400 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 00:04:17,400 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:04:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:04:17,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:17,436 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:17,437 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:17,440 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-15 00:04:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:17,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833936324] [2022-04-15 00:04:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:17,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {24#true} is VALID [2022-04-15 00:04:17,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:04:17,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:04:17,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:17,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {24#true} is VALID [2022-04-15 00:04:17,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:04:17,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:04:17,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 00:04:17,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [51] mainENTRY-->L21-2: Formula: (= v_main_~len~0_2 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1, main_~len~0=v_main_~len~0_2, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~len~0, main_~i~0, main_~a~0] {24#true} is VALID [2022-04-15 00:04:17,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [53] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 00:04:17,624 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} [56] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~len~0_8 4294967296) 5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~len~0=v_main_~len~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0] {25#false} is VALID [2022-04-15 00:04:17,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [60] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-15 00:04:17,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} [63] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 00:04:17,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [65] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 00:04:17,625 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 00:04:17,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:17,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833936324] [2022-04-15 00:04:17,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833936324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:17,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:17,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:04:17,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851219714] [2022-04-15 00:04:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:17,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:04:17,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:17,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:17,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:04:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:04:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:04:17,673 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:17,754 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 00:04:17,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:04:17,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:04:17,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 00:04:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 00:04:17,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 00:04:17,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:17,818 INFO L225 Difference]: With dead ends: 33 [2022-04-15 00:04:17,819 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 00:04:17,821 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 00:04:17,824 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:17,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 00:04:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 00:04:17,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:17,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,853 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,854 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:17,858 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:04:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:04:17,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:17,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:17,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 00:04:17,859 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 00:04:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:17,862 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 00:04:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:04:17,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:17,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:17,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:17,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 00:04:17,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 00:04:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:17,866 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 00:04:17,869 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 00:04:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:04:17,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:17,874 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:17,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:04:17,875 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-15 00:04:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:17,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746176281] [2022-04-15 00:04:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:18,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {123#true} is VALID [2022-04-15 00:04:18,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 00:04:18,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 00:04:18,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:18,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {123#true} is VALID [2022-04-15 00:04:18,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 00:04:18,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 00:04:18,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {123#true} is VALID [2022-04-15 00:04:18,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} [51] mainENTRY-->L21-2: Formula: (= v_main_~len~0_2 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1, main_~len~0=v_main_~len~0_2, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~len~0, main_~i~0, main_~a~0] {128#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(= main_~len~0 0)} [54] L21-2-->L21-3: Formula: (= (mod |v_main_#t~nondet4_2| 256) 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {128#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,013 INFO L272 TraceCheckUtils]: 7: Hoare triple {128#(= main_~len~0 0)} [56] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~len~0_8 4294967296) 5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~len~0=v_main_~len~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0] {129#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:04:18,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {129#(not (= |__VERIFIER_assert_#in~cond| 0))} [60] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {130#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:04:18,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#(not (= __VERIFIER_assert_~cond 0))} [63] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-15 00:04:18,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} [65] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#false} is VALID [2022-04-15 00:04:18,015 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 00:04:18,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:18,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746176281] [2022-04-15 00:04:18,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746176281] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:18,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:18,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:04:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751036091] [2022-04-15 00:04:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:18,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:04:18,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:18,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:18,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:04:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:04:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:04:18,032 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:18,160 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 00:04:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 00:04:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:04:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 00:04:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 00:04:18,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-15 00:04:18,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:18,196 INFO L225 Difference]: With dead ends: 28 [2022-04-15 00:04:18,196 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 00:04:18,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:04:18,200 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:18,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:04:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 00:04:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 00:04:18,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:18,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,205 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,206 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:18,207 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 00:04:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 00:04:18,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:18,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:18,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 00:04:18,208 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 00:04:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:18,209 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 00:04:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 00:04:18,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:18,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:18,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:18,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 00:04:18,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-15 00:04:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:18,212 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 00:04:18,212 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 00:04:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:04:18,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:18,213 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:18,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:04:18,213 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-04-15 00:04:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:18,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503725090] [2022-04-15 00:04:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:18,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {239#true} is VALID [2022-04-15 00:04:18,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {239#true} {239#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:18,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {239#true} is VALID [2022-04-15 00:04:18,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [51] mainENTRY-->L21-2: Formula: (= v_main_~len~0_2 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1, main_~len~0=v_main_~len~0_2, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~len~0, main_~i~0, main_~a~0] {244#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(= main_~len~0 0)} [55] L21-2-->L23: Formula: (not (= (mod |v_main_#t~nondet4_4| 256) 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_4|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {244#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(= main_~len~0 0)} [58] L23-->L23-2: Formula: (not (= (mod v_main_~len~0_1 4294967296) 4)) InVars {main_~len~0=v_main_~len~0_1} OutVars{main_~len~0=v_main_~len~0_1} AuxVars[] AssignedVars[] {244#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(= main_~len~0 0)} [61] L23-2-->L21-2: Formula: (and (= (+ v_main_~len~0_4 1) v_main_~len~0_3) (= v_main_~a~0_2 (store v_main_~a~0_3 (mod v_main_~len~0_4 4294967296) 0))) InVars {main_~len~0=v_main_~len~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~len~0=v_main_~len~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~len~0, main_#t~post5, main_~a~0] {245#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:18,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} [54] L21-2-->L21-3: Formula: (= (mod |v_main_#t~nondet4_2| 256) 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {245#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:18,334 INFO L272 TraceCheckUtils]: 10: Hoare triple {245#(and (<= main_~len~0 1) (not (<= (+ (div main_~len~0 4294967296) 1) 0)))} [56] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~len~0_8 4294967296) 5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~len~0=v_main_~len~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0] {246#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:04:18,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#(not (= |__VERIFIER_assert_#in~cond| 0))} [60] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {247#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:04:18,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {247#(not (= __VERIFIER_assert_~cond 0))} [63] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 00:04:18,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#false} [65] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 00:04:18,337 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 00:04:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:18,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503725090] [2022-04-15 00:04:18,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503725090] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:04:18,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843316949] [2022-04-15 00:04:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:18,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:04:18,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:04:18,342 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 00:04:18,368 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 00:04:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:18,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 00:04:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:18,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:04:18,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {239#true} is VALID [2022-04-15 00:04:18,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [51] mainENTRY-->L21-2: Formula: (= v_main_~len~0_2 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1, main_~len~0=v_main_~len~0_2, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~len~0, main_~i~0, main_~a~0] {244#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(= main_~len~0 0)} [55] L21-2-->L23: Formula: (not (= (mod |v_main_#t~nondet4_4| 256) 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_4|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {244#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#(= main_~len~0 0)} [58] L23-->L23-2: Formula: (not (= (mod v_main_~len~0_1 4294967296) 4)) InVars {main_~len~0=v_main_~len~0_1} OutVars{main_~len~0=v_main_~len~0_1} AuxVars[] AssignedVars[] {244#(= main_~len~0 0)} is VALID [2022-04-15 00:04:18,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(= main_~len~0 0)} [61] L23-2-->L21-2: Formula: (and (= (+ v_main_~len~0_4 1) v_main_~len~0_3) (= v_main_~a~0_2 (store v_main_~a~0_3 (mod v_main_~len~0_4 4294967296) 0))) InVars {main_~len~0=v_main_~len~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~len~0=v_main_~len~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~len~0, main_#t~post5, main_~a~0] {276#(= main_~len~0 1)} is VALID [2022-04-15 00:04:18,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {276#(= main_~len~0 1)} [54] L21-2-->L21-3: Formula: (= (mod |v_main_#t~nondet4_2| 256) 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {276#(= main_~len~0 1)} is VALID [2022-04-15 00:04:18,490 INFO L272 TraceCheckUtils]: 10: Hoare triple {276#(= main_~len~0 1)} [56] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~len~0_8 4294967296) 5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~len~0=v_main_~len~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0] {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:04:18,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:04:18,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} [63] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 00:04:18,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#false} [65] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 00:04:18,492 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 00:04:18,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:04:18,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#false} [65] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 00:04:18,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} [63] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {240#false} is VALID [2022-04-15 00:04:18,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} [60] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:04:18,641 INFO L272 TraceCheckUtils]: 10: Hoare triple {303#(< (mod main_~len~0 4294967296) 5)} [56] L21-3-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~len~0_8 4294967296) 5) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~len~0=v_main_~len~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0] {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:04:18,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#(< (mod main_~len~0 4294967296) 5)} [54] L21-2-->L21-3: Formula: (= (mod |v_main_#t~nondet4_2| 256) 0) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {303#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-15 00:04:18,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(< (mod (+ main_~len~0 1) 4294967296) 5)} [61] L23-2-->L21-2: Formula: (and (= (+ v_main_~len~0_4 1) v_main_~len~0_3) (= v_main_~a~0_2 (store v_main_~a~0_3 (mod v_main_~len~0_4 4294967296) 0))) InVars {main_~len~0=v_main_~len~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~len~0=v_main_~len~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~len~0, main_#t~post5, main_~a~0] {303#(< (mod main_~len~0 4294967296) 5)} is VALID [2022-04-15 00:04:18,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#(< (mod (+ main_~len~0 1) 4294967296) 5)} [58] L23-->L23-2: Formula: (not (= (mod v_main_~len~0_1 4294967296) 4)) InVars {main_~len~0=v_main_~len~0_1} OutVars{main_~len~0=v_main_~len~0_1} AuxVars[] AssignedVars[] {310#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-15 00:04:18,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {310#(< (mod (+ main_~len~0 1) 4294967296) 5)} [55] L21-2-->L23: Formula: (not (= (mod |v_main_#t~nondet4_4| 256) 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_4|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {310#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-15 00:04:18,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} [51] mainENTRY-->L21-2: Formula: (= v_main_~len~0_2 0) InVars {} OutVars{main_~i~0=v_main_~i~0_1, main_~len~0=v_main_~len~0_2, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~len~0, main_~i~0, main_~a~0] {310#(< (mod (+ main_~len~0 1) 4294967296) 5)} is VALID [2022-04-15 00:04:18,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} [48] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} [52] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#true} [49] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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] {239#true} is VALID [2022-04-15 00:04:18,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} [47] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#true} is VALID [2022-04-15 00:04:18,645 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 00:04:18,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843316949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:04:18,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:04:18,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 00:04:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292826986] [2022-04-15 00:04:18,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:04:18,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:04:18,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:18,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:18,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 00:04:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 00:04:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:04:18,672 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:18,913 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 00:04:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:04:18,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:04:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 00:04:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 00:04:18,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-15 00:04:18,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:18,950 INFO L225 Difference]: With dead ends: 30 [2022-04-15 00:04:18,950 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:04:18,951 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-15 00:04:18,951 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:18,952 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:04:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:04:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:04:18,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:18,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:04:18,952 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:04:18,952 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:04:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:18,953 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:04:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:04:18,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:18,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:18,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:04:18,953 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:04:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:18,953 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:04:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:04:18,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:18,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:18,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:18,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:04:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:04:18,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-15 00:04:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:18,954 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:04:18,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:04:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:04:18,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:18,956 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:04:18,984 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 00:04:19,173 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 00:04:19,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:04:19,215 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:04:19,215 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:04:19,215 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:04:19,215 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:04:19,215 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:04:19,215 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:04:19,215 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:04:19,215 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 14 34) the Hoare annotation is: true [2022-04-15 00:04:19,216 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 29) the Hoare annotation is: (< (mod main_~len~0 4294967296) 5) [2022-04-15 00:04:19,216 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 29) the Hoare annotation is: (< (mod main_~len~0 4294967296) 5) [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 24) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point L23-2(lines 23 24) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 14 34) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 14 34) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-15 00:04:19,216 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-15 00:04:19,218 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-15 00:04:19,219 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:04:19,222 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:04:19,223 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:04:19,223 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:04:19,224 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:04:19,225 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:04:19,225 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:04:19,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:04:19 BasicIcfg [2022-04-15 00:04:19,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:04:19,232 INFO L158 Benchmark]: Toolchain (without parser) took 2447.01ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 126.0MB in the beginning and 160.0MB in the end (delta: -34.0MB). Peak memory consumption was 23.2MB. Max. memory is 8.0GB. [2022-04-15 00:04:19,232 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:04:19,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.20ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 125.8MB in the beginning and 211.8MB in the end (delta: -86.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-15 00:04:19,233 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 241.2MB. Free memory was 211.8MB in the beginning and 210.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:04:19,233 INFO L158 Benchmark]: RCFGBuilder took 273.74ms. Allocated memory is still 241.2MB. Free memory was 210.2MB in the beginning and 199.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 00:04:19,233 INFO L158 Benchmark]: IcfgTransformer took 15.80ms. Allocated memory is still 241.2MB. Free memory was 199.7MB in the beginning and 198.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:04:19,233 INFO L158 Benchmark]: TraceAbstraction took 1930.35ms. Allocated memory is still 241.2MB. Free memory was 198.2MB in the beginning and 160.0MB in the end (delta: 38.2MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2022-04-15 00:04:19,234 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.20ms. Allocated memory was 184.5MB in the beginning and 241.2MB in the end (delta: 56.6MB). Free memory was 125.8MB in the beginning and 211.8MB in the end (delta: -86.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 241.2MB. Free memory was 211.8MB in the beginning and 210.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 273.74ms. Allocated memory is still 241.2MB. Free memory was 210.2MB in the beginning and 199.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 15.80ms. Allocated memory is still 241.2MB. Free memory was 199.7MB in the beginning and 198.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 1930.35ms. Allocated memory is still 241.2MB. Free memory was 198.2MB in the beginning and 160.0MB in the end (delta: 38.2MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 43 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 21 NumberOfFragments, 21 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 40 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 165 SizeOfPredicates, 1 NumberOfNonLiveVariables, 59 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: len % 4294967296 < 5 RESULT: Ultimate proved your program to be correct! [2022-04-15 00:04:19,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...