./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 b5237d83 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_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/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_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 02:31:46,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:31:46,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:31:46,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:31:46,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:31:46,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:31:46,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:31:46,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:31:46,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:31:46,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:31:46,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:31:46,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:31:46,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:31:46,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:31:46,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:31:46,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:31:46,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:31:46,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:31:46,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:31:46,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:31:46,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:31:46,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:31:46,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:31:46,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:31:46,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:31:46,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:31:46,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:31:46,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:31:46,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:31:46,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:31:46,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:31:46,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:31:46,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:31:46,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:31:46,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:31:46,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:31:46,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:31:46,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:31:46,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:31:46,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:31:46,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:31:46,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 02:31:46,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:31:46,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:31:46,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:31:46,534 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:31:46,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:31:46,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:31:46,535 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:31:46,535 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:31:46,536 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:31:46,536 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:31:46,537 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:31:46,537 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:31:46,538 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:31:46,538 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:31:46,538 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:31:46,538 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:31:46,539 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:31:46,539 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:31:46,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:31:46,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:31:46,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:31:46,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:31:46,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:31:46,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:31:46,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:31:46,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:31:46,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:31:46,542 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 02:31:46,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:31:46,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:31:46,543 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:31:46,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:31:46,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:31:46,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:31:46,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:31:46,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:31:46,545 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:31:46,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:31:46,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:31:46,546 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:31:46,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:31:46,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:31:46,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:31:46,547 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_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/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_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba 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-22 02:31:46,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:31:46,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:31:46,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:31:46,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:31:46,870 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:31:46,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2022-11-22 02:31:49,985 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:31:50,335 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:31:50,336 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2022-11-22 02:31:50,351 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/data/8a83b5ee8/40131bda2cc547f9a5760f0ab760b158/FLAG7f6d54c66 [2022-11-22 02:31:50,367 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/data/8a83b5ee8/40131bda2cc547f9a5760f0ab760b158 [2022-11-22 02:31:50,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:31:50,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:31:50,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:31:50,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:31:50,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:31:50,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:31:50" (1/1) ... [2022-11-22 02:31:50,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6143f5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:50, skipping insertion in model container [2022-11-22 02:31:50,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:31:50" (1/1) ... [2022-11-22 02:31:50,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:31:50,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:31:50,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:31:50,960 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:31:51,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:31:51,088 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:31:51,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51 WrapperNode [2022-11-22 02:31:51,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:31:51,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:31:51,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:31:51,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:31:51,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,147 INFO L138 Inliner]: procedures = 164, calls = 70, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 120 [2022-11-22 02:31:51,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:31:51,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:31:51,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:31:51,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:31:51,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,183 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:31:51,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:31:51,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:31:51,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:31:51,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (1/1) ... [2022-11-22 02:31:51,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:31:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:31:51,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:31:51,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:31:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:31:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-22 02:31:51,276 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-22 02:31:51,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-22 02:31:51,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-22 02:31:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:31:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:31:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:31:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:31:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:31:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:31:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-22 02:31:51,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:31:51,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:31:51,435 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:31:51,437 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:31:51,776 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:31:51,920 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:31:51,920 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:31:51,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:31:51 BoogieIcfgContainer [2022-11-22 02:31:51,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:31:51,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:31:51,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:31:51,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:31:51,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:31:50" (1/3) ... [2022-11-22 02:31:51,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3554ff90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:31:51, skipping insertion in model container [2022-11-22 02:31:51,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:31:51" (2/3) ... [2022-11-22 02:31:51,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3554ff90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:31:51, skipping insertion in model container [2022-11-22 02:31:51,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:31:51" (3/3) ... [2022-11-22 02:31:51,932 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2022-11-22 02:31:51,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:31:51,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-22 02:31:52,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:31:52,007 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;@2c4b0eef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:31:52,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-22 02:31:52,012 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-22 02:31:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:31:52,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:52,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:31:52,022 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-22 02:31:52,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 648377899, now seen corresponding path program 1 times [2022-11-22 02:31:52,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:52,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831939128] [2022-11-22 02:31:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:52,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:52,485 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-22 02:31:52,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:52,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831939128] [2022-11-22 02:31:52,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831939128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:52,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:31:52,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:31:52,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936673321] [2022-11-22 02:31:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:52,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:31:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:52,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:31:52,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:31:52,526 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-22 02:31:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:52,628 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-22 02:31:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:31:52,631 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-22 02:31:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:52,639 INFO L225 Difference]: With dead ends: 58 [2022-11-22 02:31:52,640 INFO L226 Difference]: Without dead ends: 40 [2022-11-22 02:31:52,643 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-22 02:31:52,646 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-22 02:31:52,647 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-22 02:31:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-22 02:31:52,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-11-22 02:31:52,683 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-22 02:31:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-22 02:31:52,686 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2022-11-22 02:31:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:52,687 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-22 02:31:52,687 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-22 02:31:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-11-22 02:31:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:31:52,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:52,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:31:52,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:31:52,689 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-22 02:31:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash 321259645, now seen corresponding path program 1 times [2022-11-22 02:31:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:52,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279689697] [2022-11-22 02:31:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:52,928 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-22 02:31:52,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:52,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279689697] [2022-11-22 02:31:52,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279689697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:52,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:31:52,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:31:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665385895] [2022-11-22 02:31:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:52,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:31:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:31:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:31:52,933 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-22 02:31:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:53,053 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-11-22 02:31:53,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:31:53,055 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-22 02:31:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:53,061 INFO L225 Difference]: With dead ends: 34 [2022-11-22 02:31:53,061 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 02:31:53,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:31:53,069 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:31:53,070 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.1s Time] [2022-11-22 02:31:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 02:31:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-22 02:31:53,074 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-22 02:31:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-22 02:31:53,075 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 11 [2022-11-22 02:31:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:53,076 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-22 02:31:53,076 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-22 02:31:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-22 02:31:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:31:53,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:53,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:31:53,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:31:53,078 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-22 02:31:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash 880791565, now seen corresponding path program 1 times [2022-11-22 02:31:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:53,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588483354] [2022-11-22 02:31:53,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:53,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:53,354 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-22 02:31:53,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:53,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588483354] [2022-11-22 02:31:53,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588483354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:53,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:31:53,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:31:53,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157379666] [2022-11-22 02:31:53,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:53,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:31:53,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:53,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:31:53,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:31:53,363 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-22 02:31:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:53,509 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-11-22 02:31:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:31:53,510 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-22 02:31:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:53,513 INFO L225 Difference]: With dead ends: 51 [2022-11-22 02:31:53,513 INFO L226 Difference]: Without dead ends: 41 [2022-11-22 02:31:53,514 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-22 02:31:53,518 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-22 02:31:53,519 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-22 02:31:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-22 02:31:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-11-22 02:31:53,534 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-22 02:31:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-22 02:31:53,536 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-11-22 02:31:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:53,537 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-22 02:31:53,537 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-22 02:31:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-22 02:31:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:31:53,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:53,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:31:53,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:31:53,539 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-22 02:31:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 332493279, now seen corresponding path program 1 times [2022-11-22 02:31:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:53,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095599341] [2022-11-22 02:31:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:53,667 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-22 02:31:53,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:53,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095599341] [2022-11-22 02:31:53,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095599341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:53,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:31:53,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:31:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277664811] [2022-11-22 02:31:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:53,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:31:53,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:31:53,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:31:53,670 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-22 02:31:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:53,735 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-11-22 02:31:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:31:53,736 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-22 02:31:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:53,737 INFO L225 Difference]: With dead ends: 35 [2022-11-22 02:31:53,737 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 02:31:53,738 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-22 02:31:53,744 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-22 02:31:53,746 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-22 02:31:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 02:31:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-22 02:31:53,760 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-22 02:31:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-22 02:31:53,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2022-11-22 02:31:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:53,763 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-22 02:31:53,764 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-22 02:31:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-11-22 02:31:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:31:53,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:53,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:31:53,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:31:53,766 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-22 02:31:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1816083574, now seen corresponding path program 1 times [2022-11-22 02:31:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236362926] [2022-11-22 02:31:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:53,907 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-22 02:31:53,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:53,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236362926] [2022-11-22 02:31:53,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236362926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:53,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:31:53,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:31:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409632163] [2022-11-22 02:31:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:53,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:31:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:31:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:31:53,915 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-22 02:31:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:53,987 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-11-22 02:31:53,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:31:53,988 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-22 02:31:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:53,990 INFO L225 Difference]: With dead ends: 40 [2022-11-22 02:31:53,991 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 02:31:53,992 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-22 02:31:53,993 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-22 02:31:53,999 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-22 02:31:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 02:31:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-22 02:31:54,011 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-22 02:31:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-11-22 02:31:54,013 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2022-11-22 02:31:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:54,013 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-11-22 02:31:54,014 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-22 02:31:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-11-22 02:31:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:31:54,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:54,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:31:54,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:31:54,015 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-22 02:31:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1158426386, now seen corresponding path program 1 times [2022-11-22 02:31:54,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:54,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793362325] [2022-11-22 02:31:54,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:54,175 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-22 02:31:54,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:54,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793362325] [2022-11-22 02:31:54,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793362325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:54,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:31:54,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:31:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820052874] [2022-11-22 02:31:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:54,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:31:54,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:54,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:31:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:31:54,178 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-22 02:31:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:54,221 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-11-22 02:31:54,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:31:54,221 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-22 02:31:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:54,222 INFO L225 Difference]: With dead ends: 46 [2022-11-22 02:31:54,222 INFO L226 Difference]: Without dead ends: 27 [2022-11-22 02:31:54,223 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-22 02:31:54,224 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-22 02:31:54,225 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-22 02:31:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-22 02:31:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-22 02:31:54,233 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-22 02:31:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-11-22 02:31:54,234 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2022-11-22 02:31:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:54,235 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-22 02:31:54,236 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-22 02:31:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-11-22 02:31:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 02:31:54,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:54,237 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-22 02:31:54,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:31:54,238 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-22 02:31:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash 549943109, now seen corresponding path program 1 times [2022-11-22 02:31:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:54,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120321962] [2022-11-22 02:31:54,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:54,420 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-22 02:31:54,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:54,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120321962] [2022-11-22 02:31:54,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120321962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:31:54,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2983550] [2022-11-22 02:31:54,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:54,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:31:54,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:31:54,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:31:54,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:31:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:54,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-22 02:31:54,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:31:54,731 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-22 02:31:54,797 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-22 02:31:54,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:54,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:54,827 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-22 02:31:54,915 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-22 02:31:54,936 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-22 02:31:54,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:31:54,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2983550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:54,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:31:54,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-22 02:31:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614853478] [2022-11-22 02:31:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:54,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 02:31:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 02:31:54,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-22 02:31:54,939 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-22 02:31:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:55,202 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-11-22 02:31:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:31:55,203 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-22 02:31:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:55,204 INFO L225 Difference]: With dead ends: 33 [2022-11-22 02:31:55,204 INFO L226 Difference]: Without dead ends: 32 [2022-11-22 02:31:55,205 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-22 02:31:55,205 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:31:55,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 55 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-22 02:31:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-22 02:31:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-11-22 02:31:55,213 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-22 02:31:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-11-22 02:31:55,214 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2022-11-22 02:31:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:55,214 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-11-22 02:31:55,214 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-22 02:31:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-11-22 02:31:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:31:55,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:55,215 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-22 02:31:55,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:31:55,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:31:55,423 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-22 02:31:55,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash -131632725, now seen corresponding path program 1 times [2022-11-22 02:31:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:55,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923017400] [2022-11-22 02:31:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:55,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:55,619 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-22 02:31:55,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:55,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923017400] [2022-11-22 02:31:55,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923017400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:31:55,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684946732] [2022-11-22 02:31:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:55,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:31:55,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:31:55,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:31:55,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:31:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:55,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-22 02:31:55,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:31:55,801 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-22 02:31:55,918 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-22 02:31:55,966 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-22 02:31:55,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:55,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:55,989 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-22 02:31:56,064 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-22 02:31:56,086 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-22 02:31:56,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:31:56,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684946732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:56,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:31:56,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-22 02:31:56,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551068233] [2022-11-22 02:31:56,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:56,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 02:31:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:56,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 02:31:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-22 02:31:56,089 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-22 02:31:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:56,362 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-11-22 02:31:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 02:31:56,363 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-22 02:31:56,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:56,363 INFO L225 Difference]: With dead ends: 32 [2022-11-22 02:31:56,363 INFO L226 Difference]: Without dead ends: 31 [2022-11-22 02:31:56,364 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-22 02:31:56,364 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:31:56,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 65 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-11-22 02:31:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-22 02:31:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2022-11-22 02:31:56,371 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-22 02:31:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-11-22 02:31:56,372 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-11-22 02:31:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:56,372 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-11-22 02:31:56,372 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-22 02:31:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-11-22 02:31:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:31:56,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:56,373 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-22 02:31:56,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:31:56,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:31:56,585 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-22 02:31:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 214706967, now seen corresponding path program 1 times [2022-11-22 02:31:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:56,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638742291] [2022-11-22 02:31:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:56,739 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-22 02:31:56,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:56,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638742291] [2022-11-22 02:31:56,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638742291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:31:56,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:31:56,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:31:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965477592] [2022-11-22 02:31:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:31:56,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:31:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:31:56,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:31:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:31:56,741 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-22 02:31:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:31:56,799 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-11-22 02:31:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:31:56,800 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-22 02:31:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:31:56,801 INFO L225 Difference]: With dead ends: 31 [2022-11-22 02:31:56,801 INFO L226 Difference]: Without dead ends: 25 [2022-11-22 02:31:56,801 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-22 02:31:56,802 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-22 02:31:56,802 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-22 02:31:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-22 02:31:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-22 02:31:56,809 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-22 02:31:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-22 02:31:56,810 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2022-11-22 02:31:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:31:56,810 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-22 02:31:56,810 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-22 02:31:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-22 02:31:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:31:56,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:31:56,811 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-22 02:31:56,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 02:31:56,811 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-22 02:31:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:31:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash -163358720, now seen corresponding path program 1 times [2022-11-22 02:31:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:31:56,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579510582] [2022-11-22 02:31:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:56,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:31:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:56,961 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-22 02:31:56,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:31:56,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579510582] [2022-11-22 02:31:56,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579510582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:31:56,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567739168] [2022-11-22 02:31:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:31:56,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:31:56,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:31:56,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:31:56,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:31:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:31:57,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-22 02:31:57,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:31:57,293 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-22 02:31:57,343 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-22 02:31:57,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:57,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:31:57,370 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-22 02:31:57,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:31:57,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:31:57,542 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-22 02:31:57,616 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-22 02:31:57,653 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-22 02:31:57,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:32:00,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567739168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:32:00,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1276361687] [2022-11-22 02:32:00,149 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:32:00,149 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:32:00,153 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:32:00,160 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:32:00,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:32:00,223 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-22 02:32:00,230 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-22 02:32:00,366 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-22 02:32:00,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:32:00,399 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-22 02:32:00,399 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-22 02:32:00,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:32:00,441 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 02:32:00,441 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-22 02:32:00,517 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-22 02:32:00,527 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-22 02:32:00,544 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-22 02:32:00,641 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-22 02:32:00,667 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-22 02:32:00,678 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-22 02:32:00,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:00,818 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-22 02:32:00,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:00,825 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-22 02:32:00,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:00,833 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-22 02:32:00,890 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-22 02:32:01,100 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-22 02:32:01,278 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-22 02:32:01,297 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-22 02:32:01,319 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-22 02:32:01,552 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-22 02:32:01,566 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-22 02:32:01,598 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:32:07,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1276361687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:32:07,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:32:07,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [4, 18] total 40 [2022-11-22 02:32:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368857001] [2022-11-22 02:32:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:32:07,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-22 02:32:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:32:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-22 02:32:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1952, Unknown=2, NotChecked=90, Total=2256 [2022-11-22 02:32:07,312 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:32:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:32:11,647 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-11-22 02:32:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 02:32:11,648 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-11-22 02:32:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:32:11,648 INFO L225 Difference]: With dead ends: 25 [2022-11-22 02:32:11,649 INFO L226 Difference]: Without dead ends: 24 [2022-11-22 02:32:11,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=366, Invalid=2716, Unknown=2, NotChecked=108, Total=3192 [2022-11-22 02:32:11,651 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:32:11,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 15 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:32:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-22 02:32:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-22 02:32:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-22 02:32:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-11-22 02:32:11,667 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-11-22 02:32:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:32:11,667 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-11-22 02:32:11,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 02:32:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-11-22 02:32:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:32:11,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:32:11,668 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, 1] [2022-11-22 02:32:11,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 02:32:11,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 02:32:11,875 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-22 02:32:11,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:32:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash -769152927, now seen corresponding path program 1 times [2022-11-22 02:32:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:32:11,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028714779] [2022-11-22 02:32:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:32:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:32:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:32:12,010 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-22 02:32:12,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:32:12,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028714779] [2022-11-22 02:32:12,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028714779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:32:12,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577330487] [2022-11-22 02:32:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:32:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:32:12,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:32:12,012 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:32:12,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:32:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:32:12,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 131 conjunts are in the unsatisfiable core [2022-11-22 02:32:12,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:32:12,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-22 02:32:12,296 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-22 02:32:12,348 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_310 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_308 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_310) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_308))))) is different from true [2022-11-22 02:32:12,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:12,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:12,367 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-22 02:32:12,549 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:32:12,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:32:12,553 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-22 02:32:12,627 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-22 02:32:12,668 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-22 02:32:12,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:32:13,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577330487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:32:13,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [51109167] [2022-11-22 02:32:13,164 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-22 02:32:13,164 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:32:13,165 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:32:13,165 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:32:13,165 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:32:13,195 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-22 02:32:13,202 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-22 02:32:13,298 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-22 02:32:13,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:32:13,328 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 02:32:13,328 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-22 02:32:13,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:32:13,353 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-22 02:32:13,354 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 132 treesize of output 124 [2022-11-22 02:32:13,408 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-22 02:32:13,420 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-22 02:32:13,429 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-22 02:32:13,488 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-22 02:32:13,507 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-22 02:32:13,522 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-22 02:32:13,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:13,703 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-22 02:32:13,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:13,711 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-22 02:32:13,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:32:13,716 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-22 02:32:13,761 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-22 02:32:13,915 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-22 02:32:14,036 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-22 02:32:14,047 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-22 02:32:14,066 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-22 02:32:14,313 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-22 02:32:14,325 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-22 02:32:14,351 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:32:20,971 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1458#(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_atomic_sub_return_~temp~1#1| 2147483648) |ULTIMATE.start_ldv_atomic_sub_return_~i#1|) (= |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|) (<= 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-22 02:32:20,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:32:20,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 02:32:20,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 17] total 20 [2022-11-22 02:32:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354427468] [2022-11-22 02:32:20,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 02:32:20,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 02:32:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:32:20,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 02:32:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1952, Unknown=1, NotChecked=90, Total=2256 [2022-11-22 02:32:20,974 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 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-22 02:32:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:32:21,850 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-11-22 02:32:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 02:32:21,851 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 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 23 [2022-11-22 02:32:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:32:21,851 INFO L225 Difference]: With dead ends: 40 [2022-11-22 02:32:21,851 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 02:32:21,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=335, Invalid=2974, Unknown=1, NotChecked=112, Total=3422 [2022-11-22 02:32:21,854 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:32:21,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 28 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-11-22 02:32:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 02:32:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 02:32:21,855 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-22 02:32:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 02:32:21,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-11-22 02:32:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:32:21,855 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 02:32:21,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 18 states have internal predecessors, (37), 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-22 02:32:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 02:32:21,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 02:32:21,858 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-22 02:32:21,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-22 02:32:21,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-22 02:32:21,860 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-22 02:32:21,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:32:22,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-22 02:32:22,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 02:32:25,686 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-22 02:32:25,686 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-22 02:32:25,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-22 02:32:25,686 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-22 02:32:25,687 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|) (= |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_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_atomic_add_return_~temp~0#1| |ULTIMATE.start_ldv_atomic_add_return_~i#1|) 2147483647) (= |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_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_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.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|) (= |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|) (= |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-22 02:32:25,687 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-22 02:32:25,687 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-22 02:32:25,689 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-22 02:32:25,690 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|)))) (.cse6 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (.cse7 (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0)) (.cse8 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) 12))) (.cse10 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) (.cse11 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|)) (.cse12 (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|)) (.cse5 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0)) (.cse9 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse13 (+ |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|) .cse6 .cse7 (= |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|) .cse8 (= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= (+ |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| |ULTIMATE.start_ldv_atomic_add_return_~i#1|) 2147483647) (= |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|) .cse13)) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_get_#in~kobj#1.offset|) (= .cse13 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) .cse10 (= |~#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|) .cse11 (= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 0 |#StackHeapBarrier|) .cse12 (= |#NULL.base| 0) (= |ULTIMATE.start_ldv_kref_get_~kref#1.offset| |ULTIMATE.start_ldv_atomic_add_return_#in~v#1.offset|))) (and .cse2 .cse5 .cse9 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)))) [2022-11-22 02:32:25,690 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-22 02:32:25,690 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-22 02:32:25,690 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 714) no Hoare annotation was computed. [2022-11-22 02:32:25,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-22 02:32:25,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 02:32:25,690 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-22 02:32:25,690 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-22 02:32:25,691 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-22 02:32:25,691 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-22 02:32:25,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-22 02:32:25,691 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 02:32:25,691 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-22 02:32:25,691 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-22 02:32:25,691 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-22 02:32:25,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-22 02:32:25,692 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-22 02:32:25,692 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-22 02:32:25,692 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-22 02:32:25,692 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-22 02:32:25,695 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:32:25,698 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:32:25,708 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,709 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,709 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,709 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,710 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,710 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,719 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,719 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,720 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,723 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,723 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,724 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,726 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,726 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,726 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,727 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,727 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,728 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,728 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,728 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,729 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,729 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,730 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,730 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,731 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,731 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,731 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,732 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,733 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,734 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,735 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,735 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,735 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,736 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,738 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,738 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,739 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,739 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,739 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,740 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,741 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,742 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,742 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,742 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,743 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,743 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,744 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,744 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,745 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,745 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,745 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,745 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,747 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,758 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-22 02:32:25,759 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-22 02:32:25,759 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,760 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,760 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,761 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,764 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,764 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-22 02:32:25,765 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-22 02:32:25,765 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,766 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,766 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,767 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:32:25 BoogieIcfgContainer [2022-11-22 02:32:25,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:32:25,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:32:25,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:32:25,771 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:32:25,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:31:51" (3/4) ... [2022-11-22 02:32:25,774 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 02:32:25,780 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-22 02:32:25,781 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-22 02:32:25,787 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2022-11-22 02:32:25,787 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-22 02:32:25,787 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 02:32:25,819 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-22 02:32:25,820 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((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))) || ((((((((((((((((((((((((((((((((((((((((((((((((((((#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) && temp + i <= 2147483647) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && 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 == \result && kobj == 0) && kobj == 0) && \result == 0) [2022-11-22 02:32:25,821 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-22 02:32:25,821 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) && release == release) && kref <= 12) && 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) && temp + i <= 2147483647) && release == release) && unknown-#value-unknown == 0) && kobj == kobj) && kobj == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && 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 <= 0) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && kobj == kobj) && \old(count) == 1) && kref == kref) && 0 <= kobj) && 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-22 02:32:25,841 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:32:25,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:32:25,841 INFO L158 Benchmark]: Toolchain (without parser) took 35470.15ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 126.3MB in the beginning and 137.9MB in the end (delta: -11.6MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2022-11-22 02:32:25,842 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 121.6MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:32:25,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 716.03ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 104.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 02:32:25,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.62ms. Allocated memory is still 159.4MB. Free memory was 104.8MB in the beginning and 102.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:32:25,843 INFO L158 Benchmark]: Boogie Preprocessor took 40.16ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:32:25,843 INFO L158 Benchmark]: RCFGBuilder took 733.40ms. Allocated memory is still 159.4MB. Free memory was 100.4MB in the beginning and 73.5MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-22 02:32:25,843 INFO L158 Benchmark]: TraceAbstraction took 33844.20ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 72.6MB in the beginning and 142.1MB in the end (delta: -69.5MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2022-11-22 02:32:25,844 INFO L158 Benchmark]: Witness Printer took 70.84ms. Allocated memory is still 232.8MB. Free memory was 142.1MB in the beginning and 137.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:32:25,845 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.19ms. Allocated memory is still 121.6MB. Free memory is still 98.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 716.03ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 104.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.62ms. Allocated memory is still 159.4MB. Free memory was 104.8MB in the beginning and 102.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.16ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 100.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 733.40ms. Allocated memory is still 159.4MB. Free memory was 100.4MB in the beginning and 73.5MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33844.20ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 72.6MB in the beginning and 142.1MB in the end (delta: -69.5MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. * Witness Printer took 70.84ms. Allocated memory is still 232.8MB. Free memory was 142.1MB in the beginning and 137.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.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.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 350 mSDsluCounter, 534 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 80 IncrementalHoareTripleChecker+Unchecked, 375 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 159 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 182 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=3, InterpolantAutomatonStates: 101, 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, 1349 HoareAnnotationTreeSize, 13 FomulaSimplifications, 192 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1838 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 246 ConstructedInterpolants, 4 QuantifiedInterpolants, 1158 SizeOfPredicates, 193 NumberOfNonLiveVariables, 940 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3/9 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.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 21, TOOLS_POST_TIME: 0.7s, TOOLS_POST_CALL_APPLICATIONS: 6, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 31, TOOLS_QUANTIFIERELIM_TIME: 1.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 61, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, 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: 274, DAG_COMPRESSION_RETAINED_NODES: 60, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 738]: Loop Invariant [2022-11-22 02:32:25,863 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,863 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,863 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,864 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,864 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,864 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,865 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,866 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,867 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-22 02:32:25,868 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,868 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,868 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,869 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-22 02:32:25,869 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,869 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,870 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,870 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,870 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,870 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,871 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,871 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,872 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,872 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,872 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,872 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-22 02:32:25,873 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,874 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,874 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,874 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,875 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,876 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,877 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,878 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-22 02:32:25,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,883 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,884 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,884 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,885 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,885 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,885 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,885 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,886 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,886 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-22 02:32:25,888 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,889 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,889 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,890 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,890 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,890 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,892 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,893 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,893 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,894 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,894 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,894 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled Derived loop invariant: (((((((((((((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))) || ((((((((((((((((((((((((((((((((((((((((((((((((((((#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) && temp + i <= 2147483647) && unknown-#value-unknown == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && 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 == \result && kobj == 0) && kobj == 0) && \result == 0) - InvariantResult [Line: 667]: Loop Invariant [2022-11-22 02:32:25,896 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,896 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,897 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-22 02:32:25,897 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-22 02:32:25,898 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,898 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,899 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,899 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,901 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,901 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,902 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.offset [2022-11-22 02:32:25,902 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~ldv_kobject_release.base [2022-11-22 02:32:25,903 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,903 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-11-22 02:32:25,903 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-11-22 02:32:25,904 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) && release == release) && kref <= 12) && 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) && temp + i <= 2147483647) && release == release) && unknown-#value-unknown == 0) && kobj == kobj) && kobj == 0) && #Ultimate.C_memset_#ptr#1 == #Ultimate.C_memset_#res#1) && 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 <= 0) && kobj == kobj) && \result == kobj) && kobj == kobj) && v == kobj) && 0 <= #Ultimate.C_memset_#res#1) && kobj == \result) && kobj == kobj) && \old(count) == 1) && kref == kref) && 0 <= kobj) && 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-22 02:32:25,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_186eea2d-dd12-4bac-8ff1-4f6558b0233d/bin/utaipan-g80aRyZoba/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