./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 01:19:51,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:19:51,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:19:51,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:19:51,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:19:51,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:19:51,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:19:51,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:19:51,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:19:51,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:19:51,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:19:51,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:19:51,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:19:51,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:19:51,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:19:51,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:19:51,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:19:51,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:19:51,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:19:51,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:19:51,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:19:51,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:19:51,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:19:51,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:19:51,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:19:51,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:19:51,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:19:51,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:19:51,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:19:51,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:19:51,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:19:51,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:19:51,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:19:51,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:19:51,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:19:51,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:19:51,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:19:51,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:19:51,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:19:51,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:19:51,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:19:51,548 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:19:51,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:19:51,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:19:51,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:19:51,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:19:51,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:19:51,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:19:51,589 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:19:51,589 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:19:51,589 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:19:51,589 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:19:51,590 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:19:51,590 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:19:51,591 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:19:51,591 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:19:51,591 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:19:51,591 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:19:51,591 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:19:51,591 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:19:51,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:19:51,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:19:51,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:19:51,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:19:51,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:19:51,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:19:51,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:19:51,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:19:51,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:19:51,595 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:19:51,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:19:51,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:19:51,595 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:19:51,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:19:51,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:19:51,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:19:51,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:19:51,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:19:51,597 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:19:51,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:19:51,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:19:51,597 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:19:51,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:19:51,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:19:51,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:19:51,599 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_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11cd0b9da22b48a523bf90b6f5cbc98a0e4e6a8f70a83fae3d817f12f25f212c [2022-11-22 01:19:51,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:19:51,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:19:51,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:19:51,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:19:51,888 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:19:51,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2022-11-22 01:19:54,884 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:19:55,280 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:19:55,283 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-2.i [2022-11-22 01:19:55,296 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/data/96e94a521/33db64e1a93241978b6d53d3a37a65d6/FLAG1aa35077d [2022-11-22 01:19:55,315 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/data/96e94a521/33db64e1a93241978b6d53d3a37a65d6 [2022-11-22 01:19:55,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:19:55,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:19:55,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:19:55,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:19:55,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:19:55,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:19:55" (1/1) ... [2022-11-22 01:19:55,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b74979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:55, skipping insertion in model container [2022-11-22 01:19:55,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:19:55" (1/1) ... [2022-11-22 01:19:55,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:19:55,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:19:55,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:19:55,855 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:19:55,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:19:56,012 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:19:56,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56 WrapperNode [2022-11-22 01:19:56,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:19:56,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:19:56,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:19:56,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:19:56,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,097 INFO L138 Inliner]: procedures = 164, calls = 69, calls flagged for inlining = 23, calls inlined = 15, statements flattened = 97 [2022-11-22 01:19:56,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:19:56,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:19:56,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:19:56,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:19:56,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,159 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:19:56,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:19:56,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:19:56,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:19:56,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (1/1) ... [2022-11-22 01:19:56,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:19:56,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:19:56,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:19:56,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:19:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 01:19:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-22 01:19:56,272 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-22 01:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-22 01:19:56,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-22 01:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 01:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 01:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 01:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 01:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 01:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-22 01:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:19:56,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:19:56,445 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:19:56,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:19:56,747 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:19:56,910 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:19:56,910 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 01:19:56,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:19:56 BoogieIcfgContainer [2022-11-22 01:19:56,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:19:56,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:19:56,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:19:56,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:19:56,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:19:55" (1/3) ... [2022-11-22 01:19:56,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed2644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:19:56, skipping insertion in model container [2022-11-22 01:19:56,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:19:56" (2/3) ... [2022-11-22 01:19:56,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed2644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:19:56, skipping insertion in model container [2022-11-22 01:19:56,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:19:56" (3/3) ... [2022-11-22 01:19:56,933 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-2.i [2022-11-22 01:19:56,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:19:56,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 01:19:57,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:19:57,013 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;@6132b3e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:19:57,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-22 01:19:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:19:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 01:19:57,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:19:57,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:19:57,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-22 01:19:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:19:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1117026391, now seen corresponding path program 1 times [2022-11-22 01:19:57,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:19:57,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135038207] [2022-11-22 01:19:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:19:57,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:19:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:19:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:57,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:19:57,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135038207] [2022-11-22 01:19:57,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135038207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:19:57,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:19:57,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:19:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670693611] [2022-11-22 01:19:57,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:19:57,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:19:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:19:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:19:57,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:19:57,569 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:19:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:19:57,716 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-11-22 01:19:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:19:57,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-11-22 01:19:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:19:57,730 INFO L225 Difference]: With dead ends: 34 [2022-11-22 01:19:57,730 INFO L226 Difference]: Without dead ends: 20 [2022-11-22 01:19:57,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:19:57,737 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:19:57,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:19:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-22 01:19:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-22 01:19:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:19:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-22 01:19:57,786 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2022-11-22 01:19:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:19:57,787 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-22 01:19:57,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:19:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-22 01:19:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 01:19:57,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:19:57,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:19:57,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:19:57,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-22 01:19:57,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:19:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1148230231, now seen corresponding path program 1 times [2022-11-22 01:19:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:19:57,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598514879] [2022-11-22 01:19:57,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:19:57,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:19:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:19:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:58,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:19:58,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598514879] [2022-11-22 01:19:58,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598514879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:19:58,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:19:58,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:19:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560027562] [2022-11-22 01:19:58,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:19:58,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:19:58,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:19:58,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:19:58,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:19:58,109 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:19:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:19:58,256 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-11-22 01:19:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:19:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-22 01:19:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:19:58,258 INFO L225 Difference]: With dead ends: 27 [2022-11-22 01:19:58,258 INFO L226 Difference]: Without dead ends: 20 [2022-11-22 01:19:58,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-22 01:19:58,260 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:19:58,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:19:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-22 01:19:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-22 01:19:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:19:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-22 01:19:58,268 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-11-22 01:19:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:19:58,269 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-22 01:19:58,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:19:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-22 01:19:58,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:19:58,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:19:58,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:19:58,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:19:58,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-22 01:19:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:19:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1841290002, now seen corresponding path program 1 times [2022-11-22 01:19:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:19:58,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047635503] [2022-11-22 01:19:58,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:19:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:19:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:19:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:58,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:19:58,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047635503] [2022-11-22 01:19:58,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047635503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:19:58,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:19:58,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:19:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380786645] [2022-11-22 01:19:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:19:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:19:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:19:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:19:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:19:58,423 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:19:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:19:58,507 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-11-22 01:19:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 01:19:58,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-22 01:19:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:19:58,510 INFO L225 Difference]: With dead ends: 28 [2022-11-22 01:19:58,510 INFO L226 Difference]: Without dead ends: 20 [2022-11-22 01:19:58,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:19:58,516 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:19:58,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 25 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:19:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-22 01:19:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-22 01:19:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:19:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-11-22 01:19:58,527 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2022-11-22 01:19:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:19:58,527 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-11-22 01:19:58,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-22 01:19:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-11-22 01:19:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 01:19:58,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:19:58,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:19:58,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:19:58,530 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-22 01:19:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:19:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1301558156, now seen corresponding path program 1 times [2022-11-22 01:19:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:19:58,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026282169] [2022-11-22 01:19:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:19:58,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:19:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:19:58,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:58,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:19:58,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026282169] [2022-11-22 01:19:58,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026282169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:19:58,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:19:58,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:19:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584666892] [2022-11-22 01:19:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:19:58,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:19:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:19:58,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:19:58,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:19:58,770 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:19:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:19:58,809 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-11-22 01:19:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:19:58,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-11-22 01:19:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:19:58,811 INFO L225 Difference]: With dead ends: 34 [2022-11-22 01:19:58,811 INFO L226 Difference]: Without dead ends: 21 [2022-11-22 01:19:58,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:19:58,823 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:19:58,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:19:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-22 01:19:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-22 01:19:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:19:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-11-22 01:19:58,831 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2022-11-22 01:19:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:19:58,831 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-11-22 01:19:58,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:19:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-11-22 01:19:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 01:19:58,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:19:58,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:19:58,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:19:58,833 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-22 01:19:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:19:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1559633259, now seen corresponding path program 1 times [2022-11-22 01:19:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:19:58,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445676455] [2022-11-22 01:19:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:19:58,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:19:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:19:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:59,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:19:59,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445676455] [2022-11-22 01:19:59,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445676455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:19:59,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615465762] [2022-11-22 01:19:59,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:19:59,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:19:59,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:19:59,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:19:59,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:19:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:19:59,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-22 01:19:59,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:19:59,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:19:59,676 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_80 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_77 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_80) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_77)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-22 01:19:59,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:19:59,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:19:59,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-22 01:19:59,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 01:19:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:19:59,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:20:00,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615465762] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:20:00,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1228929432] [2022-11-22 01:20:00,111 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-22 01:20:00,111 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:20:00,115 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:20:00,121 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:20:00,121 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:20:00,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-22 01:20:00,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:20:00,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:20:00,351 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-22 01:20:00,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 132 [2022-11-22 01:20:00,367 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:20:00,382 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 01:20:00,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2022-11-22 01:20:00,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-22 01:20:00,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-22 01:20:00,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-22 01:20:00,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-22 01:20:00,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:20:00,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:20:00,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:20:00,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:00,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-22 01:20:00,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:00,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-22 01:20:00,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:00,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-22 01:20:00,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 01:20:01,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 01:20:01,380 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-22 01:20:01,394 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-22 01:20:01,422 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:20:06,057 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '440#(and (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 0 |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base|) (<= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| 12) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (<= 16 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (not (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| 0)) (<= 0 |~#ldv_global_msg_list~0.offset|) (<= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| 12) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~kref#1.offset| |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_atomic_sub_return_~i#1| |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_put_#in~release#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset| 0) (= (+ |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| 12) |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (<= 12 |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (<= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (<= 0 |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset|) (= |#funAddr~ldv_kobject_release.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| |ULTIMATE.start_ldv_kref_sub_~count#1|) (<= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (<= |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| (+ 2147483647 |ULTIMATE.start_ldv_atomic_sub_return_~i#1|))) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kref_put_#in~kref#1.base|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset| |ULTIMATE.start_ldv_kref_sub_~release#1.offset|) (<= |~#ldv_global_msg_list~0.base| 1) (<= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| 0) (<= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| 0) (= |ULTIMATE.start_ldv_kref_sub_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (<= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (<= 12 |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1|) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (<= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset| 0) (<= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| 0) (<= 1 |~#ldv_global_msg_list~0.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#value#1|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| 1) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_put_~kref#1.offset|) (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (= |ULTIMATE.start_ldv_kref_put_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (= (ite (<= (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296) 2147483647) (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296) (+ (- 4294967296) (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296))) |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |#NULL.base| 0))' at error location [2022-11-22 01:20:06,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:20:06,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:20:06,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15] total 18 [2022-11-22 01:20:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385381991] [2022-11-22 01:20:06,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:20:06,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-22 01:20:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:20:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-22 01:20:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1272, Unknown=1, NotChecked=72, Total=1482 [2022-11-22 01:20:06,060 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 18 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 01:20:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:20:06,497 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-11-22 01:20:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 01:20:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2022-11-22 01:20:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:20:06,498 INFO L225 Difference]: With dead ends: 34 [2022-11-22 01:20:06,498 INFO L226 Difference]: Without dead ends: 21 [2022-11-22 01:20:06,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=200, Invalid=1873, Unknown=1, NotChecked=88, Total=2162 [2022-11-22 01:20:06,500 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:20:06,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 185 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-11-22 01:20:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-22 01:20:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-22 01:20:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-22 01:20:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-11-22 01:20:06,506 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2022-11-22 01:20:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:20:06,506 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-11-22 01:20:06,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-22 01:20:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-11-22 01:20:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 01:20:06,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:20:06,507 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:20:06,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:20:06,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:20:06,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-11-22 01:20:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:20:06,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1929871228, now seen corresponding path program 1 times [2022-11-22 01:20:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:20:06,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162039576] [2022-11-22 01:20:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:20:06,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:20:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:20:06,914 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-22 01:20:06,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:20:06,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162039576] [2022-11-22 01:20:06,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162039576] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:20:06,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104937168] [2022-11-22 01:20:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:20:06,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:20:06,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:20:06,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:20:06,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:20:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:20:07,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-22 01:20:07,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:20:07,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 01:20:07,177 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_153 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_151 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_151) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_153)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-22 01:20:07,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:07,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:07,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-22 01:20:07,282 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-22 01:20:07,304 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-22 01:20:07,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:20:09,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104937168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:20:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453508227] [2022-11-22 01:20:09,203 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-22 01:20:09,203 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:20:09,203 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:20:09,203 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:20:09,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:20:09,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-22 01:20:09,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 01:20:09,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-22 01:20:09,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:20:09,369 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2022-11-22 01:20:09,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 132 [2022-11-22 01:20:09,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 01:20:09,402 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 01:20:09,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2022-11-22 01:20:09,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-22 01:20:09,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-22 01:20:09,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-22 01:20:09,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:20:09,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 01:20:09,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 01:20:09,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:09,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-22 01:20:09,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:09,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-22 01:20:09,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 01:20:09,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-22 01:20:09,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 01:20:09,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-22 01:20:10,268 INFO L197 IcfgInterpreter]: Interpreting procedure LDV_INIT_LIST_HEAD with input of size 33 for LOIs [2022-11-22 01:20:10,281 INFO L197 IcfgInterpreter]: Interpreting procedure ldv_malloc with input of size 43 for LOIs [2022-11-22 01:20:10,314 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:20:15,568 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '653#(and (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 0 |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_~kref#1.base| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base|) (<= |ULTIMATE.start_ldv_kref_init_~kref#1.offset| 12) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1|) (= |ULTIMATE.start_ldv_kref_put_#in~release#1.offset| |#funAddr~ldv_kobject_release.offset|) (<= 16 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (not (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| 0)) (<= 0 |~#ldv_global_msg_list~0.offset|) (<= |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset| 12) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset|) (= |ULTIMATE.start_ldv_kref_put_~kref#1.offset| |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (= |ULTIMATE.start_ldv_atomic_sub_return_~i#1| |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset| |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#value#1| 0) (= |ULTIMATE.start_ldv_kref_put_~release#1.offset| |ULTIMATE.start_ldv_kref_put_#in~release#1.offset|) (<= |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset| 0) (= (+ |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| 12) |ULTIMATE.start_ldv_kref_put_#in~kref#1.offset|) (<= 12 |ULTIMATE.start_ldv_kref_init_#in~kref#1.offset|) (<= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 16) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (<= 0 |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset|) (= |#funAddr~ldv_kobject_release.base| |ULTIMATE.start_ldv_kref_put_#in~release#1.base|) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| |ULTIMATE.start_ldv_kref_sub_~count#1|) (<= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.base| |ULTIMATE.start_ldv_kref_put_#in~kref#1.base|) (<= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_sub_~kref#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~release#1.offset| |ULTIMATE.start_ldv_kref_sub_~release#1.offset|) (<= |~#ldv_global_msg_list~0.base| 1) (<= |ULTIMATE.start_ldv_kobject_init_#in~kobj#1.offset| 0) (<= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| 0) (= |ULTIMATE.start_ldv_kref_sub_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.base|) (< (+ |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| 2147483648) |ULTIMATE.start_ldv_atomic_sub_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (<= |~#ldv_global_msg_list~0.offset| 0) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (<= 12 |ULTIMATE.start_ldv_kref_init_~kref#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_sub_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1|) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.base| |ULTIMATE.start_ldv_kref_sub_~kref#1.base|) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (<= |ULTIMATE.start_ldv_kobject_init_internal_#in~kobj#1.offset| 0) (<= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| 0) (<= 1 |~#ldv_global_msg_list~0.base|) (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#res#1.offset|) (<= 0 |ULTIMATE.start_#Ultimate.C_memset_#value#1|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset| |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kref_sub_#in~count#1| 1) (= |ULTIMATE.start_ldv_kref_sub_#in~kref#1.offset| |ULTIMATE.start_ldv_kref_put_~kref#1.offset|) (<= 0 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_put_#in~kobj#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_ldv_kref_put_~release#1.base| |ULTIMATE.start_ldv_kref_sub_#in~release#1.base|) (= |ULTIMATE.start_ldv_atomic_sub_return_#in~v#1.base| |ULTIMATE.start_ldv_atomic_sub_return_~v#1.base|) (= |ULTIMATE.start_ldv_kref_put_#in~kref#1.base| |ULTIMATE.start_ldv_kref_put_~kref#1.base|) (= (ite (<= (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296) 2147483647) (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296) (+ (- 4294967296) (mod |ULTIMATE.start_ldv_kref_sub_~count#1| 4294967296))) |ULTIMATE.start_ldv_atomic_sub_return_#in~i#1|) (= |#NULL.base| 0))' at error location [2022-11-22 01:20:15,568 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:20:15,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-22 01:20:15,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 15 [2022-11-22 01:20:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712911684] [2022-11-22 01:20:15,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-22 01:20:15,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-22 01:20:15,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:20:15,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-22 01:20:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1139, Unknown=1, NotChecked=68, Total=1332 [2022-11-22 01:20:15,571 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:20:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:20:15,885 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-11-22 01:20:15,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 01:20:15,887 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 20 [2022-11-22 01:20:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:20:15,887 INFO L225 Difference]: With dead ends: 33 [2022-11-22 01:20:15,887 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 01:20:15,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=167, Invalid=1476, Unknown=1, NotChecked=78, Total=1722 [2022-11-22 01:20:15,889 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:20:15,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 32 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-11-22 01:20:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 01:20:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 01:20:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:20:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 01:20:15,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-11-22 01:20:15,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:20:15,891 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 01:20:15,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-22 01:20:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 01:20:15,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 01:20:15,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2022-11-22 01:20:15,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2022-11-22 01:20:15,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 01:20:16,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:20:16,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 01:20:16,436 INFO L902 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: true [2022-11-22 01:20:16,437 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-22 01:20:16,437 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-22 01:20:16,437 INFO L895 garLoopResultBuilder]: At program point L667-1(line 667) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ldv_kobject_put_~kobj#1.base|)) (.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 |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|))) (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|) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (<= 1 |ULTIMATE.start_ldv_atomic_sub_return_~i#1|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (<= |ULTIMATE.start_ldv_atomic_sub_return_~i#1| 1) (<= (select .cse1 12) 1) (<= 1 (select .cse1 (+ |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| 12))) (<= (select .cse2 12) 1) (<= 1 .cse0) (<= 1 |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1|) (<= 1 (select .cse2 (+ 12 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (= |ULTIMATE.start_ldv_kobject_put_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= |ULTIMATE.start_ldv_atomic_sub_return_~temp~1#1| 1) (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-22 01:20:16,437 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 |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|))) (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|) (<= (select .cse2 12) 1) (<= 1 .cse0) (<= 1 (select .cse2 (+ 12 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (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-22 01:20:16,438 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-22 01:20:16,438 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 714) no Hoare annotation was computed. [2022-11-22 01:20:16,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-22 01:20:16,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 01:20:16,438 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-22 01:20:16,438 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-22 01:20:16,438 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-22 01:20:16,439 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-22 01:20:16,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-22 01:20:16,439 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 01:20:16,439 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (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|)))) (and (<= .cse0 1) .cse1 .cse2 .cse3 (<= 1 .cse0) (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 .cse2 .cse3 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)))) [2022-11-22 01:20:16,440 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-22 01:20:16,440 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-22 01:20:16,440 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-22 01:20:16,440 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-22 01:20:16,440 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-11-22 01:20:16,440 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-22 01:20:16,444 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-22 01:20:16,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:20:16,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:20:16 BoogieIcfgContainer [2022-11-22 01:20:16,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:20:16,483 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:20:16,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:20:16,484 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:20:16,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:19:56" (3/4) ... [2022-11-22 01:20:16,487 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 01:20:16,492 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-22 01:20:16,493 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-22 01:20:16,503 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-11-22 01:20:16,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-22 01:20:16,504 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-22 01:20:16,531 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 + \result]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (0 == \result && \result == 0) [2022-11-22 01:20:16,533 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && 1 <= i) && kobj == kobj) && i <= 1) && unknown-#memory_int-unknown[kobj][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= temp) && 1 <= unknown-#memory_int-unknown[\result][12 + \result]) && kobj == 0) && !(kobj == 0)) && temp <= 1) && (!(kobj == 0) || !(kobj == 0)) [2022-11-22 01:20:16,559 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:20:16,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:20:16,560 INFO L158 Benchmark]: Toolchain (without parser) took 21240.59ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 104.1MB in the beginning and 140.5MB in the end (delta: -36.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2022-11-22 01:20:16,560 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 111.1MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 56.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:20:16,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.93ms. Allocated memory is still 138.4MB. Free memory was 103.8MB in the beginning and 82.8MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 01:20:16,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.38ms. Allocated memory is still 138.4MB. Free memory was 82.8MB in the beginning and 80.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:20:16,561 INFO L158 Benchmark]: Boogie Preprocessor took 67.85ms. Allocated memory is still 138.4MB. Free memory was 80.1MB in the beginning and 78.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:20:16,562 INFO L158 Benchmark]: RCFGBuilder took 746.36ms. Allocated memory is still 138.4MB. Free memory was 78.4MB in the beginning and 98.2MB in the end (delta: -19.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-11-22 01:20:16,562 INFO L158 Benchmark]: TraceAbstraction took 19567.11ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 97.6MB in the beginning and 143.6MB in the end (delta: -46.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-22 01:20:16,563 INFO L158 Benchmark]: Witness Printer took 76.30ms. Allocated memory is still 209.7MB. Free memory was 143.6MB in the beginning and 140.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 01:20:16,566 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.26ms. Allocated memory is still 111.1MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 56.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.93ms. Allocated memory is still 138.4MB. Free memory was 103.8MB in the beginning and 82.8MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.38ms. Allocated memory is still 138.4MB. Free memory was 82.8MB in the beginning and 80.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.85ms. Allocated memory is still 138.4MB. Free memory was 80.1MB in the beginning and 78.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 746.36ms. Allocated memory is still 138.4MB. Free memory was 78.4MB in the beginning and 98.2MB in the end (delta: -19.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19567.11ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 97.6MB in the beginning and 143.6MB in the end (delta: -46.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 76.30ms. Allocated memory is still 209.7MB. Free memory was 143.6MB in the beginning and 140.5MB in the end (delta: 3.1MB). 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: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 38 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 67 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 49, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 23 NumberOfFragments, 302 HoareAnnotationTreeSize, 12 FomulaSimplifications, 45 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 149 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 120 ConstructedInterpolants, 2 QuantifiedInterpolants, 492 SizeOfPredicates, 87 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 0/8 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 2 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 + \result]) && !(kobj == 0)) && (!(kobj == 0) || !(kobj == 0))) || (0 == \result && \result == 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))) || (((0 == kobj && kobj == kobj) && kobj == kobj) && 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: 667]: Loop Invariant Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && 1 <= i) && kobj == kobj) && i <= 1) && unknown-#memory_int-unknown[kobj][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][kobj + 12]) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= temp) && 1 <= unknown-#memory_int-unknown[\result][12 + \result]) && kobj == 0) && !(kobj == 0)) && temp <= 1) && (!(kobj == 0) || !(kobj == 0)) RESULT: Ultimate proved your program to be correct! [2022-11-22 01:20:16,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be230d48-d44a-49fa-bca0-141858818b59/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE