/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/ofuf_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:53:34,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:53:34,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:53:34,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:53:34,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:53:34,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:53:34,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:53:34,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:53:34,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:53:34,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:53:34,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:53:34,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:53:34,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:53:34,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:53:34,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:53:34,103 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:53:34,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:53:34,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:53:34,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:53:34,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:53:34,114 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:53:34,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:53:34,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:53:34,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:53:34,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:53:34,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:53:34,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:53:34,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:53:34,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:53:34,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:53:34,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:53:34,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:53:34,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:53:34,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:53:34,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:53:34,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:53:34,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:53:34,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:53:34,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:53:34,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:53:34,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:53:34,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:53:34,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:53:34,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:53:34,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:53:34,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:53:34,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:53:34,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:53:34,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:53:34,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:53:34,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:53:34,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:53:34,143 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:53:34,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:53:34,143 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:53:34,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:53:34,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:53:34,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:53:34,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:53:34,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:53:34,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:53:34,144 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:53:34,144 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:53:34,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:53:34,144 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:53:34,144 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 09:53:34,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:53:34,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:53:34,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:53:34,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:53:34,381 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:53:34,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/ofuf_1.c [2022-04-08 09:53:34,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac58e12d9/28ede28d91a84b3eb31e1401aa101fee/FLAG61e637ecb [2022-04-08 09:53:34,782 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:53:34,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/ofuf_1.c [2022-04-08 09:53:34,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac58e12d9/28ede28d91a84b3eb31e1401aa101fee/FLAG61e637ecb [2022-04-08 09:53:35,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac58e12d9/28ede28d91a84b3eb31e1401aa101fee [2022-04-08 09:53:35,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:53:35,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:53:35,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:53:35,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:53:35,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:53:35,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e22b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35, skipping insertion in model container [2022-04-08 09:53:35,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:53:35,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:53:35,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/ofuf_1.c[11890,11903] [2022-04-08 09:53:35,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:53:35,433 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:53:35,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/ofuf_1.c[11890,11903] [2022-04-08 09:53:35,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:53:35,507 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:53:35,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35 WrapperNode [2022-04-08 09:53:35,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:53:35,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:53:35,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:53:35,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:53:35,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:53:35,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:53:35,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:53:35,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:53:35,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (1/1) ... [2022-04-08 09:53:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:53:35,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:53:35,610 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-08 09:53:35,632 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-08 09:53:35,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:53:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:53:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:53:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:53:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure avoid_zero [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_107 [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_110 [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_113 [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_114 [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_115 [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_117 [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure Id_MCDC_118 [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:53:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:53:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:53:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:53:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:53:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure avoid_zero [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_107 [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_110 [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_113 [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_114 [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_115 [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 09:53:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_117 [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure Id_MCDC_118 [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:53:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:53:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 09:53:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 09:53:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:53:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-04-08 09:53:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:53:35,762 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:53:35,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:53:36,249 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:53:36,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:53:36,256 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-04-08 09:53:36,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:53:36 BoogieIcfgContainer [2022-04-08 09:53:36,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:53:36,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:53:36,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:53:36,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:53:36,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:53:35" (1/3) ... [2022-04-08 09:53:36,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee23f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:53:36, skipping insertion in model container [2022-04-08 09:53:36,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:53:35" (2/3) ... [2022-04-08 09:53:36,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee23f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:53:36, skipping insertion in model container [2022-04-08 09:53:36,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:53:36" (3/3) ... [2022-04-08 09:53:36,273 INFO L111 eAbstractionObserver]: Analyzing ICFG ofuf_1.c [2022-04-08 09:53:36,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:53:36,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:53:36,309 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:53:36,314 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:53:36,314 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:53:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 98 states have (on average 1.5408163265306123) internal successors, (151), 100 states have internal predecessors, (151), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 09:53:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 09:53:36,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:53:36,345 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:53:36,345 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:53:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:53:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1995573915, now seen corresponding path program 1 times [2022-04-08 09:53:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:36,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1858082045] [2022-04-08 09:53:36,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:53:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1995573915, now seen corresponding path program 2 times [2022-04-08 09:53:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:53:36,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930678423] [2022-04-08 09:53:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:53:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:53:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:53:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:36,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#(and (= |old(~#Id_MCDC_130~0.base)| |~#Id_MCDC_130~0.base|) (= |old(~Id_MCDC_128~0.offset)| ~Id_MCDC_128~0.offset) (= |old(~Id_MCDC_123~0)| ~Id_MCDC_123~0) (= |old(~Id_MCDC_126~0.offset)| ~Id_MCDC_126~0.offset) (= |~#Id_MCDC_130~0.offset| |old(~#Id_MCDC_130~0.offset)|) (= |old(~Id_MCDC_124~0)| ~Id_MCDC_124~0) (= ~Id_MCDC_125~0.base |old(~Id_MCDC_125~0.base)|) (= ~Id_MCDC_128~0.base |old(~Id_MCDC_128~0.base)|) (= |~#Id_MCDC_131~0.base| |old(~#Id_MCDC_131~0.base)|) (= ~Id_MCDC_129~0.offset |old(~Id_MCDC_129~0.offset)|) (= |~#Id_MCDC_131~0.offset| |old(~#Id_MCDC_131~0.offset)|) (= |old(~Id_MCDC_125~0.offset)| ~Id_MCDC_125~0.offset) (= |old(~Id_MCDC_127~0.base)| ~Id_MCDC_127~0.base) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= ~Id_MCDC_127~0.offset |old(~Id_MCDC_127~0.offset)|) (= |old(~Id_MCDC_129~0.base)| ~Id_MCDC_129~0.base) (= |old(~Id_MCDC_126~0.base)| ~Id_MCDC_126~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~Id_MCDC_122~0)| ~Id_MCDC_122~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(114, 4, 0, 1);call write~init~int(115, 4, 1, 1);call write~init~int(118, 4, 2, 1);call write~init~int(100, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(3, 5);call write~init~int(119, 5, 0, 1);call write~init~int(111, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(5, 7);call write~init~int(114, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(118, 7, 2, 1);call write~init~int(100, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(119, 8, 0, 1);call write~init~int(111, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(7, 9);call write~init~int(105, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(46, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(115, 9, 5, 1);call write~init~int(0, 9, 6, 1);call #Ultimate.allocInit(2, 10);call write~init~int(114, 10, 0, 1);call write~init~int(0, 10, 1, 1);~Id_MCDC_122~0 := 0;~Id_MCDC_123~0 := 0;~Id_MCDC_124~0 := 0;~Id_MCDC_125~0.base, ~Id_MCDC_125~0.offset := 0, 0;~Id_MCDC_126~0.base, ~Id_MCDC_126~0.offset := 0, 0;~Id_MCDC_127~0.base, ~Id_MCDC_127~0.offset := 0, 0;~Id_MCDC_128~0.base, ~Id_MCDC_128~0.offset := 0, 0;~Id_MCDC_129~0.base, ~Id_MCDC_129~0.offset := 0, 0;~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset := 11, 0;call #Ultimate.allocInit(16, 11);call write~init~int(0, ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 4 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 8 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 12 + ~#Id_MCDC_130~0.offset, 4);~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset := 12, 0;call #Ultimate.allocInit(36, 12);call write~init~int(0, ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset, 1);call write~init~int(0, ~#Id_MCDC_131~0.base, 1 + ~#Id_MCDC_131~0.offset, 2);call write~init~int(0, ~#Id_MCDC_131~0.base, 3 + ~#Id_MCDC_131~0.offset, 1);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 4 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 12 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 20 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 28 + ~#Id_MCDC_131~0.offset, 8);~Id_MCDC_132~0 := 0; {130#true} is VALID [2022-04-08 09:53:36,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#true} assume true; {130#true} is VALID [2022-04-08 09:53:36,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130#true} {130#true} #386#return; {130#true} is VALID [2022-04-08 09:53:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:53:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:36,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0;havoc ~Id_MCDC_143~0;havoc ~Id_MCDC_144~0;havoc ~Id_MCDC_145~0;call ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset, 4);havoc ~Id_MCDC_147~0;call ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset, 4);call ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset, 4);~Id_MCDC_35~0 := 0;~Id_MCDC_150~0 := 0;~Id_MCDC_36~0 := 0;~Id_MCDC_151~0 := 0;~Id_MCDC_152~0 := 0;call ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset := #Ultimate.allocOnStack(4);call ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset := #Ultimate.allocOnStack(8);havoc ~Id_MCDC_155~0.base, ~Id_MCDC_155~0.offset;havoc ~Id_MCDC_156~0;~Id_MCDC_141~0 := 6144;~Id_MCDC_150~0 := 0; {130#true} is VALID [2022-04-08 09:53:36,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#true} assume !true; {131#false} is VALID [2022-04-08 09:53:36,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#false} assume !(~Id_MCDC_141~0 % 4294967296 <= 6147); {131#false} is VALID [2022-04-08 09:53:36,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#false} #res := 0;call ULTIMATE.dealloc(~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset);havoc ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset);havoc ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset);havoc ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset);havoc ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset);havoc ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset; {131#false} is VALID [2022-04-08 09:53:36,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#false} assume true; {131#false} is VALID [2022-04-08 09:53:36,853 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {131#false} {130#true} #380#return; {131#false} is VALID [2022-04-08 09:53:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:53:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:36,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#true} ~y := #in~y; {130#true} is VALID [2022-04-08 09:53:36,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#true} assume 0 == ~y;assume false; {131#false} is VALID [2022-04-08 09:53:36,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#false} assume true; {131#false} is VALID [2022-04-08 09:53:36,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131#false} {131#false} #374#return; {131#false} is VALID [2022-04-08 09:53:36,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {130#true} call ULTIMATE.init(); {145#(and (= |old(~#Id_MCDC_130~0.base)| |~#Id_MCDC_130~0.base|) (= |old(~Id_MCDC_128~0.offset)| ~Id_MCDC_128~0.offset) (= |old(~Id_MCDC_123~0)| ~Id_MCDC_123~0) (= |old(~Id_MCDC_126~0.offset)| ~Id_MCDC_126~0.offset) (= |~#Id_MCDC_130~0.offset| |old(~#Id_MCDC_130~0.offset)|) (= |old(~Id_MCDC_124~0)| ~Id_MCDC_124~0) (= ~Id_MCDC_125~0.base |old(~Id_MCDC_125~0.base)|) (= ~Id_MCDC_128~0.base |old(~Id_MCDC_128~0.base)|) (= |~#Id_MCDC_131~0.base| |old(~#Id_MCDC_131~0.base)|) (= ~Id_MCDC_129~0.offset |old(~Id_MCDC_129~0.offset)|) (= |~#Id_MCDC_131~0.offset| |old(~#Id_MCDC_131~0.offset)|) (= |old(~Id_MCDC_125~0.offset)| ~Id_MCDC_125~0.offset) (= |old(~Id_MCDC_127~0.base)| ~Id_MCDC_127~0.base) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= ~Id_MCDC_127~0.offset |old(~Id_MCDC_127~0.offset)|) (= |old(~Id_MCDC_129~0.base)| ~Id_MCDC_129~0.base) (= |old(~Id_MCDC_126~0.base)| ~Id_MCDC_126~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~Id_MCDC_122~0)| ~Id_MCDC_122~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:53:36,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#(and (= |old(~#Id_MCDC_130~0.base)| |~#Id_MCDC_130~0.base|) (= |old(~Id_MCDC_128~0.offset)| ~Id_MCDC_128~0.offset) (= |old(~Id_MCDC_123~0)| ~Id_MCDC_123~0) (= |old(~Id_MCDC_126~0.offset)| ~Id_MCDC_126~0.offset) (= |~#Id_MCDC_130~0.offset| |old(~#Id_MCDC_130~0.offset)|) (= |old(~Id_MCDC_124~0)| ~Id_MCDC_124~0) (= ~Id_MCDC_125~0.base |old(~Id_MCDC_125~0.base)|) (= ~Id_MCDC_128~0.base |old(~Id_MCDC_128~0.base)|) (= |~#Id_MCDC_131~0.base| |old(~#Id_MCDC_131~0.base)|) (= ~Id_MCDC_129~0.offset |old(~Id_MCDC_129~0.offset)|) (= |~#Id_MCDC_131~0.offset| |old(~#Id_MCDC_131~0.offset)|) (= |old(~Id_MCDC_125~0.offset)| ~Id_MCDC_125~0.offset) (= |old(~Id_MCDC_127~0.base)| ~Id_MCDC_127~0.base) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= ~Id_MCDC_127~0.offset |old(~Id_MCDC_127~0.offset)|) (= |old(~Id_MCDC_129~0.base)| ~Id_MCDC_129~0.base) (= |old(~Id_MCDC_126~0.base)| ~Id_MCDC_126~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~Id_MCDC_122~0)| ~Id_MCDC_122~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(114, 4, 0, 1);call write~init~int(115, 4, 1, 1);call write~init~int(118, 4, 2, 1);call write~init~int(100, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(3, 5);call write~init~int(119, 5, 0, 1);call write~init~int(111, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(5, 7);call write~init~int(114, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(118, 7, 2, 1);call write~init~int(100, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(119, 8, 0, 1);call write~init~int(111, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(7, 9);call write~init~int(105, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(46, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(115, 9, 5, 1);call write~init~int(0, 9, 6, 1);call #Ultimate.allocInit(2, 10);call write~init~int(114, 10, 0, 1);call write~init~int(0, 10, 1, 1);~Id_MCDC_122~0 := 0;~Id_MCDC_123~0 := 0;~Id_MCDC_124~0 := 0;~Id_MCDC_125~0.base, ~Id_MCDC_125~0.offset := 0, 0;~Id_MCDC_126~0.base, ~Id_MCDC_126~0.offset := 0, 0;~Id_MCDC_127~0.base, ~Id_MCDC_127~0.offset := 0, 0;~Id_MCDC_128~0.base, ~Id_MCDC_128~0.offset := 0, 0;~Id_MCDC_129~0.base, ~Id_MCDC_129~0.offset := 0, 0;~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset := 11, 0;call #Ultimate.allocInit(16, 11);call write~init~int(0, ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 4 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 8 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 12 + ~#Id_MCDC_130~0.offset, 4);~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset := 12, 0;call #Ultimate.allocInit(36, 12);call write~init~int(0, ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset, 1);call write~init~int(0, ~#Id_MCDC_131~0.base, 1 + ~#Id_MCDC_131~0.offset, 2);call write~init~int(0, ~#Id_MCDC_131~0.base, 3 + ~#Id_MCDC_131~0.offset, 1);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 4 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 12 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 20 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 28 + ~#Id_MCDC_131~0.offset, 8);~Id_MCDC_132~0 := 0; {130#true} is VALID [2022-04-08 09:53:36,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {130#true} assume true; {130#true} is VALID [2022-04-08 09:53:36,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130#true} {130#true} #386#return; {130#true} is VALID [2022-04-08 09:53:36,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {130#true} call #t~ret62 := main(); {130#true} is VALID [2022-04-08 09:53:36,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {130#true} havoc ~Id_MCDC_161~0.base, ~Id_MCDC_161~0.offset;havoc ~Id_MCDC_162~0.base, ~Id_MCDC_162~0.offset;havoc ~Id_MCDC_163~0.base, ~Id_MCDC_163~0.offset;havoc ~Id_MCDC_164~0.base, ~Id_MCDC_164~0.offset;havoc ~Id_MCDC_165~0.base, ~Id_MCDC_165~0.offset;havoc ~Id_MCDC_166~0.base, ~Id_MCDC_166~0.offset;havoc ~Id_MCDC_167~0;havoc ~Id_MCDC_168~0;havoc ~Id_MCDC_169~0;havoc ~Id_MCDC_170~0;havoc ~Id_MCDC_171~0;havoc ~Id_MCDC_172~0;havoc ~Id_MCDC_173~0;havoc ~Id_MCDC_174~0;havoc ~Id_MCDC_175~0;havoc ~Id_MCDC_176~0.base, ~Id_MCDC_176~0.offset;havoc ~Id_MCDC_177~0;havoc ~Id_MCDC_178~0;~Id_MCDC_179~0 := 0;~Id_MCDC_180~0 := 0;havoc ~Id_MCDC_181~0;havoc ~Id_MCDC_182~0;havoc ~Id_MCDC_183~0.Id_MCDC_77.base, ~Id_MCDC_183~0.Id_MCDC_77.offset, ~Id_MCDC_183~0.Id_MCDC_78.base, ~Id_MCDC_183~0.Id_MCDC_78.offset, ~Id_MCDC_183~0.Id_MCDC_79.base, ~Id_MCDC_183~0.Id_MCDC_79.offset, ~Id_MCDC_183~0.Id_MCDC_80.base, ~Id_MCDC_183~0.Id_MCDC_80.offset, ~Id_MCDC_183~0.Id_MCDC_81.base, ~Id_MCDC_183~0.Id_MCDC_81.offset, ~Id_MCDC_183~0.Id_MCDC_82.base, ~Id_MCDC_183~0.Id_MCDC_82.offset, ~Id_MCDC_183~0.Id_MCDC_83.base, ~Id_MCDC_183~0.Id_MCDC_83.offset, ~Id_MCDC_183~0.Id_MCDC_84.base, ~Id_MCDC_183~0.Id_MCDC_84.offset, ~Id_MCDC_183~0.Id_MCDC_85.base, ~Id_MCDC_183~0.Id_MCDC_85.offset;call #t~ret61.base, #t~ret61.offset := fopen(9, 0, 10, 0);~Id_MCDC_176~0.base, ~Id_MCDC_176~0.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {130#true} is VALID [2022-04-08 09:53:36,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {130#true} assume !(~Id_MCDC_176~0.base == 0 && ~Id_MCDC_176~0.offset == 0); {130#true} is VALID [2022-04-08 09:53:36,867 INFO L272 TraceCheckUtils]: 7: Hoare triple {130#true} call Id_MCDC_118(); {130#true} is VALID [2022-04-08 09:53:36,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#true} havoc ~Id_MCDC_159~0;havoc ~Id_MCDC_160~0.base, ~Id_MCDC_160~0.offset; {130#true} is VALID [2022-04-08 09:53:36,869 INFO L272 TraceCheckUtils]: 9: Hoare triple {130#true} call Id_MCDC_117(); {130#true} is VALID [2022-04-08 09:53:36,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#true} call ~#Id_MCDC_157~0.base, ~#Id_MCDC_157~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_157~0.base, ~#Id_MCDC_157~0.offset, 1);call write~init~int(0, ~#Id_MCDC_157~0.base, 1 + ~#Id_MCDC_157~0.offset, 1);call write~init~int(0, ~#Id_MCDC_157~0.base, 2 + ~#Id_MCDC_157~0.offset, 1);call write~init~int(0, ~#Id_MCDC_157~0.base, 3 + ~#Id_MCDC_157~0.offset, 1);~Id_MCDC_158~0 := 0;call #t~malloc50.base, #t~malloc50.offset := #Ultimate.allocOnHeap(372);call write~$Pointer$(#t~malloc50.base, #t~malloc50.offset, ~#Id_MCDC_131~0.base, 20 + ~#Id_MCDC_131~0.offset, 8);havoc #t~malloc50.base, #t~malloc50.offset; {130#true} is VALID [2022-04-08 09:53:36,871 INFO L272 TraceCheckUtils]: 11: Hoare triple {130#true} call #t~ret51 := Id_MCDC_115(); {146#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-08 09:53:36,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0;havoc ~Id_MCDC_143~0;havoc ~Id_MCDC_144~0;havoc ~Id_MCDC_145~0;call ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset, 4);havoc ~Id_MCDC_147~0;call ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset, 4);call ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset, 4);~Id_MCDC_35~0 := 0;~Id_MCDC_150~0 := 0;~Id_MCDC_36~0 := 0;~Id_MCDC_151~0 := 0;~Id_MCDC_152~0 := 0;call ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset := #Ultimate.allocOnStack(4);call ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset := #Ultimate.allocOnStack(8);havoc ~Id_MCDC_155~0.base, ~Id_MCDC_155~0.offset;havoc ~Id_MCDC_156~0;~Id_MCDC_141~0 := 6144;~Id_MCDC_150~0 := 0; {130#true} is VALID [2022-04-08 09:53:36,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#true} assume !true; {131#false} is VALID [2022-04-08 09:53:36,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {131#false} assume !(~Id_MCDC_141~0 % 4294967296 <= 6147); {131#false} is VALID [2022-04-08 09:53:36,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {131#false} #res := 0;call ULTIMATE.dealloc(~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset);havoc ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset);havoc ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset);havoc ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset);havoc ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset);havoc ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset; {131#false} is VALID [2022-04-08 09:53:36,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {131#false} assume true; {131#false} is VALID [2022-04-08 09:53:36,873 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {131#false} {130#true} #380#return; {131#false} is VALID [2022-04-08 09:53:36,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {131#false} havoc #t~ret51;~Id_MCDC_158~0 := 0; {131#false} is VALID [2022-04-08 09:53:36,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {131#false} assume !(~Id_MCDC_158~0 % 4294967296 < 4); {131#false} is VALID [2022-04-08 09:53:36,873 INFO L272 TraceCheckUtils]: 20: Hoare triple {131#false} call #t~ret60 := Id_MCDC_113(4, ~#Id_MCDC_157~0.base, ~#Id_MCDC_157~0.offset); {131#false} is VALID [2022-04-08 09:53:36,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#false} ~Id_MCDC_111 := #in~Id_MCDC_111;~Id_MCDC_112.base, ~Id_MCDC_112.offset := #in~Id_MCDC_112.base, #in~Id_MCDC_112.offset;~Id_MCDC_139~0 := 0;~Id_MCDC_140~0 := 0; {131#false} is VALID [2022-04-08 09:53:36,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#false} assume !(~Id_MCDC_111 % 4294967296 < 2); {131#false} is VALID [2022-04-08 09:53:36,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#false} assume !(2 != ~Id_MCDC_111 % 4294967296);call #t~mem19 := read~int(~Id_MCDC_112.base, 1 + ~Id_MCDC_112.offset, 1);~Id_MCDC_140~0 := #t~mem19;havoc #t~mem19; {131#false} is VALID [2022-04-08 09:53:36,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {131#false} call #t~mem20 := read~int(~Id_MCDC_112.base, ~Id_MCDC_112.offset, 1); {131#false} is VALID [2022-04-08 09:53:36,875 INFO L272 TraceCheckUtils]: 25: Hoare triple {131#false} call #t~ret21 := Id_MCDC_110(#t~mem20, ~Id_MCDC_140~0); {131#false} is VALID [2022-04-08 09:53:36,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {131#false} ~Id_MCDC_108 := #in~Id_MCDC_108;~Id_MCDC_109 := #in~Id_MCDC_109;~Id_MCDC_135~0 := 0;~Id_MCDC_136~0 := 0;~Id_MCDC_137~0 := 1;~Id_MCDC_138~0 := 0; {131#false} is VALID [2022-04-08 09:53:36,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {131#false} assume ~Id_MCDC_108 % 4294967296 > ~Id_MCDC_109 % 4294967296;~Id_MCDC_135~0 := ~Id_MCDC_108;~Id_MCDC_136~0 := ~Id_MCDC_109; {131#false} is VALID [2022-04-08 09:53:36,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {131#false} assume !!(0 != ~Id_MCDC_137~0 % 4294967296); {131#false} is VALID [2022-04-08 09:53:36,876 INFO L272 TraceCheckUtils]: 29: Hoare triple {131#false} call avoid_zero((if 0 != ~Id_MCDC_136~0 % 4294967296 then 1 else 0)); {130#true} is VALID [2022-04-08 09:53:36,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {130#true} ~y := #in~y; {130#true} is VALID [2022-04-08 09:53:36,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {130#true} assume 0 == ~y;assume false; {131#false} is VALID [2022-04-08 09:53:36,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {131#false} assume true; {131#false} is VALID [2022-04-08 09:53:36,877 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {131#false} {131#false} #374#return; {131#false} is VALID [2022-04-08 09:53:36,878 INFO L272 TraceCheckUtils]: 34: Hoare triple {131#false} call __VERIFIER_assert((if (if ~Id_MCDC_135~0 % 4294967296 < 0 && 0 != ~Id_MCDC_135~0 % 4294967296 % (~Id_MCDC_136~0 % 4294967296) then (if ~Id_MCDC_136~0 % 4294967296 < 0 then ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296) - 1 else 1 + ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) else ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) % 4294967296 >= 0 && (if ~Id_MCDC_135~0 % 4294967296 < 0 && 0 != ~Id_MCDC_135~0 % 4294967296 % (~Id_MCDC_136~0 % 4294967296) then (if ~Id_MCDC_136~0 % 4294967296 < 0 then ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296) - 1 else 1 + ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) else ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) % 4294967296 <= 4294967295 then 1 else 0)); {131#false} is VALID [2022-04-08 09:53:36,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {131#false} ~Id_MCDC_121 := #in~Id_MCDC_121; {131#false} is VALID [2022-04-08 09:53:36,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {131#false} assume 0 == ~Id_MCDC_121; {131#false} is VALID [2022-04-08 09:53:36,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {131#false} assume !false; {131#false} is VALID [2022-04-08 09:53:36,879 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-08 09:53:36,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:53:36,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930678423] [2022-04-08 09:53:36,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930678423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:36,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:36,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:53:36,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:53:36,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1858082045] [2022-04-08 09:53:36,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1858082045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:36,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:36,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:53:36,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281659900] [2022-04-08 09:53:36,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:53:36,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-04-08 09:53:36,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:53:36,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 09:53:36,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:36,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:53:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:36,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:53:36,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:53:36,995 INFO L87 Difference]: Start difference. First operand has 127 states, 98 states have (on average 1.5408163265306123) internal successors, (151), 100 states have internal predecessors, (151), 16 states have call successors, (16), 11 states have call predecessors, (16), 11 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 09:53:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:38,097 INFO L93 Difference]: Finished difference Result 241 states and 361 transitions. [2022-04-08 09:53:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 09:53:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-04-08 09:53:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:53:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 09:53:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2022-04-08 09:53:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 09:53:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2022-04-08 09:53:38,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 361 transitions. [2022-04-08 09:53:38,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:38,702 INFO L225 Difference]: With dead ends: 241 [2022-04-08 09:53:38,703 INFO L226 Difference]: Without dead ends: 118 [2022-04-08 09:53:38,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:53:38,712 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 236 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:53:38,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 137 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:53:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-08 09:53:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-08 09:53:38,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:53:38,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:53:38,778 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:53:38,779 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:53:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:38,786 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2022-04-08 09:53:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-04-08 09:53:38,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:38,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:38,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 118 states. [2022-04-08 09:53:38,790 INFO L87 Difference]: Start difference. First operand has 118 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 118 states. [2022-04-08 09:53:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:38,796 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2022-04-08 09:53:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-04-08 09:53:38,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:38,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:38,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:53:38,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:53:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 16 states have call successors, (16), 11 states have call predecessors, (16), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 09:53:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2022-04-08 09:53:38,806 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 38 [2022-04-08 09:53:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:53:38,806 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2022-04-08 09:53:38,806 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 09:53:38,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 164 transitions. [2022-04-08 09:53:39,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-04-08 09:53:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 09:53:39,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:53:39,096 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:53:39,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:53:39,097 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:53:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:53:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash -946031849, now seen corresponding path program 1 times [2022-04-08 09:53:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:39,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973829397] [2022-04-08 09:53:39,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:53:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -946031849, now seen corresponding path program 2 times [2022-04-08 09:53:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:53:39,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634979947] [2022-04-08 09:53:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:53:39,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:53:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:53:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:39,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {1123#(and (= |old(~#Id_MCDC_130~0.base)| |~#Id_MCDC_130~0.base|) (= |old(~Id_MCDC_128~0.offset)| ~Id_MCDC_128~0.offset) (= |old(~Id_MCDC_123~0)| ~Id_MCDC_123~0) (= |old(~Id_MCDC_126~0.offset)| ~Id_MCDC_126~0.offset) (= |~#Id_MCDC_130~0.offset| |old(~#Id_MCDC_130~0.offset)|) (= |old(~Id_MCDC_124~0)| ~Id_MCDC_124~0) (= ~Id_MCDC_125~0.base |old(~Id_MCDC_125~0.base)|) (= ~Id_MCDC_128~0.base |old(~Id_MCDC_128~0.base)|) (= |~#Id_MCDC_131~0.base| |old(~#Id_MCDC_131~0.base)|) (= ~Id_MCDC_129~0.offset |old(~Id_MCDC_129~0.offset)|) (= |~#Id_MCDC_131~0.offset| |old(~#Id_MCDC_131~0.offset)|) (= |old(~Id_MCDC_125~0.offset)| ~Id_MCDC_125~0.offset) (= |old(~Id_MCDC_127~0.base)| ~Id_MCDC_127~0.base) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= ~Id_MCDC_127~0.offset |old(~Id_MCDC_127~0.offset)|) (= |old(~Id_MCDC_129~0.base)| ~Id_MCDC_129~0.base) (= |old(~Id_MCDC_126~0.base)| ~Id_MCDC_126~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~Id_MCDC_122~0)| ~Id_MCDC_122~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(114, 4, 0, 1);call write~init~int(115, 4, 1, 1);call write~init~int(118, 4, 2, 1);call write~init~int(100, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(3, 5);call write~init~int(119, 5, 0, 1);call write~init~int(111, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(5, 7);call write~init~int(114, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(118, 7, 2, 1);call write~init~int(100, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(119, 8, 0, 1);call write~init~int(111, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(7, 9);call write~init~int(105, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(46, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(115, 9, 5, 1);call write~init~int(0, 9, 6, 1);call #Ultimate.allocInit(2, 10);call write~init~int(114, 10, 0, 1);call write~init~int(0, 10, 1, 1);~Id_MCDC_122~0 := 0;~Id_MCDC_123~0 := 0;~Id_MCDC_124~0 := 0;~Id_MCDC_125~0.base, ~Id_MCDC_125~0.offset := 0, 0;~Id_MCDC_126~0.base, ~Id_MCDC_126~0.offset := 0, 0;~Id_MCDC_127~0.base, ~Id_MCDC_127~0.offset := 0, 0;~Id_MCDC_128~0.base, ~Id_MCDC_128~0.offset := 0, 0;~Id_MCDC_129~0.base, ~Id_MCDC_129~0.offset := 0, 0;~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset := 11, 0;call #Ultimate.allocInit(16, 11);call write~init~int(0, ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 4 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 8 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 12 + ~#Id_MCDC_130~0.offset, 4);~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset := 12, 0;call #Ultimate.allocInit(36, 12);call write~init~int(0, ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset, 1);call write~init~int(0, ~#Id_MCDC_131~0.base, 1 + ~#Id_MCDC_131~0.offset, 2);call write~init~int(0, ~#Id_MCDC_131~0.base, 3 + ~#Id_MCDC_131~0.offset, 1);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 4 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 12 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 20 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 28 + ~#Id_MCDC_131~0.offset, 8);~Id_MCDC_132~0 := 0; {1106#true} is VALID [2022-04-08 09:53:39,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-08 09:53:39,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #386#return; {1106#true} is VALID [2022-04-08 09:53:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 09:53:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:39,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0;havoc ~Id_MCDC_143~0;havoc ~Id_MCDC_144~0;havoc ~Id_MCDC_145~0;call ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset, 4);havoc ~Id_MCDC_147~0;call ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset, 4);call ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset, 4);~Id_MCDC_35~0 := 0;~Id_MCDC_150~0 := 0;~Id_MCDC_36~0 := 0;~Id_MCDC_151~0 := 0;~Id_MCDC_152~0 := 0;call ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset := #Ultimate.allocOnStack(4);call ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset := #Ultimate.allocOnStack(8);havoc ~Id_MCDC_155~0.base, ~Id_MCDC_155~0.offset;havoc ~Id_MCDC_156~0;~Id_MCDC_141~0 := 6144;~Id_MCDC_150~0 := 0; {1106#true} is VALID [2022-04-08 09:53:39,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#true} assume !(~Id_MCDC_150~0 % 256 < 4); {1106#true} is VALID [2022-04-08 09:53:39,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {1106#true} assume !(~Id_MCDC_141~0 % 4294967296 <= 6147); {1106#true} is VALID [2022-04-08 09:53:39,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {1106#true} #res := 0;call ULTIMATE.dealloc(~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset);havoc ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset);havoc ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset);havoc ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset);havoc ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset);havoc ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset; {1106#true} is VALID [2022-04-08 09:53:39,314 INFO L290 TraceCheckUtils]: 4: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-08 09:53:39,314 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1106#true} {1106#true} #380#return; {1106#true} is VALID [2022-04-08 09:53:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-08 09:53:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:53:39,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {1106#true} ~y := #in~y; {1106#true} is VALID [2022-04-08 09:53:39,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#true} assume !(0 == ~y); {1106#true} is VALID [2022-04-08 09:53:39,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-08 09:53:39,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1106#true} {1106#true} #374#return; {1106#true} is VALID [2022-04-08 09:53:39,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1123#(and (= |old(~#Id_MCDC_130~0.base)| |~#Id_MCDC_130~0.base|) (= |old(~Id_MCDC_128~0.offset)| ~Id_MCDC_128~0.offset) (= |old(~Id_MCDC_123~0)| ~Id_MCDC_123~0) (= |old(~Id_MCDC_126~0.offset)| ~Id_MCDC_126~0.offset) (= |~#Id_MCDC_130~0.offset| |old(~#Id_MCDC_130~0.offset)|) (= |old(~Id_MCDC_124~0)| ~Id_MCDC_124~0) (= ~Id_MCDC_125~0.base |old(~Id_MCDC_125~0.base)|) (= ~Id_MCDC_128~0.base |old(~Id_MCDC_128~0.base)|) (= |~#Id_MCDC_131~0.base| |old(~#Id_MCDC_131~0.base)|) (= ~Id_MCDC_129~0.offset |old(~Id_MCDC_129~0.offset)|) (= |~#Id_MCDC_131~0.offset| |old(~#Id_MCDC_131~0.offset)|) (= |old(~Id_MCDC_125~0.offset)| ~Id_MCDC_125~0.offset) (= |old(~Id_MCDC_127~0.base)| ~Id_MCDC_127~0.base) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= ~Id_MCDC_127~0.offset |old(~Id_MCDC_127~0.offset)|) (= |old(~Id_MCDC_129~0.base)| ~Id_MCDC_129~0.base) (= |old(~Id_MCDC_126~0.base)| ~Id_MCDC_126~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~Id_MCDC_122~0)| ~Id_MCDC_122~0) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:53:39,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {1123#(and (= |old(~#Id_MCDC_130~0.base)| |~#Id_MCDC_130~0.base|) (= |old(~Id_MCDC_128~0.offset)| ~Id_MCDC_128~0.offset) (= |old(~Id_MCDC_123~0)| ~Id_MCDC_123~0) (= |old(~Id_MCDC_126~0.offset)| ~Id_MCDC_126~0.offset) (= |~#Id_MCDC_130~0.offset| |old(~#Id_MCDC_130~0.offset)|) (= |old(~Id_MCDC_124~0)| ~Id_MCDC_124~0) (= ~Id_MCDC_125~0.base |old(~Id_MCDC_125~0.base)|) (= ~Id_MCDC_128~0.base |old(~Id_MCDC_128~0.base)|) (= |~#Id_MCDC_131~0.base| |old(~#Id_MCDC_131~0.base)|) (= ~Id_MCDC_129~0.offset |old(~Id_MCDC_129~0.offset)|) (= |~#Id_MCDC_131~0.offset| |old(~#Id_MCDC_131~0.offset)|) (= |old(~Id_MCDC_125~0.offset)| ~Id_MCDC_125~0.offset) (= |old(~Id_MCDC_127~0.base)| ~Id_MCDC_127~0.base) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= ~Id_MCDC_127~0.offset |old(~Id_MCDC_127~0.offset)|) (= |old(~Id_MCDC_129~0.base)| ~Id_MCDC_129~0.base) (= |old(~Id_MCDC_126~0.base)| ~Id_MCDC_126~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~Id_MCDC_122~0)| ~Id_MCDC_122~0) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(5, 4);call write~init~int(114, 4, 0, 1);call write~init~int(115, 4, 1, 1);call write~init~int(118, 4, 2, 1);call write~init~int(100, 4, 3, 1);call write~init~int(0, 4, 4, 1);call #Ultimate.allocInit(3, 5);call write~init~int(119, 5, 0, 1);call write~init~int(111, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(20, 6);call #Ultimate.allocInit(5, 7);call write~init~int(114, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(118, 7, 2, 1);call write~init~int(100, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(3, 8);call write~init~int(119, 8, 0, 1);call write~init~int(111, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(7, 9);call write~init~int(105, 9, 0, 1);call write~init~int(110, 9, 1, 1);call write~init~int(46, 9, 2, 1);call write~init~int(101, 9, 3, 1);call write~init~int(100, 9, 4, 1);call write~init~int(115, 9, 5, 1);call write~init~int(0, 9, 6, 1);call #Ultimate.allocInit(2, 10);call write~init~int(114, 10, 0, 1);call write~init~int(0, 10, 1, 1);~Id_MCDC_122~0 := 0;~Id_MCDC_123~0 := 0;~Id_MCDC_124~0 := 0;~Id_MCDC_125~0.base, ~Id_MCDC_125~0.offset := 0, 0;~Id_MCDC_126~0.base, ~Id_MCDC_126~0.offset := 0, 0;~Id_MCDC_127~0.base, ~Id_MCDC_127~0.offset := 0, 0;~Id_MCDC_128~0.base, ~Id_MCDC_128~0.offset := 0, 0;~Id_MCDC_129~0.base, ~Id_MCDC_129~0.offset := 0, 0;~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset := 11, 0;call #Ultimate.allocInit(16, 11);call write~init~int(0, ~#Id_MCDC_130~0.base, ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 4 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 8 + ~#Id_MCDC_130~0.offset, 4);call write~init~int(0, ~#Id_MCDC_130~0.base, 12 + ~#Id_MCDC_130~0.offset, 4);~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset := 12, 0;call #Ultimate.allocInit(36, 12);call write~init~int(0, ~#Id_MCDC_131~0.base, ~#Id_MCDC_131~0.offset, 1);call write~init~int(0, ~#Id_MCDC_131~0.base, 1 + ~#Id_MCDC_131~0.offset, 2);call write~init~int(0, ~#Id_MCDC_131~0.base, 3 + ~#Id_MCDC_131~0.offset, 1);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 4 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 12 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 20 + ~#Id_MCDC_131~0.offset, 8);call write~init~$Pointer$(0, 0, ~#Id_MCDC_131~0.base, 28 + ~#Id_MCDC_131~0.offset, 8);~Id_MCDC_132~0 := 0; {1106#true} is VALID [2022-04-08 09:53:39,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-08 09:53:39,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1106#true} {1106#true} #386#return; {1106#true} is VALID [2022-04-08 09:53:39,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {1106#true} call #t~ret62 := main(); {1106#true} is VALID [2022-04-08 09:53:39,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {1106#true} havoc ~Id_MCDC_161~0.base, ~Id_MCDC_161~0.offset;havoc ~Id_MCDC_162~0.base, ~Id_MCDC_162~0.offset;havoc ~Id_MCDC_163~0.base, ~Id_MCDC_163~0.offset;havoc ~Id_MCDC_164~0.base, ~Id_MCDC_164~0.offset;havoc ~Id_MCDC_165~0.base, ~Id_MCDC_165~0.offset;havoc ~Id_MCDC_166~0.base, ~Id_MCDC_166~0.offset;havoc ~Id_MCDC_167~0;havoc ~Id_MCDC_168~0;havoc ~Id_MCDC_169~0;havoc ~Id_MCDC_170~0;havoc ~Id_MCDC_171~0;havoc ~Id_MCDC_172~0;havoc ~Id_MCDC_173~0;havoc ~Id_MCDC_174~0;havoc ~Id_MCDC_175~0;havoc ~Id_MCDC_176~0.base, ~Id_MCDC_176~0.offset;havoc ~Id_MCDC_177~0;havoc ~Id_MCDC_178~0;~Id_MCDC_179~0 := 0;~Id_MCDC_180~0 := 0;havoc ~Id_MCDC_181~0;havoc ~Id_MCDC_182~0;havoc ~Id_MCDC_183~0.Id_MCDC_77.base, ~Id_MCDC_183~0.Id_MCDC_77.offset, ~Id_MCDC_183~0.Id_MCDC_78.base, ~Id_MCDC_183~0.Id_MCDC_78.offset, ~Id_MCDC_183~0.Id_MCDC_79.base, ~Id_MCDC_183~0.Id_MCDC_79.offset, ~Id_MCDC_183~0.Id_MCDC_80.base, ~Id_MCDC_183~0.Id_MCDC_80.offset, ~Id_MCDC_183~0.Id_MCDC_81.base, ~Id_MCDC_183~0.Id_MCDC_81.offset, ~Id_MCDC_183~0.Id_MCDC_82.base, ~Id_MCDC_183~0.Id_MCDC_82.offset, ~Id_MCDC_183~0.Id_MCDC_83.base, ~Id_MCDC_183~0.Id_MCDC_83.offset, ~Id_MCDC_183~0.Id_MCDC_84.base, ~Id_MCDC_183~0.Id_MCDC_84.offset, ~Id_MCDC_183~0.Id_MCDC_85.base, ~Id_MCDC_183~0.Id_MCDC_85.offset;call #t~ret61.base, #t~ret61.offset := fopen(9, 0, 10, 0);~Id_MCDC_176~0.base, ~Id_MCDC_176~0.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {1106#true} is VALID [2022-04-08 09:53:39,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {1106#true} assume !(~Id_MCDC_176~0.base == 0 && ~Id_MCDC_176~0.offset == 0); {1106#true} is VALID [2022-04-08 09:53:39,322 INFO L272 TraceCheckUtils]: 7: Hoare triple {1106#true} call Id_MCDC_118(); {1106#true} is VALID [2022-04-08 09:53:39,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {1106#true} havoc ~Id_MCDC_159~0;havoc ~Id_MCDC_160~0.base, ~Id_MCDC_160~0.offset; {1106#true} is VALID [2022-04-08 09:53:39,323 INFO L272 TraceCheckUtils]: 9: Hoare triple {1106#true} call Id_MCDC_117(); {1106#true} is VALID [2022-04-08 09:53:39,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {1106#true} call ~#Id_MCDC_157~0.base, ~#Id_MCDC_157~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_157~0.base, ~#Id_MCDC_157~0.offset, 1);call write~init~int(0, ~#Id_MCDC_157~0.base, 1 + ~#Id_MCDC_157~0.offset, 1);call write~init~int(0, ~#Id_MCDC_157~0.base, 2 + ~#Id_MCDC_157~0.offset, 1);call write~init~int(0, ~#Id_MCDC_157~0.base, 3 + ~#Id_MCDC_157~0.offset, 1);~Id_MCDC_158~0 := 0;call #t~malloc50.base, #t~malloc50.offset := #Ultimate.allocOnHeap(372);call write~$Pointer$(#t~malloc50.base, #t~malloc50.offset, ~#Id_MCDC_131~0.base, 20 + ~#Id_MCDC_131~0.offset, 8);havoc #t~malloc50.base, #t~malloc50.offset; {1106#true} is VALID [2022-04-08 09:53:39,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {1106#true} call #t~ret51 := Id_MCDC_115(); {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-04-08 09:53:39,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {1124#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} havoc ~Id_MCDC_141~0;havoc ~Id_MCDC_142~0;havoc ~Id_MCDC_143~0;havoc ~Id_MCDC_144~0;havoc ~Id_MCDC_145~0;call ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset, 4);havoc ~Id_MCDC_147~0;call ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset, 4);call ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset := #Ultimate.allocOnStack(4);call write~init~int(0, ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset, 4);~Id_MCDC_35~0 := 0;~Id_MCDC_150~0 := 0;~Id_MCDC_36~0 := 0;~Id_MCDC_151~0 := 0;~Id_MCDC_152~0 := 0;call ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset := #Ultimate.allocOnStack(4);call ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset := #Ultimate.allocOnStack(8);havoc ~Id_MCDC_155~0.base, ~Id_MCDC_155~0.offset;havoc ~Id_MCDC_156~0;~Id_MCDC_141~0 := 6144;~Id_MCDC_150~0 := 0; {1106#true} is VALID [2022-04-08 09:53:39,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {1106#true} assume !(~Id_MCDC_150~0 % 256 < 4); {1106#true} is VALID [2022-04-08 09:53:39,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {1106#true} assume !(~Id_MCDC_141~0 % 4294967296 <= 6147); {1106#true} is VALID [2022-04-08 09:53:39,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {1106#true} #res := 0;call ULTIMATE.dealloc(~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset);havoc ~#Id_MCDC_146~0.base, ~#Id_MCDC_146~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset);havoc ~#Id_MCDC_148~0.base, ~#Id_MCDC_148~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset);havoc ~#Id_MCDC_149~0.base, ~#Id_MCDC_149~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset);havoc ~#Id_MCDC_153~0.base, ~#Id_MCDC_153~0.offset;call ULTIMATE.dealloc(~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset);havoc ~#Id_MCDC_154~0.base, ~#Id_MCDC_154~0.offset; {1106#true} is VALID [2022-04-08 09:53:39,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-08 09:53:39,325 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1106#true} {1106#true} #380#return; {1106#true} is VALID [2022-04-08 09:53:39,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {1106#true} havoc #t~ret51;~Id_MCDC_158~0 := 0; {1106#true} is VALID [2022-04-08 09:53:39,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {1106#true} assume !(~Id_MCDC_158~0 % 4294967296 < 4); {1106#true} is VALID [2022-04-08 09:53:39,325 INFO L272 TraceCheckUtils]: 20: Hoare triple {1106#true} call #t~ret60 := Id_MCDC_113(4, ~#Id_MCDC_157~0.base, ~#Id_MCDC_157~0.offset); {1106#true} is VALID [2022-04-08 09:53:39,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {1106#true} ~Id_MCDC_111 := #in~Id_MCDC_111;~Id_MCDC_112.base, ~Id_MCDC_112.offset := #in~Id_MCDC_112.base, #in~Id_MCDC_112.offset;~Id_MCDC_139~0 := 0;~Id_MCDC_140~0 := 0; {1106#true} is VALID [2022-04-08 09:53:39,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {1106#true} assume !(~Id_MCDC_111 % 4294967296 < 2); {1106#true} is VALID [2022-04-08 09:53:39,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {1106#true} assume !(2 != ~Id_MCDC_111 % 4294967296);call #t~mem19 := read~int(~Id_MCDC_112.base, 1 + ~Id_MCDC_112.offset, 1);~Id_MCDC_140~0 := #t~mem19;havoc #t~mem19; {1106#true} is VALID [2022-04-08 09:53:39,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {1106#true} call #t~mem20 := read~int(~Id_MCDC_112.base, ~Id_MCDC_112.offset, 1); {1106#true} is VALID [2022-04-08 09:53:39,340 INFO L272 TraceCheckUtils]: 25: Hoare triple {1106#true} call #t~ret21 := Id_MCDC_110(#t~mem20, ~Id_MCDC_140~0); {1106#true} is VALID [2022-04-08 09:53:39,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {1106#true} ~Id_MCDC_108 := #in~Id_MCDC_108;~Id_MCDC_109 := #in~Id_MCDC_109;~Id_MCDC_135~0 := 0;~Id_MCDC_136~0 := 0;~Id_MCDC_137~0 := 1;~Id_MCDC_138~0 := 0; {1106#true} is VALID [2022-04-08 09:53:39,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {1106#true} assume ~Id_MCDC_108 % 4294967296 > ~Id_MCDC_109 % 4294967296;~Id_MCDC_135~0 := ~Id_MCDC_108;~Id_MCDC_136~0 := ~Id_MCDC_109; {1106#true} is VALID [2022-04-08 09:53:39,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {1106#true} assume !!(0 != ~Id_MCDC_137~0 % 4294967296); {1106#true} is VALID [2022-04-08 09:53:39,341 INFO L272 TraceCheckUtils]: 29: Hoare triple {1106#true} call avoid_zero((if 0 != ~Id_MCDC_136~0 % 4294967296 then 1 else 0)); {1106#true} is VALID [2022-04-08 09:53:39,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {1106#true} ~y := #in~y; {1106#true} is VALID [2022-04-08 09:53:39,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {1106#true} assume !(0 == ~y); {1106#true} is VALID [2022-04-08 09:53:39,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {1106#true} assume true; {1106#true} is VALID [2022-04-08 09:53:39,341 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1106#true} {1106#true} #374#return; {1106#true} is VALID [2022-04-08 09:53:39,343 INFO L272 TraceCheckUtils]: 34: Hoare triple {1106#true} call __VERIFIER_assert((if (if ~Id_MCDC_135~0 % 4294967296 < 0 && 0 != ~Id_MCDC_135~0 % 4294967296 % (~Id_MCDC_136~0 % 4294967296) then (if ~Id_MCDC_136~0 % 4294967296 < 0 then ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296) - 1 else 1 + ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) else ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) % 4294967296 >= 0 && (if ~Id_MCDC_135~0 % 4294967296 < 0 && 0 != ~Id_MCDC_135~0 % 4294967296 % (~Id_MCDC_136~0 % 4294967296) then (if ~Id_MCDC_136~0 % 4294967296 < 0 then ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296) - 1 else 1 + ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) else ~Id_MCDC_135~0 % 4294967296 / (~Id_MCDC_136~0 % 4294967296)) % 4294967296 <= 4294967295 then 1 else 0)); {1121#(= |__VERIFIER_assert_#in~Id_MCDC_121| 1)} is VALID [2022-04-08 09:53:39,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {1121#(= |__VERIFIER_assert_#in~Id_MCDC_121| 1)} ~Id_MCDC_121 := #in~Id_MCDC_121; {1122#(= __VERIFIER_assert_~Id_MCDC_121 1)} is VALID [2022-04-08 09:53:39,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {1122#(= __VERIFIER_assert_~Id_MCDC_121 1)} assume 0 == ~Id_MCDC_121; {1107#false} is VALID [2022-04-08 09:53:39,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2022-04-08 09:53:39,345 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-08 09:53:39,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:53:39,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634979947] [2022-04-08 09:53:39,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634979947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:39,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:39,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:53:39,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:53:39,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973829397] [2022-04-08 09:53:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973829397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:53:39,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:53:39,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:53:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028278612] [2022-04-08 09:53:39,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:53:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-08 09:53:39,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:53:39,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 09:53:39,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:39,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:53:39,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:53:39,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:53:39,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:53:39,383 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 09:53:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:41,181 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2022-04-08 09:53:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:53:41,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-08 09:53:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:53:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 09:53:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-04-08 09:53:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 09:53:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-04-08 09:53:41,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 164 transitions. [2022-04-08 09:53:41,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:41,466 INFO L225 Difference]: With dead ends: 118 [2022-04-08 09:53:41,466 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:53:41,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:53:41,468 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 233 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 09:53:41,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 123 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 09:53:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:53:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:53:41,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:53:41,470 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-08 09:53:41,470 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-08 09:53:41,470 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-08 09:53:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:41,470 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:53:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:53:41,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:41,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:41,471 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-08 09:53:41,471 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-08 09:53:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:53:41,471 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:53:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:53:41,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:41,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:53:41,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:53:41,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:53:41,471 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-08 09:53:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:53:41,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-08 09:53:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:53:41,472 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:53:41,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 09:53:41,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:53:41,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:53:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:53:41,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:53:41,474 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:53:41,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:53:41,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:53:41,990 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 09:53:41,990 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 09:53:41,990 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 09:53:41,990 INFO L885 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: true [2022-04-08 09:53:41,991 INFO L885 garLoopResultBuilder]: At program point L322-1(line 322) the Hoare annotation is: true [2022-04-08 09:53:41,991 INFO L885 garLoopResultBuilder]: At program point L321-1(line 321) the Hoare annotation is: true [2022-04-08 09:53:41,991 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_113EXIT(lines 305 324) the Hoare annotation is: true [2022-04-08 09:53:41,991 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_113ENTRY(lines 305 324) the Hoare annotation is: true [2022-04-08 09:53:41,991 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_113FINAL(lines 305 324) the Hoare annotation is: true [2022-04-08 09:53:41,991 INFO L885 garLoopResultBuilder]: At program point L315(line 315) the Hoare annotation is: true [2022-04-08 09:53:41,991 INFO L885 garLoopResultBuilder]: At program point L315-1(line 315) the Hoare annotation is: true [2022-04-08 09:53:41,992 INFO L885 garLoopResultBuilder]: At program point L313(lines 313 320) the Hoare annotation is: true [2022-04-08 09:53:41,992 INFO L885 garLoopResultBuilder]: At program point L313-2(lines 313 320) the Hoare annotation is: true [2022-04-08 09:53:41,992 INFO L885 garLoopResultBuilder]: At program point L309(lines 309 312) the Hoare annotation is: true [2022-04-08 09:53:41,992 INFO L885 garLoopResultBuilder]: At program point L322(line 322) the Hoare annotation is: true [2022-04-08 09:53:41,992 INFO L885 garLoopResultBuilder]: At program point L386-1(lines 386 389) the Hoare annotation is: true [2022-04-08 09:53:41,992 INFO L878 garLoopResultBuilder]: At program point Id_MCDC_115ENTRY(lines 356 424) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-04-08 09:53:41,992 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_115FINAL(lines 356 424) the Hoare annotation is: true [2022-04-08 09:53:41,992 INFO L885 garLoopResultBuilder]: At program point L403(line 403) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L403-1(lines 403 406) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L383-2(lines 383 421) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L383-3(lines 383 421) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L396(line 396) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L396-1(lines 396 399) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L413(line 413) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L413-1(line 413) the Hoare annotation is: true [2022-04-08 09:53:41,993 INFO L885 garLoopResultBuilder]: At program point L401-2(lines 401 418) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point L401-3(lines 401 418) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point L401-4(lines 401 418) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_115EXIT(lines 356 424) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point L414(lines 414 417) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point L381(lines 381 422) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point L377-2(lines 377 380) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point L377-3(lines 377 380) the Hoare annotation is: true [2022-04-08 09:53:41,994 INFO L885 garLoopResultBuilder]: At program point L377-4(lines 357 424) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L390-1(lines 390 393) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L386(line 386) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_114EXIT(lines 325 355) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L343(lines 343 348) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L343-1(lines 341 353) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L341(line 341) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L341-2(line 341) the Hoare annotation is: true [2022-04-08 09:53:41,995 INFO L885 garLoopResultBuilder]: At program point L341-3(line 341) the Hoare annotation is: true [2022-04-08 09:53:41,996 INFO L885 garLoopResultBuilder]: At program point L341-5(lines 341 353) the Hoare annotation is: true [2022-04-08 09:53:41,996 INFO L885 garLoopResultBuilder]: At program point L333-1(lines 333 340) the Hoare annotation is: true [2022-04-08 09:53:41,996 INFO L885 garLoopResultBuilder]: At program point L333-3(lines 333 340) the Hoare annotation is: true [2022-04-08 09:53:41,996 INFO L885 garLoopResultBuilder]: At program point L329(lines 329 332) the Hoare annotation is: true [2022-04-08 09:53:41,996 INFO L885 garLoopResultBuilder]: At program point L333-4(lines 333 340) the Hoare annotation is: true [2022-04-08 09:53:41,996 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_114ENTRY(lines 325 355) the Hoare annotation is: true [2022-04-08 09:53:41,996 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_114FINAL(lines 325 355) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point L336(lines 336 339) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point L286(lines 286 294) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_110FINAL(lines 274 304) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_110EXIT(lines 274 304) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point L280(lines 280 294) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_110ENTRY(lines 274 304) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point L298(line 298) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point L297(line 297) the Hoare annotation is: true [2022-04-08 09:53:41,997 INFO L885 garLoopResultBuilder]: At program point L297-1(line 297) the Hoare annotation is: true [2022-04-08 09:53:41,998 INFO L885 garLoopResultBuilder]: At program point L295-1(lines 275 304) the Hoare annotation is: true [2022-04-08 09:53:41,998 INFO L885 garLoopResultBuilder]: At program point L295-2(lines 295 302) the Hoare annotation is: true [2022-04-08 09:53:41,998 INFO L878 garLoopResultBuilder]: At program point L478(lines 478 481) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= |old(#valid)| |#valid|)) [2022-04-08 09:53:41,998 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 452 484) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= |old(#valid)| |#valid|)) [2022-04-08 09:53:41,998 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 452 484) the Hoare annotation is: true [2022-04-08 09:53:41,998 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 452 484) the Hoare annotation is: true [2022-04-08 09:53:41,998 INFO L878 garLoopResultBuilder]: At program point L483(line 483) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= |old(#valid)| |#valid|)) [2022-04-08 09:53:41,999 INFO L878 garLoopResultBuilder]: At program point Id_MCDC_117ENTRY(lines 425 444) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= |old(#valid)| |#valid|)) [2022-04-08 09:53:41,999 INFO L878 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:41,999 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_117FINAL(lines 425 444) the Hoare annotation is: true [2022-04-08 09:53:41,999 INFO L878 garLoopResultBuilder]: At program point L430(line 430) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:41,999 INFO L878 garLoopResultBuilder]: At program point L430-1(line 430) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:41,999 INFO L878 garLoopResultBuilder]: At program point L433(line 433) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:41,999 INFO L878 garLoopResultBuilder]: At program point L433-2(lines 433 440) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:42,000 INFO L878 garLoopResultBuilder]: At program point L431-2(lines 431 441) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:42,000 INFO L878 garLoopResultBuilder]: At program point L431-3(lines 431 441) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:42,000 INFO L878 garLoopResultBuilder]: At program point L431-4(lines 431 441) the Hoare annotation is: (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) [2022-04-08 09:53:42,000 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_117EXIT(lines 425 444) the Hoare annotation is: true [2022-04-08 09:53:42,000 INFO L878 garLoopResultBuilder]: At program point L449(line 449) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= |old(#valid)| |#valid|)) [2022-04-08 09:53:42,000 INFO L878 garLoopResultBuilder]: At program point Id_MCDC_118ENTRY(lines 445 451) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= |old(#valid)| |#valid|)) [2022-04-08 09:53:42,000 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_118FINAL(lines 445 451) the Hoare annotation is: true [2022-04-08 09:53:42,000 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_118EXIT(lines 445 451) the Hoare annotation is: true [2022-04-08 09:53:42,001 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-08 09:53:42,001 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-08 09:53:42,001 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-08 09:53:42,001 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-08 09:53:42,001 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:53:42,001 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~#Id_MCDC_130~0.base)| |~#Id_MCDC_130~0.base|) (= |old(~Id_MCDC_128~0.offset)| ~Id_MCDC_128~0.offset) (= |old(~Id_MCDC_123~0)| ~Id_MCDC_123~0) (= |old(~Id_MCDC_126~0.offset)| ~Id_MCDC_126~0.offset) (= |~#Id_MCDC_130~0.offset| |old(~#Id_MCDC_130~0.offset)|) (= |old(~Id_MCDC_124~0)| ~Id_MCDC_124~0) (= ~Id_MCDC_125~0.base |old(~Id_MCDC_125~0.base)|) (= ~Id_MCDC_128~0.base |old(~Id_MCDC_128~0.base)|) (= |~#Id_MCDC_131~0.base| |old(~#Id_MCDC_131~0.base)|) (= ~Id_MCDC_129~0.offset |old(~Id_MCDC_129~0.offset)|) (= |~#Id_MCDC_131~0.offset| |old(~#Id_MCDC_131~0.offset)|) (= |old(~Id_MCDC_125~0.offset)| ~Id_MCDC_125~0.offset) (= |old(~Id_MCDC_127~0.base)| ~Id_MCDC_127~0.base) (= |old(~Id_MCDC_132~0)| ~Id_MCDC_132~0) (= ~Id_MCDC_127~0.offset |old(~Id_MCDC_127~0.offset)|) (= |old(~Id_MCDC_129~0.base)| ~Id_MCDC_129~0.base) (= |old(~Id_MCDC_126~0.base)| ~Id_MCDC_126~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~Id_MCDC_122~0)| ~Id_MCDC_122~0) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:53:42,001 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:53:42,001 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point avoid_zeroEXIT(lines 9 15) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point L11(lines 11 14) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point L11-2(lines 9 15) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point avoid_zeroENTRY(lines 9 15) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 485 492) the Hoare annotation is: true [2022-04-08 09:53:42,002 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 485 492) the Hoare annotation is: (or (= __VERIFIER_assert_~Id_MCDC_121 1) (not (= |__VERIFIER_assert_#in~Id_MCDC_121| 1))) [2022-04-08 09:53:42,003 INFO L878 garLoopResultBuilder]: At program point L489(line 489) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~Id_MCDC_121| 1)) [2022-04-08 09:53:42,003 INFO L878 garLoopResultBuilder]: At program point L487(lines 487 490) the Hoare annotation is: (or (= __VERIFIER_assert_~Id_MCDC_121 1) (not (= |__VERIFIER_assert_#in~Id_MCDC_121| 1))) [2022-04-08 09:53:42,003 INFO L878 garLoopResultBuilder]: At program point L487-2(lines 485 492) the Hoare annotation is: (or (= __VERIFIER_assert_~Id_MCDC_121 1) (not (= |__VERIFIER_assert_#in~Id_MCDC_121| 1))) [2022-04-08 09:53:42,003 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 489) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~Id_MCDC_121| 1)) [2022-04-08 09:53:42,003 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_107ENTRY(lines 218 273) the Hoare annotation is: true [2022-04-08 09:53:42,003 INFO L885 garLoopResultBuilder]: At program point L254(lines 254 257) the Hoare annotation is: true [2022-04-08 09:53:42,003 INFO L885 garLoopResultBuilder]: At program point L246(line 246) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_107FINAL(lines 218 273) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L242-2(line 242) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L234(lines 234 250) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L259(line 259) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L259-2(line 259) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L259-3(line 259) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L259-5(lines 259 271) the Hoare annotation is: true [2022-04-08 09:53:42,004 INFO L885 garLoopResultBuilder]: At program point L251-1(lines 251 258) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L251-3(lines 251 258) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L251-4(lines 251 258) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L239-2(line 239) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L227(lines 227 233) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L227-2(lines 227 233) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L223(lines 223 226) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: true [2022-04-08 09:53:42,005 INFO L885 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L236-2(line 236) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L261(lines 261 266) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L261-1(lines 259 271) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L245(line 245) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L245-2(line 245) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L237(line 237) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point L229(lines 229 232) the Hoare annotation is: true [2022-04-08 09:53:42,006 INFO L885 garLoopResultBuilder]: At program point Id_MCDC_107EXIT(lines 218 273) the Hoare annotation is: true [2022-04-08 09:53:42,009 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-08 09:53:42,010 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:53:42,013 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:53:42,013 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:53:42,016 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 09:53:42,016 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 09:53:42,016 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 09:53:42,019 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 09:53:42,023 INFO L163 areAnnotationChecker]: CFG has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:53:42,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:53:42 BoogieIcfgContainer [2022-04-08 09:53:42,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:53:42,033 INFO L158 Benchmark]: Toolchain (without parser) took 6865.60ms. Allocated memory was 169.9MB in the beginning and 245.4MB in the end (delta: 75.5MB). Free memory was 120.3MB in the beginning and 185.7MB in the end (delta: -65.4MB). Peak memory consumption was 116.3MB. Max. memory is 8.0GB. [2022-04-08 09:53:42,033 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 169.9MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:53:42,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.45ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 136.9MB in the end (delta: -16.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:53:42,034 INFO L158 Benchmark]: Boogie Preprocessor took 70.09ms. Allocated memory is still 169.9MB. Free memory was 136.9MB in the beginning and 132.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-04-08 09:53:42,035 INFO L158 Benchmark]: RCFGBuilder took 678.39ms. Allocated memory is still 169.9MB. Free memory was 132.3MB in the beginning and 95.3MB in the end (delta: 37.0MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-04-08 09:53:42,035 INFO L158 Benchmark]: TraceAbstraction took 5767.63ms. Allocated memory was 169.9MB in the beginning and 245.4MB in the end (delta: 75.5MB). Free memory was 94.6MB in the beginning and 185.7MB in the end (delta: -91.1MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. [2022-04-08 09:53:42,036 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.15ms. Allocated memory is still 169.9MB. Free memory was 137.5MB in the beginning and 137.4MB in the end (delta: 72.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.45ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 136.9MB in the end (delta: -16.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.09ms. Allocated memory is still 169.9MB. Free memory was 136.9MB in the beginning and 132.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 678.39ms. Allocated memory is still 169.9MB. Free memory was 132.3MB in the beginning and 95.3MB in the end (delta: 37.0MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5767.63ms. Allocated memory was 169.9MB in the beginning and 245.4MB in the end (delta: 75.5MB). Free memory was 94.6MB in the beginning and 185.7MB in the end (delta: -91.1MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 489]: 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 14 procedures, 134 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 251 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 127 LocationsWithAnnotation, 422 PreInvPairs, 533 NumberOfFragments, 353 HoareAnnotationTreeSize, 422 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 127 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 401]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: \old(Id_MCDC_132) == Id_MCDC_132 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 333]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 305]: Procedure Contract for Id_MCDC_113 Derived contract for procedure Id_MCDC_113: 1 - ProcedureContractResult [Line: 356]: Procedure Contract for Id_MCDC_115 Derived contract for procedure Id_MCDC_115: 1 - ProcedureContractResult [Line: 325]: Procedure Contract for Id_MCDC_114 Derived contract for procedure Id_MCDC_114: 1 - ProcedureContractResult [Line: 274]: Procedure Contract for Id_MCDC_110 Derived contract for procedure Id_MCDC_110: 1 - ProcedureContractResult [Line: 452]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for avoid_zero Derived contract for procedure avoid_zero: 1 - ProcedureContractResult [Line: 485]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: Id_MCDC_121 == 1 || !(\old(Id_MCDC_121) == 1) - ProcedureContractResult [Line: 425]: Procedure Contract for Id_MCDC_117 Derived contract for procedure Id_MCDC_117: 1 - ProcedureContractResult [Line: 218]: Procedure Contract for Id_MCDC_107 Derived contract for procedure Id_MCDC_107: 1 - ProcedureContractResult [Line: 445]: Procedure Contract for Id_MCDC_118 Derived contract for procedure Id_MCDC_118: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 09:53:42,075 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...