./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:20:02,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:20:02,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:20:02,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:20:02,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:20:02,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:20:02,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:20:02,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:20:02,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:20:02,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:20:02,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:20:02,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:20:02,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:20:02,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:20:02,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:20:02,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:20:02,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:20:02,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:20:02,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:20:02,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:20:02,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:20:02,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:20:02,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:20:02,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:20:02,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:20:02,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:20:02,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:20:02,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:20:02,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:20:02,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:20:02,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:20:02,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:20:02,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:20:02,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:20:02,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:20:02,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:20:02,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:20:02,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:20:02,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:20:02,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:20:02,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:20:02,537 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:20:02,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:20:02,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:20:02,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:20:02,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:20:02,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:20:02,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:20:02,588 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:20:02,588 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:20:02,588 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:20:02,588 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:20:02,589 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:20:02,589 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:20:02,589 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:20:02,589 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:20:02,589 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:20:02,590 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:20:02,590 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:20:02,590 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:20:02,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:20:02,591 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:20:02,591 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:20:02,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:20:02,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:20:02,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:20:02,592 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:20:02,592 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:20:02,592 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:20:02,592 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:20:02,627 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:20:02,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:20:02,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:20:02,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:20:02,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:20:02,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:20:02,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:20:02,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:20:02,629 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:20:02,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:20:02,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:20:02,629 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:20:02,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:20:02,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:20:02,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:20:02,630 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_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2022-11-25 23:20:02,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:20:02,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:20:02,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:20:02,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:20:02,907 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:20:02,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2022-11-25 23:20:05,999 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:20:06,324 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:20:06,329 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2022-11-25 23:20:06,343 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/data/42b602bde/69012f8559ba48e1b2d74250dc78adc7/FLAG80025ffaa [2022-11-25 23:20:06,358 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/data/42b602bde/69012f8559ba48e1b2d74250dc78adc7 [2022-11-25 23:20:06,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:20:06,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:20:06,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:20:06,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:20:06,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:20:06,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:20:06" (1/1) ... [2022-11-25 23:20:06,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3235de5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:06, skipping insertion in model container [2022-11-25 23:20:06,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:20:06" (1/1) ... [2022-11-25 23:20:06,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:20:06,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:20:06,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:20:06,923 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:20:07,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:20:07,076 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:20:07,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07 WrapperNode [2022-11-25 23:20:07,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:20:07,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:20:07,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:20:07,079 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:20:07,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,158 INFO L138 Inliner]: procedures = 166, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 122 [2022-11-25 23:20:07,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:20:07,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:20:07,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:20:07,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:20:07,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,226 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:20:07,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:20:07,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:20:07,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:20:07,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (1/1) ... [2022-11-25 23:20:07,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:20:07,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:20:07,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:20:07,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:20:07,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:20:07,329 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-25 23:20:07,330 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-25 23:20:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 23:20:07,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 23:20:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-25 23:20:07,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-25 23:20:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:20:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:20:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:20:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:20:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:20:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:20:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 23:20:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:20:07,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:20:07,546 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:20:07,561 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:20:07,940 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:20:08,060 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:20:08,060 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:20:08,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:20:08 BoogieIcfgContainer [2022-11-25 23:20:08,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:20:08,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:20:08,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:20:08,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:20:08,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:20:06" (1/3) ... [2022-11-25 23:20:08,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b611024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:20:08, skipping insertion in model container [2022-11-25 23:20:08,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:20:07" (2/3) ... [2022-11-25 23:20:08,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b611024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:20:08, skipping insertion in model container [2022-11-25 23:20:08,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:20:08" (3/3) ... [2022-11-25 23:20:08,076 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2022-11-25 23:20:08,100 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:20:08,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-25 23:20:08,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:20:08,187 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;@6336102a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:20:08,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-25 23:20:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:20:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:20:08,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:08,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:08,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash -273081682, now seen corresponding path program 1 times [2022-11-25 23:20:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:08,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424890439] [2022-11-25 23:20:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:08,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:08,726 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-25 23:20:08,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:08,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424890439] [2022-11-25 23:20:08,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424890439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:08,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:08,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:20:08,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562398294] [2022-11-25 23:20:08,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:08,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:20:08,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:08,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:20:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:20:08,791 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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-25 23:20:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:08,940 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-25 23:20:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:20:08,944 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-25 23:20:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:08,953 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:20:08,953 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 23:20:08,957 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-25 23:20:08,961 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:08,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:20:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 23:20:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-11-25 23:20:09,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-25 23:20:09,011 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2022-11-25 23:20:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:09,011 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-25 23:20:09,012 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-25 23:20:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-25 23:20:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:20:09,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:09,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:09,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:20:09,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash -129132699, now seen corresponding path program 1 times [2022-11-25 23:20:09,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:09,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396949903] [2022-11-25 23:20:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:09,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:09,290 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-25 23:20:09,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396949903] [2022-11-25 23:20:09,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396949903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:09,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:09,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:20:09,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999923906] [2022-11-25 23:20:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:09,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:20:09,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:09,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:20:09,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:20:09,295 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:20:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:09,424 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-11-25 23:20:09,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:20:09,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-25 23:20:09,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:09,429 INFO L225 Difference]: With dead ends: 38 [2022-11-25 23:20:09,429 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 23:20:09,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:20:09,433 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:09,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:20:09,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 23:20:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 23:20:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-11-25 23:20:09,445 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2022-11-25 23:20:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:09,445 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-11-25 23:20:09,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 23:20:09,446 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-11-25 23:20:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 23:20:09,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:09,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:09,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:20:09,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1013822364, now seen corresponding path program 1 times [2022-11-25 23:20:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:09,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475007096] [2022-11-25 23:20:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:09,678 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-25 23:20:09,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:09,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475007096] [2022-11-25 23:20:09,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475007096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:09,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:09,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:20:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794659491] [2022-11-25 23:20:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:09,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:20:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:20:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:20:09,689 INFO L87 Difference]: Start difference. First operand 28 states and 31 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-25 23:20:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:09,842 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-11-25 23:20:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:20:09,843 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-25 23:20:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:09,844 INFO L225 Difference]: With dead ends: 47 [2022-11-25 23:20:09,845 INFO L226 Difference]: Without dead ends: 35 [2022-11-25 23:20:09,846 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-25 23:20:09,849 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 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-25 23:20:09,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:20:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-25 23:20:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-11-25 23:20:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-25 23:20:09,868 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-25 23:20:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:09,869 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-25 23:20:09,869 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-25 23:20:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-25 23:20:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:20:09,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:09,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:09,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:20:09,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2136735987, now seen corresponding path program 1 times [2022-11-25 23:20:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395419989] [2022-11-25 23:20:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:09,996 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-25 23:20:09,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:09,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395419989] [2022-11-25 23:20:09,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395419989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:09,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:09,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:20:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511828725] [2022-11-25 23:20:09,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:09,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:20:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:10,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:20:10,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:20:10,001 INFO L87 Difference]: Start difference. First operand 31 states and 34 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-25 23:20:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:10,081 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-11-25 23:20:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:20:10,082 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-25 23:20:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:10,083 INFO L225 Difference]: With dead ends: 47 [2022-11-25 23:20:10,084 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 23:20:10,084 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-25 23:20:10,085 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:10,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:20:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 23:20:10,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 23:20:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-11-25 23:20:10,094 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 14 [2022-11-25 23:20:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:10,094 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-11-25 23:20:10,095 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-25 23:20:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-11-25 23:20:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:20:10,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:10,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:10,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:20:10,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1202746782, now seen corresponding path program 1 times [2022-11-25 23:20:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:10,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498270145] [2022-11-25 23:20:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:10,238 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-25 23:20:10,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:10,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498270145] [2022-11-25 23:20:10,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498270145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:10,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:10,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:20:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551350090] [2022-11-25 23:20:10,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:10,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:20:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:10,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:20:10,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:20:10,241 INFO L87 Difference]: Start difference. First operand 28 states and 29 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-25 23:20:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:10,272 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-11-25 23:20:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:20:10,273 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-25 23:20:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:10,274 INFO L225 Difference]: With dead ends: 50 [2022-11-25 23:20:10,274 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 23:20:10,274 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-25 23:20:10,275 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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-25 23:20:10,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:20:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 23:20:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-25 23:20:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-11-25 23:20:10,283 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2022-11-25 23:20:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:10,283 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-11-25 23:20:10,284 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-25 23:20:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-11-25 23:20:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:20:10,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:10,285 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-25 23:20:10,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:20:10,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash 831589163, now seen corresponding path program 1 times [2022-11-25 23:20:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:10,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088074940] [2022-11-25 23:20:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:10,427 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-25 23:20:10,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:10,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088074940] [2022-11-25 23:20:10,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088074940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:10,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646937990] [2022-11-25 23:20:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:10,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:10,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:20:10,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:20:10,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:20:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:10,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-25 23:20:10,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:20:10,792 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-25 23:20:10,868 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_80 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_82 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_80) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_82))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-25 23:20:10,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:10,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:10,902 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-25 23:20:11,006 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-25 23:20:11,032 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-25 23:20:11,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:20:11,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646937990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:11,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:20:11,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-25 23:20:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688453150] [2022-11-25 23:20:11,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:11,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:20:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:11,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:20:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-25 23:20:11,036 INFO L87 Difference]: Start difference. First operand 29 states and 30 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-25 23:20:11,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:11,371 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-11-25 23:20:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:20:11,372 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-25 23:20:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:11,373 INFO L225 Difference]: With dead ends: 31 [2022-11-25 23:20:11,373 INFO L226 Difference]: Without dead ends: 30 [2022-11-25 23:20:11,373 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-25 23:20:11,374 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:11,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 81 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 29 Unchecked, 0.2s Time] [2022-11-25 23:20:11,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-25 23:20:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-11-25 23:20:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-11-25 23:20:11,384 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 18 [2022-11-25 23:20:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:11,385 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-11-25 23:20:11,385 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-25 23:20:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-11-25 23:20:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:20:11,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:11,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:11,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:20:11,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:11,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash 9460357, now seen corresponding path program 1 times [2022-11-25 23:20:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:11,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682560412] [2022-11-25 23:20:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:11,804 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-25 23:20:11,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682560412] [2022-11-25 23:20:11,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682560412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378218738] [2022-11-25 23:20:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:11,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:11,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:20:11,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:20:11,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:20:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:11,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-25 23:20:11,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:20:12,093 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-25 23:20:12,152 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_137 Int) (v_ArrVal_135 Int) (LDV_INIT_LIST_HEAD_~list.offset 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_135) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_137))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-25 23:20:12,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:12,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:12,177 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-25 23:20:12,272 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-25 23:20:12,299 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-25 23:20:12,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:20:12,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378218738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:12,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:20:12,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 16 [2022-11-25 23:20:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58158811] [2022-11-25 23:20:12,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:12,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:20:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:20:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=177, Unknown=1, NotChecked=26, Total=240 [2022-11-25 23:20:12,303 INFO L87 Difference]: Start difference. First operand 28 states and 29 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-25 23:20:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:12,608 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-11-25 23:20:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:20:12,609 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-25 23:20:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:12,610 INFO L225 Difference]: With dead ends: 30 [2022-11-25 23:20:12,610 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 23:20:12,610 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-25 23:20:12,611 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:12,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 28 Unchecked, 0.2s Time] [2022-11-25 23:20:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 23:20:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-25 23:20:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-11-25 23:20:12,621 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2022-11-25 23:20:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:12,621 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-11-25 23:20:12,622 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-25 23:20:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-11-25 23:20:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:20:12,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:12,623 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-25 23:20:12,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:20:12,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:12,829 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:12,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1282473630, now seen corresponding path program 1 times [2022-11-25 23:20:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:12,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178979320] [2022-11-25 23:20:12,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:13,056 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-25 23:20:13,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:13,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178979320] [2022-11-25 23:20:13,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178979320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:20:13,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:20:13,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:20:13,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398544608] [2022-11-25 23:20:13,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:13,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:20:13,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:20:13,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:20:13,060 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:13,123 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-11-25 23:20:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:20:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-11-25 23:20:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:13,125 INFO L225 Difference]: With dead ends: 35 [2022-11-25 23:20:13,125 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 23:20:13,126 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-25 23:20:13,127 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:13,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 55 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:20:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 23:20:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 23:20:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-25 23:20:13,137 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2022-11-25 23:20:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:13,138 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-25 23:20:13,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-25 23:20:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:20:13,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:13,139 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, 1] [2022-11-25 23:20:13,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:20:13,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash -828175803, now seen corresponding path program 1 times [2022-11-25 23:20:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773158344] [2022-11-25 23:20:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:13,309 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-25 23:20:13,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:13,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773158344] [2022-11-25 23:20:13,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773158344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029292761] [2022-11-25 23:20:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:13,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:20:13,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:20:13,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:20:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:13,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-25 23:20:13,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:20:13,481 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-25 23:20:13,593 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-25 23:20:13,646 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_228 Int) (v_ArrVal_227 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_228) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_227))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-25 23:20:13,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:13,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:13,666 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-25 23:20:13,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:13,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:20:13,837 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-25 23:20:13,945 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-25 23:20:13,968 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-25 23:20:13,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:20:14,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029292761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:14,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [662113941] [2022-11-25 23:20:14,569 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:20:14,570 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:20:14,573 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:20:14,578 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:20:14,579 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:20:14,632 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-25 23:20:14,637 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-25 23:20:14,749 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-25 23:20:14,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:14,773 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-25 23:20:14,774 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-25 23:20:14,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:20:14,800 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 23:20:14,801 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-25 23:20:14,867 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-25 23:20:14,881 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-25 23:20:14,891 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-25 23:20:14,957 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-25 23:20:14,978 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-25 23:20:14,989 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-25 23:20:15,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:15,135 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-25 23:20:15,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:15,144 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-25 23:20:15,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:20:15,157 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-25 23:20:15,215 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-25 23:20:15,397 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-25 23:20:15,576 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-25 23:20:15,597 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-25 23:20:15,643 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-25 23:20:15,809 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_kobject_put with input of size 39 for LOIs [2022-11-25 23:20:15,843 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-25 23:20:15,858 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-25 23:20:15,890 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:20:21,886 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1220#(and (= (ite (<= (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) 2147483647) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296) (+ (- 4294967296) (mod |ldv_kobject_put_ldv_kref_sub_~count#1| 4294967296))) |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| |ldv_kobject_put_ldv_atomic_sub_return_#in~i#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= (+ 12 |ldv_kobject_put_~kobj#1.offset|) |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |ldv_kobject_put_ldv_kref_put_~release#1.offset|) (not (<= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| (+ |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2147483648))) (= |~#ldv_global_msg_list~0.offset| 0) (= |#memory_int| |old(#memory_int)|) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_put_ldv_kref_put_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| 1) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.base| |ldv_kobject_put_ldv_kref_sub_#in~release#1.base|) (= |ldv_kobject_put_ldv_kref_sub_#in~count#1| |ldv_kobject_put_ldv_kref_sub_~count#1|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_int| |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|) (= |ldv_kobject_put_ldv_kref_sub_#in~release#1.base| |ldv_kobject_put_ldv_kref_put_~release#1.base|) (= |ldv_kobject_put_ldv_kref_put_~kref#1.offset| |ldv_kobject_put_ldv_kref_put_#in~kref#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_~release#1.offset| |ldv_kobject_put_ldv_kref_sub_#in~release#1.offset|) (= |ldv_kobject_put_#in~kobj#1.offset| 0) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.base| |#funAddr~ldv_kobject_release.base|) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset|) (= |ldv_kobject_put_ldv_kref_sub_#in~kref#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.offset| |ldv_kobject_put_ldv_kref_sub_~kref#1.offset|) (= |~#ldv_global_msg_list~0.base| 1) (= |#NULL.offset| 0) (= |ldv_kobject_put_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) (= |ldv_kobject_put_ldv_kref_put_#in~kref#1.base| |ldv_kobject_put_ldv_kref_put_~kref#1.base|) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_ldv_kref_put_#in~kref#1.base|) (= |old(#valid)| |#valid|) (<= 0 |#StackHeapBarrier|) (<= 0 (+ 2147483648 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))) (= |#NULL.base| 0) (= |ldv_kobject_put_ldv_atomic_sub_return_#in~v#1.base| |ldv_kobject_put_ldv_kref_sub_~kref#1.base|))' at error location [2022-11-25 23:20:21,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:20:21,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:20:21,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 18] total 21 [2022-11-25 23:20:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009011252] [2022-11-25 23:20:21,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:20:21,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 23:20:21,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:21,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 23:20:21,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2443, Unknown=1, NotChecked=100, Total=2756 [2022-11-25 23:20:21,890 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 21 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:20:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:22,631 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-11-25 23:20:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:20:22,633 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-11-25 23:20:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:22,635 INFO L225 Difference]: With dead ends: 46 [2022-11-25 23:20:22,635 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 23:20:22,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=319, Invalid=3716, Unknown=1, NotChecked=124, Total=4160 [2022-11-25 23:20:22,640 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:22,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 284 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-11-25 23:20:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 23:20:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-25 23:20:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 23:20:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-25 23:20:22,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-11-25 23:20:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:22,667 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-25 23:20:22,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:20:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-25 23:20:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:20:22,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:20:22,669 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:22,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 23:20:22,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 23:20:22,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-25 23:20:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:20:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1913981100, now seen corresponding path program 1 times [2022-11-25 23:20:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:20:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400603192] [2022-11-25 23:20:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:20:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:20:23,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:20:23,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400603192] [2022-11-25 23:20:23,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400603192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:23,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849249992] [2022-11-25 23:20:23,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:20:23,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:20:23,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:20:23,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:20:23,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:20:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:20:23,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-25 23:20:23,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:20:23,332 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-25 23:20:23,413 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 19 treesize of output 7 [2022-11-25 23:20:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:20:23,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:20:23,548 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 34 treesize of output 28 [2022-11-25 23:20:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:20:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849249992] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:20:23,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:20:23,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 9] total 16 [2022-11-25 23:20:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567487689] [2022-11-25 23:20:23,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:20:23,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:20:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:20:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:20:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:20:23,584 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:20:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:20:23,732 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-11-25 23:20:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:20:23,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-25 23:20:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:20:23,734 INFO L225 Difference]: With dead ends: 27 [2022-11-25 23:20:23,734 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:20:23,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:20:23,735 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:20:23,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:20:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:20:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:20:23,737 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-25 23:20:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:20:23,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-11-25 23:20:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:20:23,737 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:20:23,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:20:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:20:23,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:20:23,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-25 23:20:23,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-25 23:20:23,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-25 23:20:23,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-25 23:20:23,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:20:23,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:20:23,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:20:24,917 INFO L902 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: true [2022-11-25 23:20:24,917 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-25 23:20:24,917 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-25 23:20:24,918 INFO L895 garLoopResultBuilder]: At program point L659-1(line 659) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (<= |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1| 1) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= |ULTIMATE.start_ldv_atomic_add_return_~i#1| 1) (<= .cse1 1) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 .cse1) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) 12)) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0) (= (+ |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)) (<= (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_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) [2022-11-25 23:20:24,918 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-25 23:20:24,918 INFO L895 garLoopResultBuilder]: At program point L717-2(lines 717 718) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse1 .cse2) (let ((.cse4 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse4))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (< .cse3 2147483649) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse2) .cse1 (<= 2 .cse3) (= .cse4 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (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_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0)))))))) [2022-11-25 23:20:24,919 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (or (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse1 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= .cse2 1) (<= 1 .cse0) (<= 1 .cse2) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) (and .cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)))) [2022-11-25 23:20:24,919 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-25 23:20:24,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-25 23:20:24,919 INFO L895 garLoopResultBuilder]: At program point L767(line 767) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse1 .cse2) (let ((.cse4 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))) (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) .cse4))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (< .cse3 2147483649) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse2) .cse1 (<= 2 .cse3) (= .cse4 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (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_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0)))))))) [2022-11-25 23:20:24,920 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 763 768) no Hoare annotation was computed. [2022-11-25 23:20:24,920 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:20:24,920 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))) [2022-11-25 23:20:24,921 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-25 23:20:24,921 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~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_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-11-25 23:20:24,921 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) [2022-11-25 23:20:24,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-25 23:20:24,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:20:24,922 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (or (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0))))) [2022-11-25 23:20:24,922 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-25 23:20:24,922 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-25 23:20:24,923 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-25 23:20:24,923 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-11-25 23:20:24,924 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-25 23:20:24,924 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-25 23:20:24,924 INFO L895 garLoopResultBuilder]: At program point L667-1(line 667) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse2 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (or .cse0 (let ((.cse1 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|))) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_~i#1| 1) (= |#memory_int| |old(#memory_int)|) (<= 2 (select .cse1 12)) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| (+ |ldv_kobject_put_ldv_atomic_sub_return_~i#1| 2147483647)) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= 2 |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|) (< (select .cse1 (+ 12 |ldv_kobject_put_~kobj#1.offset|)) 2147483649))) (not (< (select .cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) 2147483649)) (not (<= 2 (select .cse2 12))))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-11-25 23:20:24,924 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-25 23:20:24,925 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (or (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)) (= |#memory_int| |old(#memory_int)|) (not (< (select .cse0 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) 2147483649)) (not (<= 2 (select .cse0 12))))) [2022-11-25 23:20:24,925 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-25 23:20:24,925 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-25 23:20:24,925 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-25 23:20:24,925 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-25 23:20:24,929 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:20:24,931 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:20:24,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:20:24 BoogieIcfgContainer [2022-11-25 23:20:24,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:20:24,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:20:24,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:20:24,956 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:20:24,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:20:08" (3/4) ... [2022-11-25 23:20:24,959 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:20:24,965 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-25 23:20:24,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-25 23:20:24,966 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-25 23:20:24,972 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-25 23:20:24,972 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-25 23:20:24,973 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:20:24,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (0 == \result && \result == 0) [2022-11-25 23:20:24,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) || ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[kobj][kobj + 12] < 2147483649) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && kobj == 0) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && (!(kobj == 0) || !(kobj == 0))) [2022-11-25 23:20:25,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && temp <= 1) && 0 == \result) && kobj == kobj) && i <= 1) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && (!(kobj == 0) || !(kobj == 0)) [2022-11-25 23:20:25,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(kobj == 0) || ((((((i <= 1 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 2 <= unknown-#memory_int-unknown[kobj][12]) && temp <= i + 2147483647) && kobj == 0) && 2 <= temp) && unknown-#memory_int-unknown[kobj][12 + kobj] < 2147483649)) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] < 2147483649)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) [2022-11-25 23:20:25,025 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:20:25,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:20:25,026 INFO L158 Benchmark]: Toolchain (without parser) took 18664.18ms. Allocated memory was 199.2MB in the beginning and 295.7MB in the end (delta: 96.5MB). Free memory was 169.2MB in the beginning and 129.6MB in the end (delta: 39.6MB). Peak memory consumption was 136.6MB. Max. memory is 16.1GB. [2022-11-25 23:20:25,027 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 127.9MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:20:25,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 714.19ms. Allocated memory is still 199.2MB. Free memory was 169.2MB in the beginning and 147.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 23:20:25,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.65ms. Allocated memory is still 199.2MB. Free memory was 147.6MB in the beginning and 145.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:20:25,031 INFO L158 Benchmark]: Boogie Preprocessor took 75.27ms. Allocated memory is still 199.2MB. Free memory was 145.0MB in the beginning and 142.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:20:25,031 INFO L158 Benchmark]: RCFGBuilder took 828.17ms. Allocated memory is still 199.2MB. Free memory was 142.7MB in the beginning and 115.6MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 23:20:25,032 INFO L158 Benchmark]: TraceAbstraction took 16887.08ms. Allocated memory was 199.2MB in the beginning and 295.7MB in the end (delta: 96.5MB). Free memory was 115.2MB in the beginning and 133.8MB in the end (delta: -18.6MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2022-11-25 23:20:25,033 INFO L158 Benchmark]: Witness Printer took 70.31ms. Allocated memory is still 295.7MB. Free memory was 133.8MB in the beginning and 129.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:20:25,035 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.24ms. Allocated memory is still 127.9MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 714.19ms. Allocated memory is still 199.2MB. Free memory was 169.2MB in the beginning and 147.6MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.65ms. Allocated memory is still 199.2MB. Free memory was 147.6MB in the beginning and 145.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.27ms. Allocated memory is still 199.2MB. Free memory was 145.0MB in the beginning and 142.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 828.17ms. Allocated memory is still 199.2MB. Free memory was 142.7MB in the beginning and 115.6MB in the end (delta: 27.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16887.08ms. Allocated memory was 199.2MB in the beginning and 295.7MB in the end (delta: 96.5MB). Free memory was 115.2MB in the beginning and 133.8MB in the end (delta: -18.6MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * Witness Printer took 70.31ms. Allocated memory is still 295.7MB. Free memory was 133.8MB in the beginning and 129.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 4 procedures, 32 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 516 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 892 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 166 mSDtfsCounter, 892 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 87, 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, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 29 PreInvPairs, 41 NumberOfFragments, 616 HoareAnnotationTreeSize, 29 FomulaSimplifications, 115 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 1054 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 272 ConstructedInterpolants, 3 QuantifiedInterpolants, 1178 SizeOfPredicates, 189 NumberOfNonLiveVariables, 1003 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 6/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (0 == \result && \result == 0) - InvariantResult [Line: 667]: Loop Invariant Derived loop invariant: (((!(kobj == 0) || ((((((i <= 1 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && 2 <= unknown-#memory_int-unknown[kobj][12]) && temp <= i + 2147483647) && kobj == 0) && 2 <= temp) && unknown-#memory_int-unknown[kobj][12 + kobj] < 2147483649)) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] < 2147483649)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: (((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 659]: Loop Invariant Derived loop invariant: ((((((((((((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && temp <= 1) && 0 == \result) && kobj == kobj) && i <= 1) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12]) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: (((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) || ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && unknown-#memory_int-unknown[kobj][kobj + 12] < 2147483649) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && kobj == 0) && 2 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && (!(kobj == 0) || !(kobj == 0))) RESULT: Ultimate proved your program to be correct! [2022-11-25 23:20:25,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_009e4ffd-a2b2-4dc6-a7e6-4ab73afc3626/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE