./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:30:56,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:30:56,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:30:56,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:30:56,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:30:56,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:30:56,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:30:56,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:30:56,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:30:56,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:30:56,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:30:56,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:30:56,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:30:56,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:30:56,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:30:56,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:30:56,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:30:56,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:30:56,084 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:30:56,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:30:56,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:30:56,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:30:56,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:30:56,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:30:56,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:30:56,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:30:56,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:30:56,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:30:56,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:30:56,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:30:56,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:30:56,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:30:56,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:30:56,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:30:56,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:30:56,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:30:56,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:30:56,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:30:56,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:30:56,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:30:56,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:30:56,125 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 09:30:56,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:30:56,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:30:56,158 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:30:56,158 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:30:56,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:30:56,159 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:30:56,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:30:56,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:30:56,160 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:30:56,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:30:56,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:30:56,160 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:30:56,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:30:56,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:30:56,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:30:56,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:30:56,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:30:56,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:30:56,162 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 09:30:56,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:30:56,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:30:56,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:30:56,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:30:56,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:30:56,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:30:56,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:30:56,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:56,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:30:56,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:30:56,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:30:56,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:30:56,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:30:56,164 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:30:56,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:30:56,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:30:56,165 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_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/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_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2022-11-20 09:30:56,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:30:56,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:30:56,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:30:56,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:30:56,513 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:30:56,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2022-11-20 09:30:59,532 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:30:59,871 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:30:59,871 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2022-11-20 09:30:59,904 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/data/c0992b056/ded6fc265e294660970619c344c431ae/FLAG9d2359177 [2022-11-20 09:30:59,918 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/data/c0992b056/ded6fc265e294660970619c344c431ae [2022-11-20 09:30:59,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:30:59,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:30:59,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:59,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:30:59,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:30:59,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:59" (1/1) ... [2022-11-20 09:30:59,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9d3c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:59, skipping insertion in model container [2022-11-20 09:30:59,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:59" (1/1) ... [2022-11-20 09:30:59,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:31:00,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:31:00,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:00,429 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:31:00,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:00,539 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:31:00,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00 WrapperNode [2022-11-20 09:31:00,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:00,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:00,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:31:00,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:31:00,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,622 INFO L138 Inliner]: procedures = 166, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 122 [2022-11-20 09:31:00,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:00,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:31:00,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:31:00,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:31:00,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,668 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:31:00,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:31:00,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:31:00,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:31:00,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (1/1) ... [2022-11-20 09:31:00,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:00,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:31:00,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:31:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:31:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-20 09:31:00,759 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-20 09:31:00,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 09:31:00,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 09:31:00,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-20 09:31:00,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-20 09:31:00,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:31:00,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 09:31:00,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:31:00,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 09:31:00,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 09:31:00,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:31:00,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 09:31:00,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:31:00,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:31:00,955 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:31:00,957 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:31:01,241 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:31:01,263 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:31:01,264 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:31:01,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:01 BoogieIcfgContainer [2022-11-20 09:31:01,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:31:01,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:31:01,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:31:01,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:31:01,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:30:59" (1/3) ... [2022-11-20 09:31:01,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2258703a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:01, skipping insertion in model container [2022-11-20 09:31:01,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:00" (2/3) ... [2022-11-20 09:31:01,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2258703a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:01, skipping insertion in model container [2022-11-20 09:31:01,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:01" (3/3) ... [2022-11-20 09:31:01,275 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2022-11-20 09:31:01,301 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:31:01,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-20 09:31:01,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:31:01,380 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=PETRI_NET, 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;@7c27f74a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:31:01,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 09:31:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 46 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 09:31:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:31:01,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:01,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:01,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:01,401 INFO L85 PathProgramCache]: Analyzing trace with hash -343294405, now seen corresponding path program 1 times [2022-11-20 09:31:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:01,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515692762] [2022-11-20 09:31:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:01,846 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-20 09:31:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:01,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515692762] [2022-11-20 09:31:01,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515692762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:01,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:01,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:31:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806800145] [2022-11-20 09:31:01,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:01,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:31:01,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:31:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:01,898 INFO L87 Difference]: Start difference. First operand has 52 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 46 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 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-20 09:31:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:02,117 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2022-11-20 09:31:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:31:02,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 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-20 09:31:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:02,132 INFO L225 Difference]: With dead ends: 116 [2022-11-20 09:31:02,132 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 09:31:02,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:02,144 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:02,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 248 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 09:31:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2022-11-20 09:31:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 09:31:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-11-20 09:31:02,198 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 12 [2022-11-20 09:31:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:02,200 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-11-20 09:31:02,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 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-20 09:31:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-11-20 09:31:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:31:02,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:02,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:02,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:31:02,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1399515930, now seen corresponding path program 1 times [2022-11-20 09:31:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505621909] [2022-11-20 09:31:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:02,376 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-20 09:31:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505621909] [2022-11-20 09:31:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505621909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:02,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:02,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:31:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403220539] [2022-11-20 09:31:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:02,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:31:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:31:02,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:02,381 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-20 09:31:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:02,473 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-20 09:31:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:31:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-20 09:31:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:02,475 INFO L225 Difference]: With dead ends: 68 [2022-11-20 09:31:02,476 INFO L226 Difference]: Without dead ends: 52 [2022-11-20 09:31:02,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:02,478 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:02,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 122 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-20 09:31:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2022-11-20 09:31:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 09:31:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-11-20 09:31:02,486 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 12 [2022-11-20 09:31:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:02,486 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-11-20 09:31:02,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-20 09:31:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-11-20 09:31:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:31:02,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:02,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:02,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:31:02,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1822469784, now seen corresponding path program 1 times [2022-11-20 09:31:02,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:02,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603167245] [2022-11-20 09:31:02,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:02,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:02,738 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-20 09:31:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:02,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603167245] [2022-11-20 09:31:02,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603167245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:02,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:02,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:31:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701749939] [2022-11-20 09:31:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:02,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:31:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:31:02,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:31:02,746 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-20 09:31:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:02,896 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2022-11-20 09:31:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2022-11-20 09:31:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:02,900 INFO L225 Difference]: With dead ends: 83 [2022-11-20 09:31:02,901 INFO L226 Difference]: Without dead ends: 64 [2022-11-20 09:31:02,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:31:02,904 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 48 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:02,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 231 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-20 09:31:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2022-11-20 09:31:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 09:31:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-20 09:31:02,926 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 16 [2022-11-20 09:31:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:02,927 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-20 09:31:02,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-20 09:31:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-20 09:31:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:31:02,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:02,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:02,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:31:02,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:02,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:02,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1693387065, now seen corresponding path program 1 times [2022-11-20 09:31:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:02,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698042997] [2022-11-20 09:31:02,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:02,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,097 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-20 09:31:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:03,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698042997] [2022-11-20 09:31:03,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698042997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:03,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:03,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:31:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375794049] [2022-11-20 09:31:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:03,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:31:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:31:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:03,100 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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-20 09:31:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:03,193 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-11-20 09:31:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:31:03,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2022-11-20 09:31:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:03,195 INFO L225 Difference]: With dead ends: 77 [2022-11-20 09:31:03,195 INFO L226 Difference]: Without dead ends: 48 [2022-11-20 09:31:03,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:31:03,196 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:03,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 152 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-20 09:31:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-11-20 09:31:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 09:31:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-20 09:31:03,201 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 16 [2022-11-20 09:31:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:03,202 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-20 09:31:03,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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-20 09:31:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-20 09:31:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:31:03,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:03,203 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-20 09:31:03,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:31:03,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash 308286168, now seen corresponding path program 1 times [2022-11-20 09:31:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:03,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960149113] [2022-11-20 09:31:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:31:03,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:03,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960149113] [2022-11-20 09:31:03,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960149113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:03,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:03,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:31:03,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617598105] [2022-11-20 09:31:03,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:03,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:31:03,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:03,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:31:03,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:31:03,328 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 09:31:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:03,438 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-11-20 09:31:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:31:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-20 09:31:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:03,439 INFO L225 Difference]: With dead ends: 54 [2022-11-20 09:31:03,439 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 09:31:03,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:31:03,441 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:03,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 189 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 09:31:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-20 09:31:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.206896551724138) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-11-20 09:31:03,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 18 [2022-11-20 09:31:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:03,450 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-11-20 09:31:03,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 09:31:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-11-20 09:31:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:31:03,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:03,452 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-20 09:31:03,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:31:03,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:03,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1857826031, now seen corresponding path program 1 times [2022-11-20 09:31:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:03,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381827084] [2022-11-20 09:31:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,568 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-20 09:31:03,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:03,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381827084] [2022-11-20 09:31:03,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381827084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:03,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:03,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:31:03,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398948644] [2022-11-20 09:31:03,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:03,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:31:03,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:03,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:31:03,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:31:03,571 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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-20 09:31:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:03,670 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-11-20 09:31:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:31:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2022-11-20 09:31:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:03,671 INFO L225 Difference]: With dead ends: 58 [2022-11-20 09:31:03,671 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 09:31:03,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:31:03,672 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:03,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 110 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 09:31:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-20 09:31:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-11-20 09:31:03,678 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2022-11-20 09:31:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:03,678 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-11-20 09:31:03,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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-20 09:31:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-11-20 09:31:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 09:31:03,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:03,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:31:03,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1601348128, now seen corresponding path program 1 times [2022-11-20 09:31:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:03,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184930189] [2022-11-20 09:31:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 09:31:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:03,812 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-20 09:31:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184930189] [2022-11-20 09:31:03,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184930189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:03,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:03,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:31:03,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135859439] [2022-11-20 09:31:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:03,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:31:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:31:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:03,814 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 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-20 09:31:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:03,897 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-11-20 09:31:03,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:31:03,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 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 23 [2022-11-20 09:31:03,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:03,899 INFO L225 Difference]: With dead ends: 67 [2022-11-20 09:31:03,899 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 09:31:03,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:03,900 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:03,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 09:31:03,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-20 09:31:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-11-20 09:31:03,912 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 23 [2022-11-20 09:31:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:03,913 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-11-20 09:31:03,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 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-20 09:31:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-11-20 09:31:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 09:31:03,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:03,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:31:03,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1587991763, now seen corresponding path program 1 times [2022-11-20 09:31:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:03,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354908548] [2022-11-20 09:31:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:03,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 09:31:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:04,138 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-20 09:31:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:04,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354908548] [2022-11-20 09:31:04,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354908548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:04,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912345413] [2022-11-20 09:31:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:04,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:04,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:04,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:04,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:31:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:04,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 09:31:04,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:04,443 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-20 09:31:04,533 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_108 Int) (v_ArrVal_107 Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_107) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_108)) |c_#memory_int|))) is different from true [2022-11-20 09:31:04,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:04,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:04,612 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-20 09:31:04,732 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-20 09:31:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:31:04,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:04,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912345413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:04,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:31:04,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-20 09:31:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830701418] [2022-11-20 09:31:04,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:04,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:31:04,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:31:04,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-20 09:31:04,753 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:05,012 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-11-20 09:31:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:31:05,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-20 09:31:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:05,013 INFO L225 Difference]: With dead ends: 43 [2022-11-20 09:31:05,013 INFO L226 Difference]: Without dead ends: 42 [2022-11-20 09:31:05,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-11-20 09:31:05,014 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:05,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 133 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-11-20 09:31:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-20 09:31:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-11-20 09:31:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-11-20 09:31:05,021 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 24 [2022-11-20 09:31:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:05,021 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-11-20 09:31:05,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-11-20 09:31:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 09:31:05,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:05,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:05,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:05,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:05,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1983104317, now seen corresponding path program 1 times [2022-11-20 09:31:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036184336] [2022-11-20 09:31:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:05,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:05,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 09:31:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:05,458 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-20 09:31:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:05,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036184336] [2022-11-20 09:31:05,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036184336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:05,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846681511] [2022-11-20 09:31:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:05,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:05,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:31:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:05,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 09:31:05,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:05,717 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-20 09:31:05,793 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_172 Int) (v_ArrVal_171 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_171) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_172)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-20 09:31:05,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:05,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:05,832 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-20 09:31:05,925 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-20 09:31:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:31:05,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:05,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846681511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:05,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:31:05,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-20 09:31:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256250064] [2022-11-20 09:31:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:05,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:31:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:31:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-20 09:31:05,954 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:06,214 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-11-20 09:31:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:31:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-20 09:31:06,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:06,215 INFO L225 Difference]: With dead ends: 42 [2022-11-20 09:31:06,215 INFO L226 Difference]: Without dead ends: 41 [2022-11-20 09:31:06,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-11-20 09:31:06,216 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:06,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 138 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-11-20 09:31:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-20 09:31:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-11-20 09:31:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-11-20 09:31:06,223 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 25 [2022-11-20 09:31:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:06,223 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-11-20 09:31:06,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-11-20 09:31:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 09:31:06,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:06,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:06,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:06,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:06,431 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 833927339, now seen corresponding path program 1 times [2022-11-20 09:31:06,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:06,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067924812] [2022-11-20 09:31:06,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 09:31:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:31:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:06,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067924812] [2022-11-20 09:31:06,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067924812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:06,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:06,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:31:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701870035] [2022-11-20 09:31:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:06,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:31:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:31:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:31:06,628 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:06,789 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-11-20 09:31:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:31:06,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-20 09:31:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:06,791 INFO L225 Difference]: With dead ends: 47 [2022-11-20 09:31:06,791 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 09:31:06,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:31:06,792 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:06,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 100 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:06,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 09:31:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-20 09:31:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-11-20 09:31:06,807 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 30 [2022-11-20 09:31:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:06,808 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-11-20 09:31:06,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-11-20 09:31:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 09:31:06,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:06,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:06,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:31:06,811 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash -719443855, now seen corresponding path program 1 times [2022-11-20 09:31:06,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:06,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591394619] [2022-11-20 09:31:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:07,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 09:31:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:07,063 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-20 09:31:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591394619] [2022-11-20 09:31:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591394619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188678795] [2022-11-20 09:31:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:07,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:07,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:07,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:07,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:31:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:07,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 142 conjunts are in the unsatisfiable core [2022-11-20 09:31:07,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:07,391 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-20 09:31:07,469 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_286 Int) (v_ArrVal_285 Int) (LDV_INIT_LIST_HEAD_~list.offset Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_285) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_286))))) is different from true [2022-11-20 09:31:07,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:07,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:07,503 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-20 09:31:07,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:31:07,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:31:07,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-11-20 09:31:07,815 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-20 09:31:07,839 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-20 09:31:07,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:10,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188678795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:10,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:31:10,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2022-11-20 09:31:10,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847679716] [2022-11-20 09:31:10,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:10,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 09:31:10,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 09:31:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=904, Unknown=2, NotChecked=60, Total=1056 [2022-11-20 09:31:10,333 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 09:31:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:19,184 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-11-20 09:31:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:31:19,185 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-11-20 09:31:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:19,185 INFO L225 Difference]: With dead ends: 63 [2022-11-20 09:31:19,186 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 09:31:19,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=204, Invalid=1863, Unknown=7, NotChecked=88, Total=2162 [2022-11-20 09:31:19,187 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:19,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 333 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2022-11-20 09:31:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 09:31:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-20 09:31:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 09:31:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-11-20 09:31:19,194 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2022-11-20 09:31:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:19,194 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-11-20 09:31:19,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 09:31:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-11-20 09:31:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 09:31:19,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:19,196 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:19,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:19,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 09:31:19,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 09:31:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1565572184, now seen corresponding path program 1 times [2022-11-20 09:31:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:19,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489541531] [2022-11-20 09:31:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:31:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 09:31:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:19,670 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-20 09:31:19,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:19,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489541531] [2022-11-20 09:31:19,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489541531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:19,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048070503] [2022-11-20 09:31:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:19,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:19,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:19,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:31:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:19,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-20 09:31:19,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:20,012 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-20 09:31:20,094 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_387 Int) (v_ArrVal_385 Int) (LDV_INIT_LIST_HEAD_~list.offset Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_385) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_387)) |c_#memory_int|))) is different from true [2022-11-20 09:31:20,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:20,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:20,119 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-20 09:31:20,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:31:20,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:31:20,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-11-20 09:31:20,451 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-20 09:31:20,484 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-20 09:31:20,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:21,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048070503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:21,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:31:21,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 25 [2022-11-20 09:31:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365124406] [2022-11-20 09:31:21,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:21,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 09:31:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 09:31:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=963, Unknown=1, NotChecked=62, Total=1122 [2022-11-20 09:31:21,012 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 25 states, 25 states have (on average 2.4) internal successors, (60), 20 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 09:31:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:22,204 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-11-20 09:31:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 09:31:22,205 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 20 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-11-20 09:31:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:22,205 INFO L225 Difference]: With dead ends: 62 [2022-11-20 09:31:22,205 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 09:31:22,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=1857, Unknown=2, NotChecked=88, Total=2162 [2022-11-20 09:31:22,207 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 73 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:22,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 142 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 356 Invalid, 0 Unknown, 34 Unchecked, 0.3s Time] [2022-11-20 09:31:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 09:31:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 09:31:22,207 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-20 09:31:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 09:31:22,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-11-20 09:31:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:22,208 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 09:31:22,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.4) internal successors, (60), 20 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 09:31:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 09:31:22,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 09:31:22,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-20 09:31:22,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-20 09:31:22,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-20 09:31:22,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-20 09:31:22,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:22,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:22,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 09:31:23,037 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-20 09:31:23,037 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-11-20 09:31:23,037 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-11-20 09:31:23,037 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-20 09:31:23,037 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse5 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse4 1) .cse0 (not .cse2) .cse1 (<= .cse5 1) (<= 1 .cse4) (<= 1 .cse5) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse3) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)))))) [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 09:31:23,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-20 09:31:23,039 INFO L895 garLoopResultBuilder]: At program point L767(line 767) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse1) (<= .cse2 2) .cse3 (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 .cse2))) (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse3 .cse1))) [2022-11-20 09:31:23,039 INFO L899 garLoopResultBuilder]: For program point L767-1(lines 763 768) no Hoare annotation was computed. [2022-11-20 09:31:23,039 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 09:31:23,039 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-20 09:31:23,039 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 09:31:23,039 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-11-20 09:31:23,039 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-20 09:31:23,039 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_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-11-20 09:31:23,039 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|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)))) [2022-11-20 09:31:23,039 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-20 09:31:23,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 09:31:23,040 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)))) [2022-11-20 09:31:23,040 INFO L895 garLoopResultBuilder]: At program point L661(lines 655 662) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (<= .cse0 2) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0) (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 .cse0))) [2022-11-20 09:31:23,040 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-20 09:31:23,040 INFO L895 garLoopResultBuilder]: At program point L719(lines 715 720) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse1) (<= .cse2 2) .cse3 (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 .cse2))) (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse3 .cse1))) [2022-11-20 09:31:23,040 INFO L899 garLoopResultBuilder]: For program point L769(lines 769 771) no Hoare annotation was computed. [2022-11-20 09:31:23,040 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 759) no Hoare annotation was computed. [2022-11-20 09:31:23,041 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-20 09:31:23,041 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-20 09:31:23,041 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2022-11-20 09:31:23,041 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-11-20 09:31:23,041 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-20 09:31:23,041 INFO L895 garLoopResultBuilder]: At program point L669(lines 663 670) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse2 (= |old(#valid)| |#valid|))) (and (let ((.cse0 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (or (not (<= .cse0 2)) .cse1 (not (<= 2 .cse0)) .cse2)) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse2))) [2022-11-20 09:31:23,041 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-20 09:31:23,041 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-11-20 09:31:23,041 INFO L902 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: true [2022-11-20 09:31:23,041 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse2 (= |old(#valid)| |#valid|))) (and (let ((.cse0 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (or (not (<= .cse0 2)) .cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse2) (not (<= 2 .cse0)))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse2))) [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L902 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: true [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-11-20 09:31:23,042 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-20 09:31:23,048 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:23,050 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:31:23,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:31:23 BoogieIcfgContainer [2022-11-20 09:31:23,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:31:23,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:31:23,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:31:23,094 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:31:23,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:01" (3/4) ... [2022-11-20 09:31:23,100 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 09:31:23,106 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 09:31:23,107 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-20 09:31:23,107 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-20 09:31:23,115 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2022-11-20 09:31:23,116 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-20 09:31:23,116 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 09:31:23,145 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) || (((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 0 == \result) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && !(\result == 0)) && !(kobj == 0)) [2022-11-20 09:31:23,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(kobj == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12]) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) [2022-11-20 09:31:23,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(kobj == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12] [2022-11-20 09:31:23,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || \old(\valid) == \valid) && ((!(kobj == 0) || !(kobj == 0)) || \old(\valid) == \valid) [2022-11-20 09:31:23,182 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:31:23,182 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:31:23,183 INFO L158 Benchmark]: Toolchain (without parser) took 23260.64ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 106.4MB in the beginning and 52.5MB in the end (delta: 53.9MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:23,183 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 138.4MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:23,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.34ms. Allocated memory is still 138.4MB. Free memory was 105.9MB in the beginning and 84.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 09:31:23,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.62ms. Allocated memory is still 138.4MB. Free memory was 84.5MB in the beginning and 81.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:23,185 INFO L158 Benchmark]: Boogie Preprocessor took 49.95ms. Allocated memory is still 138.4MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:23,186 INFO L158 Benchmark]: RCFGBuilder took 592.25ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 61.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 09:31:23,186 INFO L158 Benchmark]: TraceAbstraction took 21825.11ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 60.9MB in the beginning and 56.7MB in the end (delta: 4.3MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2022-11-20 09:31:23,186 INFO L158 Benchmark]: Witness Printer took 88.79ms. Allocated memory is still 174.1MB. Free memory was 56.7MB in the beginning and 52.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:31:23,193 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.31ms. Allocated memory is still 138.4MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.34ms. Allocated memory is still 138.4MB. Free memory was 105.9MB in the beginning and 84.5MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.62ms. Allocated memory is still 138.4MB. Free memory was 84.5MB in the beginning and 81.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.95ms. Allocated memory is still 138.4MB. Free memory was 81.9MB in the beginning and 79.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.25ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 61.9MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21825.11ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 60.9MB in the beginning and 56.7MB in the end (delta: 4.3MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 88.79ms. Allocated memory is still 174.1MB. Free memory was 56.7MB in the beginning and 52.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 21.7s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 527 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 524 mSDsluCounter, 1837 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 158 IncrementalHoareTripleChecker+Unchecked, 1486 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1625 IncrementalHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 351 mSDtfsCounter, 1625 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 126, 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, 12 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 70 PreInvPairs, 104 NumberOfFragments, 568 HoareAnnotationTreeSize, 70 FomulaSimplifications, 6 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 491 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 367 ConstructedInterpolants, 8 QuantifiedInterpolants, 1782 SizeOfPredicates, 197 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 473 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: ((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(kobj == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12] - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || \old(\valid) == \valid) && ((!(kobj == 0) || !(kobj == 0)) || \old(\valid) == \valid) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) || (((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 0 == \result) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && !(\result == 0)) && !(kobj == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 671]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 715]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(kobj == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12]) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-20 09:31:23,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd2f1cf6-5f5b-4aed-aba7-694643612d5d/bin/uautomizer-ug76WZFUDN/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