./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:34:35,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:34:35,090 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:34:35,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:34:35,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:34:35,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:34:35,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:34:35,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:34:35,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:34:35,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:34:35,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:34:35,129 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:34:35,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:34:35,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:34:35,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:34:35,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:34:35,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:34:35,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:34:35,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:34:35,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:34:35,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:34:35,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:34:35,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:34:35,143 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:34:35,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:34:35,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:34:35,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:34:35,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:34:35,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:34:35,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:34:35,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:34:35,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:34:35,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:34:35,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:34:35,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:34:35,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:34:35,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:34:35,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:34:35,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:34:35,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:34:35,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:34:35,157 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:34:35,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:34:35,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:34:35,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:34:35,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:34:35,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:34:35,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:34:35,181 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:34:35,181 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:34:35,182 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:34:35,182 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:34:35,182 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:34:35,182 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:34:35,182 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:34:35,183 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:34:35,183 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:34:35,183 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:34:35,183 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:34:35,183 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:34:35,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:34:35,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:34:35,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:34:35,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:34:35,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:34:35,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:34:35,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:34:35,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:34:35,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:34:35,186 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:34:35,186 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:34:35,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:34:35,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:34:35,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:34:35,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:34:35,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:34:35,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:34:35,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:34:35,189 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:34:35,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:34:35,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:34:35,189 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:34:35,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:34:35,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:34:35,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:34:35,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd [2022-11-26 00:34:35,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:34:35,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:34:35,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:34:35,513 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:34:35,513 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:34:35,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2022-11-26 00:34:38,579 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:34:38,935 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:34:38,936 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2022-11-26 00:34:38,961 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/data/d16450a8a/e51f2ca625c945c2a8fc4c15928a4ecc/FLAG2e395af70 [2022-11-26 00:34:38,983 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/data/d16450a8a/e51f2ca625c945c2a8fc4c15928a4ecc [2022-11-26 00:34:38,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:34:38,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:34:38,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:34:38,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:34:39,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:34:39,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:34:38" (1/1) ... [2022-11-26 00:34:39,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bc6e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39, skipping insertion in model container [2022-11-26 00:34:39,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:34:38" (1/1) ... [2022-11-26 00:34:39,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:34:39,072 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:34:39,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:34:39,565 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:34:39,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:34:39,677 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:34:39,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39 WrapperNode [2022-11-26 00:34:39,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:34:39,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:34:39,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:34:39,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:34:39,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,756 INFO L138 Inliner]: procedures = 164, calls = 70, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 120 [2022-11-26 00:34:39,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:34:39,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:34:39,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:34:39,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:34:39,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,808 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:34:39,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:34:39,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:34:39,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:34:39,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (1/1) ... [2022-11-26 00:34:39,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:34:39,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:39,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:34:39,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:34:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:34:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-26 00:34:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-26 00:34:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-26 00:34:39,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-26 00:34:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-26 00:34:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:34:39,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:34:40,088 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:34:40,091 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:34:40,389 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:34:40,528 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:34:40,535 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:34:40,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:34:40 BoogieIcfgContainer [2022-11-26 00:34:40,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:34:40,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:34:40,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:34:40,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:34:40,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:34:38" (1/3) ... [2022-11-26 00:34:40,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197530c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:34:40, skipping insertion in model container [2022-11-26 00:34:40,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:34:39" (2/3) ... [2022-11-26 00:34:40,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197530c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:34:40, skipping insertion in model container [2022-11-26 00:34:40,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:34:40" (3/3) ... [2022-11-26 00:34:40,558 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2022-11-26 00:34:40,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:34:40,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-26 00:34:40,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:34:40,662 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@38306ed8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:34:40,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-26 00:34:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:34:40,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:40,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:40,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 648377899, now seen corresponding path program 1 times [2022-11-26 00:34:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:40,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331378779] [2022-11-26 00:34:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:41,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:41,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331378779] [2022-11-26 00:34:41,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331378779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:41,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:34:41,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:34:41,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075515594] [2022-11-26 00:34:41,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:41,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:34:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:41,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:34:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:34:41,170 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:41,313 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-26 00:34:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:34:41,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-11-26 00:34:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:41,326 INFO L225 Difference]: With dead ends: 58 [2022-11-26 00:34:41,327 INFO L226 Difference]: Without dead ends: 40 [2022-11-26 00:34:41,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:34:41,337 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:41,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 64 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:34:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-26 00:34:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-26 00:34:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.4) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-26 00:34:41,382 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2022-11-26 00:34:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:41,383 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-26 00:34:41,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:41,383 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-11-26 00:34:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:34:41,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:41,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:41,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:34:41,385 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 321259645, now seen corresponding path program 1 times [2022-11-26 00:34:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811395151] [2022-11-26 00:34:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:41,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811395151] [2022-11-26 00:34:41,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811395151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:41,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:34:41,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:34:41,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708579959] [2022-11-26 00:34:41,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:41,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:34:41,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:41,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:34:41,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:34:41,669 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:41,746 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-11-26 00:34:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:34:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-26 00:34:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:41,748 INFO L225 Difference]: With dead ends: 34 [2022-11-26 00:34:41,748 INFO L226 Difference]: Without dead ends: 26 [2022-11-26 00:34:41,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:34:41,751 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:41,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 85 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:34:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-26 00:34:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-26 00:34:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-26 00:34:41,765 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2022-11-26 00:34:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:41,765 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-26 00:34:41,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-26 00:34:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:34:41,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:41,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:41,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:34:41,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:41,770 INFO L85 PathProgramCache]: Analyzing trace with hash 880791565, now seen corresponding path program 1 times [2022-11-26 00:34:41,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:41,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146546932] [2022-11-26 00:34:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:42,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:42,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146546932] [2022-11-26 00:34:42,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146546932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:42,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:34:42,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:34:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065419360] [2022-11-26 00:34:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:42,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:34:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:34:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:34:42,033 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:42,165 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-11-26 00:34:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:34:42,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-26 00:34:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:42,167 INFO L225 Difference]: With dead ends: 51 [2022-11-26 00:34:42,167 INFO L226 Difference]: Without dead ends: 41 [2022-11-26 00:34:42,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:34:42,169 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:42,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 71 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:34:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-26 00:34:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-11-26 00:34:42,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-26 00:34:42,192 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-11-26 00:34:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:42,193 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-26 00:34:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-26 00:34:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:34:42,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:42,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:42,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:34:42,194 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 332493279, now seen corresponding path program 1 times [2022-11-26 00:34:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:42,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217960493] [2022-11-26 00:34:42,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:42,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:42,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:42,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217960493] [2022-11-26 00:34:42,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217960493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:42,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:34:42,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:34:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317906786] [2022-11-26 00:34:42,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:42,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:34:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:34:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:34:42,330 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:42,383 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-11-26 00:34:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:34:42,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-26 00:34:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:42,385 INFO L225 Difference]: With dead ends: 35 [2022-11-26 00:34:42,385 INFO L226 Difference]: Without dead ends: 26 [2022-11-26 00:34:42,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:34:42,386 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:42,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:34:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-26 00:34:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-26 00:34:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-26 00:34:42,394 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2022-11-26 00:34:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:42,395 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-26 00:34:42,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-11-26 00:34:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:34:42,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:42,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:42,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:34:42,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:42,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1816083574, now seen corresponding path program 1 times [2022-11-26 00:34:42,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:42,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742969788] [2022-11-26 00:34:42,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:42,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:42,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742969788] [2022-11-26 00:34:42,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742969788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:42,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:34:42,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:34:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531628807] [2022-11-26 00:34:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:42,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:34:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:34:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:34:42,548 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:42,626 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-11-26 00:34:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:34:42,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-26 00:34:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:42,628 INFO L225 Difference]: With dead ends: 40 [2022-11-26 00:34:42,628 INFO L226 Difference]: Without dead ends: 26 [2022-11-26 00:34:42,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:34:42,629 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:42,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 30 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:34:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-26 00:34:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-26 00:34:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-11-26 00:34:42,638 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2022-11-26 00:34:42,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:42,638 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-11-26 00:34:42,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:34:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-11-26 00:34:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:34:42,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:42,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:42,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:34:42,640 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1158426386, now seen corresponding path program 1 times [2022-11-26 00:34:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:42,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385601570] [2022-11-26 00:34:42,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:42,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:42,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:42,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:42,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385601570] [2022-11-26 00:34:42,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385601570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:42,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:34:42,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:34:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148269960] [2022-11-26 00:34:42,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:42,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:34:42,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:42,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:34:42,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:34:42,757 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:42,787 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-11-26 00:34:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:34:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-11-26 00:34:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:42,789 INFO L225 Difference]: With dead ends: 46 [2022-11-26 00:34:42,789 INFO L226 Difference]: Without dead ends: 27 [2022-11-26 00:34:42,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:34:42,790 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:42,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:34:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-26 00:34:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-26 00:34:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-11-26 00:34:42,799 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2022-11-26 00:34:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:42,799 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-26 00:34:42,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-11-26 00:34:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:34:42,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:42,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:42,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:34:42,801 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:42,802 INFO L85 PathProgramCache]: Analyzing trace with hash 549943109, now seen corresponding path program 1 times [2022-11-26 00:34:42,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:42,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404776783] [2022-11-26 00:34:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:42,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:42,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404776783] [2022-11-26 00:34:42,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404776783] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:42,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206363289] [2022-11-26 00:34:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:42,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:42,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:42,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:42,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:34:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:43,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-26 00:34:43,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:43,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:34:43,416 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_83 Int) (v_ArrVal_84 Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_84) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_83)) |c_#memory_int|))) is different from true [2022-11-26 00:34:43,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:43,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:43,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-26 00:34:43,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:34:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:34:43,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:34:43,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206363289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:43,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:34:43,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-26 00:34:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441847965] [2022-11-26 00:34:43,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:43,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:34:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:43,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:34:43,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-26 00:34:43,591 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:43,845 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-11-26 00:34:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:34:43,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-11-26 00:34:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:43,846 INFO L225 Difference]: With dead ends: 33 [2022-11-26 00:34:43,847 INFO L226 Difference]: Without dead ends: 32 [2022-11-26 00:34:43,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=349, Unknown=1, NotChecked=38, Total=462 [2022-11-26 00:34:43,848 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:43,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-26 00:34:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-26 00:34:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-11-26 00:34:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-11-26 00:34:43,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2022-11-26 00:34:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:43,857 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-11-26 00:34:43,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-11-26 00:34:43,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:34:43,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:43,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:43,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:34:44,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:44,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash -131632725, now seen corresponding path program 1 times [2022-11-26 00:34:44,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:44,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105019044] [2022-11-26 00:34:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:44,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:44,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105019044] [2022-11-26 00:34:44,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105019044] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:44,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132740182] [2022-11-26 00:34:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:44,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:44,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:44,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:44,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:34:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:44,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-26 00:34:44,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:44,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 00:34:44,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:34:44,584 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_137 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_140 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_137) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_140))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-26 00:34:44,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:44,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:44,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-26 00:34:44,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:34:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:34:44,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:34:44,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132740182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:44,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:34:44,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-26 00:34:44,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896203667] [2022-11-26 00:34:44,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:44,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:34:44,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:34:44,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-26 00:34:44,713 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:44,972 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-11-26 00:34:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:34:44,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-11-26 00:34:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:44,975 INFO L225 Difference]: With dead ends: 32 [2022-11-26 00:34:44,975 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 00:34:44,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=349, Unknown=1, NotChecked=38, Total=462 [2022-11-26 00:34:44,976 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:44,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 56 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-11-26 00:34:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 00:34:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-11-26 00:34:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-26 00:34:44,984 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-11-26 00:34:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:44,984 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-26 00:34:44,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-26 00:34:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:34:44,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:44,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:45,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:45,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-26 00:34:45,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:45,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash 214706967, now seen corresponding path program 1 times [2022-11-26 00:34:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:45,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346303997] [2022-11-26 00:34:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:34:45,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:45,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346303997] [2022-11-26 00:34:45,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346303997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:34:45,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:34:45,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:34:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463629838] [2022-11-26 00:34:45,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:34:45,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:34:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:45,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:34:45,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:34:45,313 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:34:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:45,373 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-11-26 00:34:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:34:45,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-26 00:34:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:45,375 INFO L225 Difference]: With dead ends: 31 [2022-11-26 00:34:45,375 INFO L226 Difference]: Without dead ends: 25 [2022-11-26 00:34:45,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:34:45,376 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:45,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:34:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-26 00:34:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-26 00:34:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-26 00:34:45,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2022-11-26 00:34:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:45,385 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-26 00:34:45,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:34:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-26 00:34:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:34:45,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:45,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:45,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:34:45,386 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash -163358720, now seen corresponding path program 1 times [2022-11-26 00:34:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:45,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099890661] [2022-11-26 00:34:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:45,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:45,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099890661] [2022-11-26 00:34:45,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099890661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:45,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566647984] [2022-11-26 00:34:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:45,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:45,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:45,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:45,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:34:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:45,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 129 conjunts are in the unsatisfiable core [2022-11-26 00:34:45,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:45,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:34:45,915 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_232 Int) (v_ArrVal_231 Int) (LDV_INIT_LIST_HEAD_~list.offset Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_232) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_231))))) is different from true [2022-11-26 00:34:45,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:45,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:45,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-26 00:34:46,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:34:46,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:46,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-11-26 00:34:46,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:34:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:46,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:46,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566647984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:46,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [88023578] [2022-11-26 00:34:46,712 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-26 00:34:46,713 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:34:46,717 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:34:46,725 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:34:46,725 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:34:46,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 00:34:46,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:34:46,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 00:34:46,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:34:46,978 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-26 00:34:46,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 132 [2022-11-26 00:34:46,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:34:47,007 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:34:47,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2022-11-26 00:34:47,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:34:47,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 00:34:47,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 00:34:47,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:34:47,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:47,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:47,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:47,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:34:47,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:47,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:34:47,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:47,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:34:47,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 00:34:47,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 00:34:47,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:47,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:47,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-26 00:34:47,988 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-26 00:34:48,001 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-26 00:34:48,030 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:34:54,062 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1220#(and (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 0 |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base|) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| 12) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_get_#res#1.offset|) (= |ULTIMATE.start_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.base| |ULTIMATE.start_ldv_kref_get_~kref#1.base|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (not (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| 0)) (= |ULTIMATE.start_ldv_kref_get_#in~kref#1.offset| (+ |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 12)) (<= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| 12) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~kref#1.offset| |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_atomic_sub_return_~i#1| |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_put_#in~release#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset| 0) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (= (+ |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| 12) |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (<= 12 |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (<= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (<= 0 |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset|) (= |#funAddr~ldv_kobject_release.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset| |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_ldv_atomic_add_return_#res#1|)) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| |ULTIMATE.start_ldv_kref_sub_~count#1|) (= |ULTIMATE.start_ldv_kref_get_#in~kref#1.base| |ULTIMATE.start_ldv_kref_get_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kref_put_#in~kref#1.base|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_kref_get_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset| |ULTIMATE.start_ldv_kref_sub_~release#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.base|) (<= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| 0) (= |ULTIMATE.start_ldv_kref_sub_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (= |~#ldv_global_msg_list~0.base| 1) (<= 12 |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1|) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| |ULTIMATE.start_ldv_kref_get_#in~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| 1) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |#NULL.offset| 0) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| |ULTIMATE.start_ldv_atomic_add_return_#res#1|) (<= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset| 0) (<= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| 0) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| 1) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_put_~kref#1.offset|) (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_get_#res#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (not (<= |ULTIMATE.start_ldv_atomic_sub_return_~i#1| (+ |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| 2147483648))) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (= |ULTIMATE.start_ldv_kref_put_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (= (ite (<= (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296) 2147483647) (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296) (+ (- 4294967296) (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296))) |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset|))' at error location [2022-11-26 00:34:54,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:34:54,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:34:54,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17] total 20 [2022-11-26 00:34:54,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145354445] [2022-11-26 00:34:54,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 00:34:54,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 00:34:54,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:34:54,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 00:34:54,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1949, Unknown=1, NotChecked=90, Total=2256 [2022-11-26 00:34:54,065 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 20 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-26 00:34:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:34:54,827 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-11-26 00:34:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 00:34:54,828 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2022-11-26 00:34:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:34:54,828 INFO L225 Difference]: With dead ends: 42 [2022-11-26 00:34:54,829 INFO L226 Difference]: Without dead ends: 25 [2022-11-26 00:34:54,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=338, Invalid=2971, Unknown=1, NotChecked=112, Total=3422 [2022-11-26 00:34:54,831 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 39 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:34:54,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 32 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 260 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2022-11-26 00:34:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-26 00:34:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-26 00:34:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:34:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-26 00:34:54,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2022-11-26 00:34:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:34:54,838 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-26 00:34:54,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-26 00:34:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-26 00:34:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:34:54,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:34:54,840 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:34:54,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:34:55,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 00:34:55,046 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-26 00:34:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:34:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2801236, now seen corresponding path program 1 times [2022-11-26 00:34:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:34:55,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570914033] [2022-11-26 00:34:55,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:55,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:34:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:55,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:34:55,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570914033] [2022-11-26 00:34:55,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570914033] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:55,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386542898] [2022-11-26 00:34:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:34:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:34:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:34:55,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:34:55,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:34:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:34:55,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 138 conjunts are in the unsatisfiable core [2022-11-26 00:34:55,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:55,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:34:55,553 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_322 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_319 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_319) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_322)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-26 00:34:55,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:55,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:55,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-26 00:34:55,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:34:55,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:34:55,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-11-26 00:34:55,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:34:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:55,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:34:58,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386542898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:34:58,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1741794897] [2022-11-26 00:34:58,244 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-26 00:34:58,244 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:34:58,244 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:34:58,245 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:34:58,245 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:34:58,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-26 00:34:58,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-26 00:34:58,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:34:58,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:34:58,401 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:34:58,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 131 [2022-11-26 00:34:58,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:34:58,425 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-26 00:34:58,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 121 [2022-11-26 00:34:58,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:34:58,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 00:34:58,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 00:34:58,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 00:34:58,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-26 00:34:58,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-26 00:34:58,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:58,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:58,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:34:58,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:58,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:34:58,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:58,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-26 00:34:58,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:34:58,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-26 00:34:58,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 00:34:59,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-26 00:34:59,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:59,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:34:59,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2022-11-26 00:34:59,398 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-26 00:34:59,410 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-26 00:34:59,432 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:35:05,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1741794897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:35:05,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:35:05,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [5, 18] total 42 [2022-11-26 00:35:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695358101] [2022-11-26 00:35:05,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:35:05,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 00:35:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:35:05,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 00:35:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2118, Unknown=2, NotChecked=94, Total=2450 [2022-11-26 00:35:05,523 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:35:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:35:10,332 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-11-26 00:35:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:35:10,333 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-26 00:35:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:35:10,333 INFO L225 Difference]: With dead ends: 25 [2022-11-26 00:35:10,334 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:35:10,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=418, Invalid=3006, Unknown=2, NotChecked=114, Total=3540 [2022-11-26 00:35:10,336 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:35:10,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:35:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:35:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:35:10,337 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-11-26 00:35:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:35:10,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-11-26 00:35:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:35:10,338 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:35:10,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:35:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:35:10,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:35:10,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-26 00:35:10,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-26 00:35:10,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-26 00:35:10,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-26 00:35:10,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-26 00:35:10,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:35:10,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:35:14,129 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (let ((.cse1 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse0 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|)) (.cse2 (+ |~#ldv_global_msg_list~0.offset| 4))) (or (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |~#ldv_global_msg_list~0.offset| 0)) (not (= |ldv_malloc_#in~size| 16)) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#length)| 1) 8)) (not (= |#NULL.base| 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= (select .cse0 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|)) (not (= |~#ldv_global_msg_list~0.base| (select .cse1 .cse2))) (not (= (select |old(#valid)| 0) 0)) (not (= |~#ldv_global_msg_list~0.base| (select .cse1 |~#ldv_global_msg_list~0.offset|))) (not (= |~#ldv_global_msg_list~0.offset| (select .cse0 .cse2))) (not (= |~#ldv_global_msg_list~0.base| 1)))) [2022-11-26 00:35:14,129 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-26 00:35:14,129 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-26 00:35:14,130 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-26 00:35:14,130 INFO L895 garLoopResultBuilder]: At program point L667-1(line 667) the Hoare annotation is: (and (= |ULTIMATE.start_#Ultimate.C_memset_#res#1.base| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base|) (<= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| 12) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_get_#res#1.offset|) (= |ULTIMATE.start_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (<= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| 12) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~kref#1.offset| |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_atomic_sub_return_~i#1| |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_put_#in~release#1.offset|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (= (+ |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| 12) |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (<= 12 |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1| 4294967296)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (= |#funAddr~ldv_kobject_release.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset| |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| |ULTIMATE.start_ldv_kref_sub_~count#1|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_get_#in~kref#1.base| |ULTIMATE.start_ldv_kref_get_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|)) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kref_put_#in~kref#1.base|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_kref_get_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset| |ULTIMATE.start_ldv_kref_sub_~release#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.base|) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (<= |ULTIMATE.start_ldv_atomic_add_return_#res#1| 2147483647) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.offset|) (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (= |~#ldv_global_msg_list~0.base| 1) (<= 12 |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1|) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| |ULTIMATE.start_ldv_kref_get_#in~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| 1) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |#NULL.offset| 0) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| |ULTIMATE.start_ldv_atomic_add_return_#res#1|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| 1) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_put_~kref#1.offset|) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_get_#res#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (<= 2 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|) 12)) (= |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (= |ULTIMATE.start_ldv_kref_put_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (= (let ((.cse0 (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset|)) [2022-11-26 00:35:14,131 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-26 00:35:14,131 INFO L895 garLoopResultBuilder]: At program point L659-1(line 659) the Hoare annotation is: (and (= |ULTIMATE.start_#Ultimate.C_memset_#res#1.base| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) 1) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1| 4294967296)) (= |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset| |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_get_#in~kref#1.base| |ULTIMATE.start_ldv_kref_get_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|)) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_kref_get_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.base|) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.offset|) (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| |ULTIMATE.start_ldv_kref_get_#in~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| 1) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |#NULL.offset| 0) (= (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| 0) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset|)) [2022-11-26 00:35:14,131 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-26 00:35:14,132 INFO L895 garLoopResultBuilder]: At program point L717-2(lines 717 718) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse1 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse4 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (.cse5 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (.cse6 (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0)) (.cse7 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) 12))) (.cse9 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) (.cse10 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|)) (.cse11 (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0)))) (.cse2 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse12 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0)) (.cse13 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (let ((.cse8 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (and (= |ULTIMATE.start_#Ultimate.C_memset_#res#1.base| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse0 (<= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| 12) .cse1 .cse2 (<= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| 12) .cse3 (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) .cse4 (<= 12 |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1| 4294967296)) (= |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset| |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) .cse5 .cse6 (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_get_#in~kref#1.base| |ULTIMATE.start_ldv_kref_get_~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|)) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_kref_get_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.base|) .cse7 (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (<= 2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse8)) (<= |ULTIMATE.start_ldv_atomic_add_return_#res#1| 2147483647) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.offset|) (= .cse8 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) .cse9 (= |~#ldv_global_msg_list~0.base| 1) (<= 12 |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| |ULTIMATE.start_ldv_kref_get_#in~kref#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_#in~i#1| 1) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |#NULL.offset| 0) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| |ULTIMATE.start_ldv_atomic_add_return_#res#1|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) .cse10 (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) .cse11 (= |#NULL.base| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse13 .cse9 .cse10 .cse11) (and .cse2 .cse12 .cse13 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)))) [2022-11-26 00:35:14,132 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (or (and (not (< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (= |ULTIMATE.start_#Ultimate.C_memset_#res#1.base| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) 1) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |#NULL.offset| 0) (= (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| 0) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) [2022-11-26 00:35:14,133 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-26 00:35:14,133 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 714) no Hoare annotation was computed. [2022-11-26 00:35:14,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-26 00:35:14,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:35:14,133 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-26 00:35:14,134 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-26 00:35:14,134 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (and (= |ULTIMATE.start_#Ultimate.C_memset_#res#1.base| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) 1) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1| 4294967296)) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |#NULL.offset| 0) (= (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-26 00:35:14,134 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (and (= |ULTIMATE.start_#Ultimate.C_memset_#res#1.base| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) 1) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1| 4294967296)) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |#NULL.offset| 0) (= (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-26 00:35:14,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-26 00:35:14,135 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:35:14,135 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (and (= |ULTIMATE.start_#Ultimate.C_memset_#res#1.base| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base|) (= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kref_init_~kref#1.base|) |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) 1) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr40#1| 4294967296)) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (= |~#ldv_global_msg_list~0.base| 1) (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |#NULL.offset| 0) (= (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_init_#in~kref#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-26 00:35:14,135 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-26 00:35:14,135 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-26 00:35:14,136 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-26 00:35:14,136 INFO L895 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| |~#ldv_global_msg_list~0.base|)) (.cse1 (+ |~#ldv_global_msg_list~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.offset| |~#ldv_global_msg_list~0.base|))) (and (= |~#ldv_global_msg_list~0.base| (select .cse0 |~#ldv_global_msg_list~0.offset|)) (= (select |#length| 1) 8) (= |~#ldv_global_msg_list~0.base| (select .cse0 .cse1)) (= |~#ldv_global_msg_list~0.offset| 0) (= |~#ldv_global_msg_list~0.offset| (select .cse2 .cse1)) (= (select |#valid| 1) 1) (= |~#ldv_global_msg_list~0.base| 1) (= (select |#valid| 0) 0) (= |#NULL.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= (select .cse2 |~#ldv_global_msg_list~0.offset|) |~#ldv_global_msg_list~0.offset|))) [2022-11-26 00:35:14,136 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-26 00:35:14,136 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |#NULL.offset| 0)) (not (= (select (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 8)) 1)) (not (= |LDV_INIT_LIST_HEAD_#in~list.offset| 4)) (not (= |~#ldv_global_msg_list~0.offset| 0)) (= |LDV_INIT_LIST_HEAD_#in~list.base| 0) (not (= |#NULL.base| 0)) (not (<= 0 |#StackHeapBarrier|)) (not (= |~#ldv_global_msg_list~0.base| 1))) [2022-11-26 00:35:14,136 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-26 00:35:14,140 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:35:14,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:35:14,150 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,151 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,152 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,152 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,152 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,153 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,158 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,159 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,159 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,159 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,160 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,160 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,162 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,163 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,163 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,164 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,164 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,165 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,165 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,166 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,166 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,166 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,168 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,168 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,168 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,169 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,169 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,169 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,171 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,172 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,172 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,173 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,173 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,174 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,176 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,176 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,177 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,177 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,177 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,178 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,180 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,180 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,181 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,181 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,181 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,181 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,183 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,183 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,183 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,184 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,184 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,184 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,186 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,187 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,187 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,188 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,188 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,188 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,191 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,192 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,193 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,194 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,197 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,198 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-26 00:35:14,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-26 00:35:14,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,200 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,201 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,204 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,205 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-26 00:35:14,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-26 00:35:14,206 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,207 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,207 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,208 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:35:14 BoogieIcfgContainer [2022-11-26 00:35:14,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:35:14,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:35:14,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:35:14,212 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:35:14,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:34:40" (3/4) ... [2022-11-26 00:35:14,216 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:35:14,232 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-26 00:35:14,233 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-26 00:35:14,237 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2022-11-26 00:35:14,241 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-26 00:35:14,241 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:35:14,271 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(aux-#t~loopctr40-aux % 4294967296 < unknown-#amount-unknown % 4294967296) && #Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1) && kref == kref) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && unknown-#memory_int-unknown[kref][kref] == 1) && kobj == kobj) && kobj == kobj) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kobj == kobj) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && ldv_global_msg_list == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && 12 + kobj == kref) && kref == kobj) && kobj <= 0) && kobj == kobj) && \result == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && 0 <= kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (0 == \result && \result == 0) [2022-11-26 00:35:14,272 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && \result == kobj) && 0 == kobj) && kref <= 12) && kobj == kobj) && 0 == \result) && kref <= 12) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 12 <= kref) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && v == v) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && \old(i) == i) && kobj == kobj) && kref == kref) && temp == unknown-#memory_int-unknown[v][v]) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && v == v) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == kobj) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && \result <= 2147483647) && kobj == kobj) && kobj + 12 == v) && !(kobj == 0)) && ldv_global_msg_list == 1) && 12 <= kref) && kobj == kref) && \old(i) == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && kobj == \result) && temp == \result) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && (!(kobj == 0) || !(kobj == 0))) && #NULL == 0) && kref == v) || ((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && kobj == 0) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == 0) && !(kobj == 0)) && kobj == kobj) && (!(kobj == 0) || !(kobj == 0)))) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) [2022-11-26 00:35:14,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && \result == kobj) && kref == kref) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && unknown-#memory_int-unknown[kref][kref] == 1) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && v == v) && kobj == 0) && \old(i) == i) && !(kobj == 0)) && kobj == kobj) && kref == kref) && temp == unknown-#memory_int-unknown[v][v]) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kref == kref) && v == v) && kobj == kobj) && unknown-#value-unknown == 0) && kobj == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && kobj == kobj) && kobj + 12 == v) && ldv_global_msg_list == 1) && kobj == kref) && \old(i) == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && 12 + kobj == kref) && kobj == \result) && kref == kobj) && kobj <= 0) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && kobj == kobj) && 0 <= kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && kref == v [2022-11-26 00:35:14,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && \result == kobj) && kref == v) && kref == v) && kref <= 12) && kobj == kobj) && kobj == \result) && release == #funAddr~ldv_kobject_release.offset) && 0 == \result) && release == release) && kref <= 12) && kobj == kobj) && release == release) && kref == kref) && i == \old(i)) && v == v) && release == release) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && kobj + 12 == kref) && 0 <= aux-#t~loopctr40-aux) && 12 <= kref) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && kobj == kobj) && #funAddr~ldv_kobject_release.base == release) && v == v) && kobj == 0) && \old(i) == i) && \old(count) == count) && kobj == kobj) && kref == kref) && temp == unknown-#memory_int-unknown[v][v]) && kobj == kref) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kref == kref) && release == release) && v == v) && kobj == kobj) && release == release) && unknown-#value-unknown == 0) && kobj == kobj) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && \result <= 2147483647) && kobj == kobj) && kobj == kobj) && kobj + 12 == v) && !(kobj == 0)) && kref == kref) && ldv_global_msg_list == 1) && 12 <= kref) && unknown-#memory_int-unknown[v][v] == temp) && kobj == kref) && \old(i) == 1) && kobj == kobj) && kobj == kobj) && kref == kref) && #NULL == 0) && kobj == \result) && temp == \result) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && kobj == kobj) && \old(count) == 1) && kref == kref) && kobj == kobj) && \result == kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && release == release) && 2 <= unknown-#memory_int-unknown[kobj][12]) && v == v) && kref == kref) && (if count % 4294967296 <= 2147483647 then count % 4294967296 else -4294967296 + count % 4294967296) == \old(i)) && #NULL == 0) && kref == v [2022-11-26 00:35:14,293 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:35:14,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:35:14,294 INFO L158 Benchmark]: Toolchain (without parser) took 35301.35ms. Allocated memory was 138.4MB in the beginning and 268.4MB in the end (delta: 130.0MB). Free memory was 105.4MB in the beginning and 232.7MB in the end (delta: -127.3MB). Peak memory consumption was 158.9MB. Max. memory is 16.1GB. [2022-11-26 00:35:14,294 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:35:14,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.24ms. Allocated memory is still 138.4MB. Free memory was 105.4MB in the beginning and 84.0MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-26 00:35:14,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.90ms. Allocated memory is still 138.4MB. Free memory was 84.0MB in the beginning and 81.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:35:14,295 INFO L158 Benchmark]: Boogie Preprocessor took 61.17ms. Allocated memory is still 138.4MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:35:14,296 INFO L158 Benchmark]: RCFGBuilder took 717.73ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 79.4MB in the beginning and 151.1MB in the end (delta: -71.7MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2022-11-26 00:35:14,296 INFO L158 Benchmark]: TraceAbstraction took 33667.35ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 151.1MB in the beginning and 79.8MB in the end (delta: 71.3MB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. [2022-11-26 00:35:14,296 INFO L158 Benchmark]: Witness Printer took 81.64ms. Allocated memory is still 268.4MB. Free memory was 79.8MB in the beginning and 232.7MB in the end (delta: -153.0MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2022-11-26 00:35:14,298 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.24ms. Allocated memory is still 138.4MB. Free memory was 105.4MB in the beginning and 84.0MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.90ms. Allocated memory is still 138.4MB. Free memory was 84.0MB in the beginning and 81.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.17ms. Allocated memory is still 138.4MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 717.73ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 79.4MB in the beginning and 151.1MB in the end (delta: -71.7MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * TraceAbstraction took 33667.35ms. Allocated memory was 184.5MB in the beginning and 268.4MB in the end (delta: 83.9MB). Free memory was 151.1MB in the beginning and 79.8MB in the end (delta: 71.3MB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. * Witness Printer took 81.64ms. Allocated memory is still 268.4MB. Free memory was 79.8MB in the beginning and 232.7MB in the end (delta: -153.0MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * 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: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 326 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 76 IncrementalHoareTripleChecker+Unchecked, 377 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 996 IncrementalHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 159 mSDtfsCounter, 996 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1612 ImplicationChecksByTransitivity, 20.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=3, InterpolantAutomatonStates: 102, 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, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 13 PreInvPairs, 25 NumberOfFragments, 1342 HoareAnnotationTreeSize, 13 FomulaSimplifications, 192 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1946 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 248 ConstructedInterpolants, 4 QuantifiedInterpolants, 1160 SizeOfPredicates, 194 NumberOfNonLiveVariables, 955 ConjunctsInSsa, 433 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 1.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 22, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 23, TOOLS_POST_TIME: 0.6s, TOOLS_POST_CALL_APPLICATIONS: 6, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 33, TOOLS_QUANTIFIERELIM_TIME: 1.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 66, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 22, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 298, DAG_COMPRESSION_RETAINED_NODES: 62, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 738]: Loop Invariant [2022-11-26 00:35:14,315 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,315 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,316 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,316 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,316 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,316 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,317 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,318 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,318 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,318 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,318 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,319 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled Derived loop invariant: (((((((((((((((((((((((((((((!(aux-#t~loopctr40-aux % 4294967296 < unknown-#amount-unknown % 4294967296) && #Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1) && kref == kref) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && unknown-#memory_int-unknown[kref][kref] == 1) && kobj == kobj) && kobj == kobj) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kobj == kobj) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && ldv_global_msg_list == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && 12 + kobj == kref) && kref == kobj) && kobj <= 0) && kobj == kobj) && \result == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && 0 <= kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (0 == \result && \result == 0) - InvariantResult [Line: -1]: Loop Invariant [2022-11-26 00:35:14,320 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,320 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,320 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,320 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled Derived loop invariant: ((((((((((0 == kobj && !(kobj == 0)) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && 0 <= #Ultimate.C_memset_#ptr#1) && #Ultimate.C_memset_#ptr#1 <= 0) && unknown-#value-unknown == 0) && ldv_global_msg_list == 1) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 728]: Loop Invariant [2022-11-26 00:35:14,321 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,321 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled Derived loop invariant: ((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && 0 == kobj) && kref == kref) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && unknown-#memory_int-unknown[kref][kref] == 1) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && 0 <= #Ultimate.C_memset_#ptr#1) && kobj == kobj) && !(kobj == 0)) && kobj == kobj) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kobj == kobj) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && ldv_global_msg_list == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && 12 + kobj == kref) && kref == kobj) && kobj == kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 659]: Loop Invariant [2022-11-26 00:35:14,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,327 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && \result == kobj) && kref == kref) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && unknown-#memory_int-unknown[kref][kref] == 1) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && v == v) && kobj == 0) && \old(i) == i) && !(kobj == 0)) && kobj == kobj) && kref == kref) && temp == unknown-#memory_int-unknown[v][v]) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kref == kref) && v == v) && kobj == kobj) && unknown-#value-unknown == 0) && kobj == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && kobj == kobj) && kobj + 12 == v) && ldv_global_msg_list == 1) && kobj == kref) && \old(i) == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && 12 + kobj == kref) && kobj == \result) && kref == kobj) && kobj <= 0) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && kobj == kobj) && 0 <= kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) && kref == v - InvariantResult [Line: 721]: Loop Invariant [2022-11-26 00:35:14,330 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,331 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,331 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,331 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,331 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,332 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,332 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,333 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,333 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,333 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,333 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,333 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled Derived loop invariant: ((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && 0 == kobj) && kref == kref) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && unknown-#memory_int-unknown[kref][kref] == 1) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && 0 <= #Ultimate.C_memset_#ptr#1) && kobj == kobj) && !(kobj == 0)) && kobj == kobj) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kobj == kobj) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && ldv_global_msg_list == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && 12 + kobj == kref) && kref == kobj) && kobj == kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 717]: Loop Invariant [2022-11-26 00:35:14,334 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,335 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,335 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,335 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,336 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,336 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,337 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,338 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,338 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,339 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,339 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,339 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && \result == kobj) && 0 == kobj) && kref <= 12) && kobj == kobj) && 0 == \result) && kref <= 12) && kobj == kobj) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && 0 <= aux-#t~loopctr40-aux) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 12 <= kref) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && v == v) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && \old(i) == i) && kobj == kobj) && kref == kref) && temp == unknown-#memory_int-unknown[v][v]) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && v == v) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == kobj) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && \result <= 2147483647) && kobj == kobj) && kobj + 12 == v) && !(kobj == 0)) && ldv_global_msg_list == 1) && 12 <= kref) && kobj == kref) && \old(i) == 1) && kobj == kobj) && kobj == kobj) && #NULL == 0) && kobj == \result) && temp == \result) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && (!(kobj == 0) || !(kobj == 0))) && #NULL == 0) && kref == v) || ((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && kobj == 0) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == 0) && !(kobj == 0)) && kobj == kobj) && (!(kobj == 0) || !(kobj == 0)))) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) - InvariantResult [Line: 667]: Loop Invariant [2022-11-26 00:35:14,341 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,341 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-26 00:35:14,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-26 00:35:14,343 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,343 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,343 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,344 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,345 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,346 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-26 00:35:14,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-26 00:35:14,347 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,347 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-26 00:35:14,348 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-26 00:35:14,348 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((#Ultimate.C_memset_#res#1 == #Ultimate.C_memset_#ptr#1 && \result == kobj) && kref == v) && kref == v) && kref <= 12) && kobj == kobj) && kobj == \result) && release == #funAddr~ldv_kobject_release.offset) && 0 == \result) && release == release) && kref <= 12) && kobj == kobj) && release == release) && kref == kref) && i == \old(i)) && v == v) && release == release) && ldv_global_msg_list == 0) && unknown-#amount-unknown == 16) && kobj + 12 == kref) && 0 <= aux-#t~loopctr40-aux) && 12 <= kref) && unknown-#amount-unknown % 4294967296 <= aux-#t~loopctr40-aux % 4294967296) && kobj == kobj) && #funAddr~ldv_kobject_release.base == release) && v == v) && kobj == 0) && \old(i) == i) && \old(count) == count) && kobj == kobj) && kref == kref) && temp == unknown-#memory_int-unknown[v][v]) && kobj == kref) && #Ultimate.C_memset_#ptr#1 <= 0) && kref == kref) && kref == kref) && release == release) && v == v) && kobj == kobj) && release == release) && unknown-#value-unknown == 0) && kobj == kobj) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && \result <= 2147483647) && kobj == kobj) && kobj == kobj) && kobj + 12 == v) && !(kobj == 0)) && kref == kref) && ldv_global_msg_list == 1) && 12 <= kref) && unknown-#memory_int-unknown[v][v] == temp) && kobj == kref) && \old(i) == 1) && kobj == kobj) && kobj == kobj) && kref == kref) && #NULL == 0) && kobj == \result) && temp == \result) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && kobj == kobj) && \old(count) == 1) && kref == kref) && kobj == kobj) && \result == kobj) && kobj == kobj) && 0 <= unknown-#StackHeapBarrier-unknown) && release == release) && 2 <= unknown-#memory_int-unknown[kobj][12]) && v == v) && kref == kref) && (if count % 4294967296 <= 2147483647 then count % 4294967296 else -4294967296 + count % 4294967296) == \old(i)) && #NULL == 0) && kref == v RESULT: Ultimate proved your program to be correct! [2022-11-26 00:35:14,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_090b8442-46d2-4643-abd5-24cc34ba899a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE