./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8 --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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- 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-2329fc7 [2022-12-13 19:34:51,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:34:51,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:34:51,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:34:51,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:34:51,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:34:51,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:34:51,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:34:51,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:34:51,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:34:51,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:34:51,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:34:51,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:34:51,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:34:51,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:34:51,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:34:51,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:34:51,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:34:51,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:34:51,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:34:51,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:34:51,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:34:51,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:34:51,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:34:51,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:34:51,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:34:51,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:34:51,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:34:51,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:34:51,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:34:51,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:34:51,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:34:51,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:34:51,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:34:51,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:34:51,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:34:51,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:34:51,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:34:51,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:34:51,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:34:51,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:34:51,159 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 19:34:51,181 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:34:51,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:34:51,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:34:51,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:34:51,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:34:51,183 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:34:51,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:34:51,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:34:51,184 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:34:51,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:34:51,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:34:51,185 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:34:51,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:34:51,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:34:51,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:34:51,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:34:51,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:34:51,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:34:51,186 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 19:34:51,186 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:34:51,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:34:51,186 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:34:51,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:34:51,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:34:51,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:34:51,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:34:51,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:34:51,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:34:51,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:34:51,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:34:51,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:34:51,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:34:51,188 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:34:51,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:34:51,189 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:34:51,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:34:51,189 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:34:51,189 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/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_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-12-13 19:34:51,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:34:51,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:34:51,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:34:51,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:34:51,398 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:34:51,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-12-13 19:34:53,908 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:34:54,113 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:34:54,113 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-12-13 19:34:54,123 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/data/cb568c34b/3931adbb694d44e6bc290c8cb0af8ae5/FLAG07df0216b [2022-12-13 19:34:54,493 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/data/cb568c34b/3931adbb694d44e6bc290c8cb0af8ae5 [2022-12-13 19:34:54,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:34:54,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:34:54,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:34:54,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:34:54,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:34:54,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25dc475f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54, skipping insertion in model container [2022-12-13 19:34:54,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:34:54,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:34:54,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:34:54,816 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:34:54,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:34:54,899 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:34:54,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54 WrapperNode [2022-12-13 19:34:54,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:34:54,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:34:54,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:34:54,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:34:54,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,937 INFO L138 Inliner]: procedures = 164, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 121 [2022-12-13 19:34:54,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:34:54,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:34:54,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:34:54,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:34:54,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,957 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:34:54,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:34:54,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:34:54,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:34:54,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (1/1) ... [2022-12-13 19:34:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:34:54,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:34:54,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:34:54,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:34:55,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:34:55,012 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-12-13 19:34:55,012 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-12-13 19:34:55,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 19:34:55,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 19:34:55,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-12-13 19:34:55,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-12-13 19:34:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:34:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 19:34:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:34:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 19:34:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 19:34:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:34:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 19:34:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:34:55,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:34:55,122 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:34:55,124 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:34:55,319 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:34:55,325 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:34:55,325 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:34:55,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:34:55 BoogieIcfgContainer [2022-12-13 19:34:55,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:34:55,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:34:55,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:34:55,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:34:55,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:34:54" (1/3) ... [2022-12-13 19:34:55,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6450fdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:34:55, skipping insertion in model container [2022-12-13 19:34:55,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:34:54" (2/3) ... [2022-12-13 19:34:55,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6450fdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:34:55, skipping insertion in model container [2022-12-13 19:34:55,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:34:55" (3/3) ... [2022-12-13 19:34:55,336 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2022-12-13 19:34:55,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:34:55,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 19:34:55,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:34:55,409 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;@180b458b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:34:55,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 19:34:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 19:34:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 19:34:55,418 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:55,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:55,419 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-12-13 19:34:55,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -175410051, now seen corresponding path program 1 times [2022-12-13 19:34:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:55,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252048436] [2022-12-13 19:34:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:55,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:55,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252048436] [2022-12-13 19:34:55,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252048436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:55,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:55,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:34:55,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420344808] [2022-12-13 19:34:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:55,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:34:55,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:55,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:34:55,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:34:55,725 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-12-13 19:34:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:55,867 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2022-12-13 19:34:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:34:55,869 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-12-13 19:34:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:55,878 INFO L225 Difference]: With dead ends: 116 [2022-12-13 19:34:55,878 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 19:34:55,881 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-12-13 19:34:55,883 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:55,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 249 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 19:34:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2022-12-13 19:34:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:34:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-12-13 19:34:55,919 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 12 [2022-12-13 19:34:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:55,919 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-12-13 19:34:55,920 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-12-13 19:34:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-12-13 19:34:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 19:34:55,920 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:55,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:34:55,920 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-12-13 19:34:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1567400284, now seen corresponding path program 1 times [2022-12-13 19:34:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235499452] [2022-12-13 19:34:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:56,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235499452] [2022-12-13 19:34:56,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235499452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:56,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:56,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:34:56,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458819226] [2022-12-13 19:34:56,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:56,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:34:56,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:56,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:34:56,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:34:56,011 INFO L87 Difference]: Start difference. First operand 52 states and 61 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-12-13 19:34:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:56,116 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-12-13 19:34:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:34:56,116 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-12-13 19:34:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:56,118 INFO L225 Difference]: With dead ends: 92 [2022-12-13 19:34:56,118 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 19:34:56,118 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-12-13 19:34:56,120 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:56,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 139 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 19:34:56,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-12-13 19:34:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:34:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-12-13 19:34:56,128 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2022-12-13 19:34:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:56,128 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-12-13 19:34:56,128 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-12-13 19:34:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-12-13 19:34:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 19:34:56,129 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:56,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:56,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:34:56,130 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-12-13 19:34:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1120397654, now seen corresponding path program 1 times [2022-12-13 19:34:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:56,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093913554] [2022-12-13 19:34:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:56,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:56,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093913554] [2022-12-13 19:34:56,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093913554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:56,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:56,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:34:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976567449] [2022-12-13 19:34:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:56,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:34:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:34:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:34:56,246 INFO L87 Difference]: Start difference. First operand 54 states and 63 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-12-13 19:34:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:56,351 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2022-12-13 19:34:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:34:56,352 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-12-13 19:34:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:56,352 INFO L225 Difference]: With dead ends: 107 [2022-12-13 19:34:56,352 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 19:34:56,353 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-12-13 19:34:56,353 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:56,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 258 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 19:34:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2022-12-13 19:34:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:34:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-12-13 19:34:56,359 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 16 [2022-12-13 19:34:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:56,359 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-12-13 19:34:56,359 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-12-13 19:34:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-12-13 19:34:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 19:34:56,359 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:56,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:56,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:34:56,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 19:34:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1500438086, now seen corresponding path program 1 times [2022-12-13 19:34:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:56,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508104423] [2022-12-13 19:34:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:56,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:56,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508104423] [2022-12-13 19:34:56,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508104423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:56,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:56,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 19:34:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246207206] [2022-12-13 19:34:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:56,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:34:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:34:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:34:56,456 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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-12-13 19:34:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:56,578 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-12-13 19:34:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:34:56,579 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), 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 17 [2022-12-13 19:34:56,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:56,580 INFO L225 Difference]: With dead ends: 88 [2022-12-13 19:34:56,580 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 19:34:56,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:34:56,581 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:56,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 216 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 19:34:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-12-13 19:34:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:34:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-12-13 19:34:56,585 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 17 [2022-12-13 19:34:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:56,585 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-12-13 19:34:56,585 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), 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-12-13 19:34:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-12-13 19:34:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 19:34:56,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:56,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:56,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:34:56,586 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 19:34:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash -991314935, now seen corresponding path program 1 times [2022-12-13 19:34:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:56,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599791331] [2022-12-13 19:34:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:56,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:56,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599791331] [2022-12-13 19:34:56,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599791331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:56,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:56,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 19:34:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804634200] [2022-12-13 19:34:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:56,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:34:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:34:56,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:34:56,665 INFO L87 Difference]: Start difference. First operand 55 states and 64 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-12-13 19:34:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:56,742 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-12-13 19:34:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:34:56,742 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-12-13 19:34:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:56,743 INFO L225 Difference]: With dead ends: 95 [2022-12-13 19:34:56,743 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 19:34:56,744 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-12-13 19:34:56,744 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:56,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 19:34:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-12-13 19:34:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:34:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-12-13 19:34:56,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 16 [2022-12-13 19:34:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:56,748 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-12-13 19:34:56,748 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-12-13 19:34:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-12-13 19:34:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 19:34:56,749 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:56,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:34:56,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:34:56,750 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-12-13 19:34:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1476374573, now seen corresponding path program 1 times [2022-12-13 19:34:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:56,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426861280] [2022-12-13 19:34:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:56,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426861280] [2022-12-13 19:34:56,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426861280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:56,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:56,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 19:34:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830660987] [2022-12-13 19:34:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:56,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 19:34:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 19:34:56,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 19:34:56,824 INFO L87 Difference]: Start difference. First operand 48 states and 54 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-12-13 19:34:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:56,928 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-12-13 19:34:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:34:56,929 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-12-13 19:34:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:56,929 INFO L225 Difference]: With dead ends: 82 [2022-12-13 19:34:56,930 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 19:34:56,930 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-12-13 19:34:56,930 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:56,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 143 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 19:34:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-12-13 19:34:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:34:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-13 19:34:56,935 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2022-12-13 19:34:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:56,935 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-13 19:34:56,935 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-12-13 19:34:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-13 19:34:56,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 19:34:56,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:56,936 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-12-13 19:34:56,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:34:56,936 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-12-13 19:34:56,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -814801186, now seen corresponding path program 1 times [2022-12-13 19:34:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:56,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822715335] [2022-12-13 19:34:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 19:34:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:57,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:57,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822715335] [2022-12-13 19:34:57,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822715335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:57,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:57,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:34:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124947714] [2022-12-13 19:34:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:57,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:34:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:57,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:34:57,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:34:57,034 INFO L87 Difference]: Start difference. First operand 48 states and 53 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-12-13 19:34:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:57,114 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-12-13 19:34:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:34:57,115 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-12-13 19:34:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:57,115 INFO L225 Difference]: With dead ends: 93 [2022-12-13 19:34:57,115 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 19:34:57,116 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-12-13 19:34:57,117 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:57,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 19:34:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-12-13 19:34:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.236842105263158) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:34:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-12-13 19:34:57,123 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2022-12-13 19:34:57,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:57,123 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-12-13 19:34:57,124 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-12-13 19:34:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-12-13 19:34:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 19:34:57,124 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:57,124 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-12-13 19:34:57,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:34:57,125 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-12-13 19:34:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash 595648175, now seen corresponding path program 1 times [2022-12-13 19:34:57,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:57,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116326554] [2022-12-13 19:34:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:57,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 19:34:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:57,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116326554] [2022-12-13 19:34:57,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116326554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:34:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116325092] [2022-12-13 19:34:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:57,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:34:57,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:34:57,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:34:57,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:34:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:57,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 19:34:57,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:34:57,493 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-12-13 19:34:57,551 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_107 Int) (v_ArrVal_106 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_107) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_106)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-13 19:34:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:34:57,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:34:57,583 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-12-13 19:34:57,652 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-12-13 19:34:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:34:57,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:34:57,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116325092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:57,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:34:57,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-12-13 19:34:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306922840] [2022-12-13 19:34:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:57,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:34:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:57,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:34:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-12-13 19:34:57,670 INFO L87 Difference]: Start difference. First operand 49 states and 54 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-12-13 19:34:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:57,901 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-12-13 19:34:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 19:34:57,901 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-12-13 19:34:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:57,902 INFO L225 Difference]: With dead ends: 57 [2022-12-13 19:34:57,902 INFO L226 Difference]: Without dead ends: 56 [2022-12-13 19:34:57,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-12-13 19:34:57,904 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:57,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 285 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-12-13 19:34:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-13 19:34:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2022-12-13 19:34:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:34:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-13 19:34:57,909 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2022-12-13 19:34:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:57,909 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-13 19:34:57,910 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-12-13 19:34:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-13 19:34:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 19:34:57,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:57,910 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-12-13 19:34:57,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:34:58,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 19:34:58,111 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-12-13 19:34:58,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1285224321, now seen corresponding path program 1 times [2022-12-13 19:34:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:58,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422566955] [2022-12-13 19:34:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 19:34:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:58,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:58,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422566955] [2022-12-13 19:34:58,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422566955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:34:58,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034071672] [2022-12-13 19:34:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:58,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:34:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:34:58,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:34:58,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:34:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:58,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-13 19:34:58,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:34:58,389 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-12-13 19:34:58,436 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_174 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_174) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_171)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-13 19:34:58,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:34:58,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:34:58,460 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-12-13 19:34:58,524 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-12-13 19:34:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:34:58,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:34:58,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034071672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:58,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:34:58,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-12-13 19:34:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689405944] [2022-12-13 19:34:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:58,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 19:34:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:58,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 19:34:58,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-12-13 19:34:58,543 INFO L87 Difference]: Start difference. First operand 48 states and 53 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-12-13 19:34:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:58,756 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-12-13 19:34:58,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 19:34:58,757 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-12-13 19:34:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:58,757 INFO L225 Difference]: With dead ends: 54 [2022-12-13 19:34:58,757 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 19:34:58,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-12-13 19:34:58,758 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 36 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:58,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 285 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 222 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2022-12-13 19:34:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 19:34:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-12-13 19:34:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:34:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-12-13 19:34:58,763 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 25 [2022-12-13 19:34:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:58,764 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-12-13 19:34:58,764 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-12-13 19:34:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-12-13 19:34:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 19:34:58,765 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:58,765 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] [2022-12-13 19:34:58,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:34:58,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:34:58,965 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-12-13 19:34:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash 842874951, now seen corresponding path program 1 times [2022-12-13 19:34:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:58,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559185456] [2022-12-13 19:34:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:58,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:59,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 19:34:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:34:59,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:59,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559185456] [2022-12-13 19:34:59,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559185456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:34:59,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:34:59,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 19:34:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467344769] [2022-12-13 19:34:59,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:34:59,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 19:34:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:34:59,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 19:34:59,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 19:34:59,087 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:34:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:34:59,227 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-12-13 19:34:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:34:59,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-12-13 19:34:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:34:59,228 INFO L225 Difference]: With dead ends: 73 [2022-12-13 19:34:59,228 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 19:34:59,229 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-12-13 19:34:59,229 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 19:34:59,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 19:34:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 19:34:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-12-13 19:34:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:34:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-12-13 19:34:59,237 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 29 [2022-12-13 19:34:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:34:59,237 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-12-13 19:34:59,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 19:34:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-12-13 19:34:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 19:34:59,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:34:59,238 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] [2022-12-13 19:34:59,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:34:59,239 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-12-13 19:34:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:34:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash 221950145, now seen corresponding path program 1 times [2022-12-13 19:34:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:34:59,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848632754] [2022-12-13 19:34:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:34:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:59,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:34:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 19:34:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:34:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848632754] [2022-12-13 19:34:59,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848632754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:34:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655618895] [2022-12-13 19:34:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:34:59,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:34:59,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:34:59,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:34:59,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:34:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:34:59,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 132 conjunts are in the unsatisfiable core [2022-12-13 19:34:59,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:34:59,551 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-12-13 19:34:59,600 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-12-13 19:34:59,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:34:59,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:34:59,617 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-12-13 19:34:59,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:34:59,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:34:59,737 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-12-13 19:34:59,825 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-12-13 19:34:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:34:59,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:35:00,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655618895] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:35:00,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:35:00,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18] total 23 [2022-12-13 19:35:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235621279] [2022-12-13 19:35:00,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:35:00,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 19:35:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:35:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 19:35:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=847, Unknown=1, NotChecked=58, Total=992 [2022-12-13 19:35:00,203 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 18 states have internal predecessors, (54), 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-12-13 19:35:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:35:08,936 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-12-13 19:35:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 19:35:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 18 states have internal predecessors, (54), 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 33 [2022-12-13 19:35:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:35:08,937 INFO L225 Difference]: With dead ends: 98 [2022-12-13 19:35:08,937 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 19:35:08,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=230, Invalid=1748, Unknown=6, NotChecked=86, Total=2070 [2022-12-13 19:35:08,939 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 92 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:35:08,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 229 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 638 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2022-12-13 19:35:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 19:35:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-12-13 19:35:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 19:35:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-12-13 19:35:08,949 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 33 [2022-12-13 19:35:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:35:08,949 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-12-13 19:35:08,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 18 states have internal predecessors, (54), 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-12-13 19:35:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-12-13 19:35:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 19:35:08,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:35:08,950 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] [2022-12-13 19:35:08,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:35:09,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:35:09,151 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-12-13 19:35:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:35:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1814803623, now seen corresponding path program 1 times [2022-12-13 19:35:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:35:09,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425758442] [2022-12-13 19:35:09,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:35:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:35:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:35:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:09,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 19:35:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:35:09,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:35:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425758442] [2022-12-13 19:35:09,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425758442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:35:09,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187211070] [2022-12-13 19:35:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:35:09,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:35:09,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:35:09,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:35:09,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:35:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:09,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 141 conjunts are in the unsatisfiable core [2022-12-13 19:35:09,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:35:09,575 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-12-13 19:35:09,625 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_388 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_388)) |c_#memory_int|))) is different from true [2022-12-13 19:35:09,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:35:09,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:35:09,645 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-12-13 19:35:09,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:35:09,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:35:09,774 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-12-13 19:35:09,872 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-12-13 19:35:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:35:09,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:35:12,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187211070] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:35:12,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:35:12,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 25 [2022-12-13 19:35:12,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323479988] [2022-12-13 19:35:12,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:35:12,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 19:35:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:35:12,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 19:35:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=961, Unknown=2, NotChecked=62, Total=1122 [2022-12-13 19:35:12,275 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 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-12-13 19:35:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:35:20,945 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-12-13 19:35:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 19:35:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 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 35 [2022-12-13 19:35:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:35:20,946 INFO L225 Difference]: With dead ends: 100 [2022-12-13 19:35:20,946 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 19:35:20,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=247, Invalid=2005, Unknown=8, NotChecked=92, Total=2352 [2022-12-13 19:35:20,948 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:35:20,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 197 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 504 Invalid, 0 Unknown, 50 Unchecked, 0.3s Time] [2022-12-13 19:35:20,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 19:35:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-12-13 19:35:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:35:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-12-13 19:35:20,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 35 [2022-12-13 19:35:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:35:20,955 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-12-13 19:35:20,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 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-12-13 19:35:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-12-13 19:35:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 19:35:20,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:35:20,956 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1] [2022-12-13 19:35:20,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:35:21,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:35:21,157 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 19:35:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:35:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 941637404, now seen corresponding path program 1 times [2022-12-13 19:35:21,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:35:21,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301037188] [2022-12-13 19:35:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:35:21,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:35:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:35:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 19:35:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 19:35:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:35:21,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:35:21,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301037188] [2022-12-13 19:35:21,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301037188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:35:21,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865880144] [2022-12-13 19:35:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:35:21,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:35:21,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:35:21,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:35:21,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:35:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:21,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 182 conjunts are in the unsatisfiable core [2022-12-13 19:35:21,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:35:21,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 19:35:21,680 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_518 Int) (v_ArrVal_516 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_518) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_516))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-13 19:35:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:35:21,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:35:21,698 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-12-13 19:35:21,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 19:35:21,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 19:35:21,833 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-12-13 19:35:21,943 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_521 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse1 (+ |c_ldv_kobject_put_#in~kobj#1.offset| 12))) (and (<= (select .cse0 .cse1) (+ v_ArrVal_521 1)) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse0 .cse1 v_ArrVal_521)) |c_#memory_int|)))) is different from true [2022-12-13 19:35:21,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-12-13 19:35:22,047 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-12-13 19:35:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:35:22,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:35:24,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865880144] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:35:24,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 19:35:24,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23] total 31 [2022-12-13 19:35:24,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811319684] [2022-12-13 19:35:24,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 19:35:24,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 19:35:24,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:35:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 19:35:24,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1655, Unknown=3, NotChecked=166, Total=1980 [2022-12-13 19:35:24,954 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 24 states have internal predecessors, (76), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:35:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:35:37,745 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-12-13 19:35:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 19:35:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 24 states have internal predecessors, (76), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-12-13 19:35:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:35:37,746 INFO L225 Difference]: With dead ends: 99 [2022-12-13 19:35:37,746 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 19:35:37,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=368, Invalid=3170, Unknown=10, NotChecked=234, Total=3782 [2022-12-13 19:35:37,747 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 91 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 19:35:37,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 174 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 509 Invalid, 0 Unknown, 104 Unchecked, 0.3s Time] [2022-12-13 19:35:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 19:35:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-12-13 19:35:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 19:35:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-12-13 19:35:37,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 46 [2022-12-13 19:35:37,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:35:37,756 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-12-13 19:35:37,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 24 states have internal predecessors, (76), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 19:35:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-12-13 19:35:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 19:35:37,757 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 19:35:37,757 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:35:37,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 19:35:37,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:35:37,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 19:35:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:35:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash -985792092, now seen corresponding path program 1 times [2022-12-13 19:35:37,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:35:37,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302509432] [2022-12-13 19:35:37,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:35:37,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:35:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 19:35:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 19:35:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:38,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 19:35:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:35:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:35:38,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302509432] [2022-12-13 19:35:38,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302509432] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:35:38,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678771361] [2022-12-13 19:35:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:35:38,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:35:38,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:35:38,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:35:38,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:35:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:35:38,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 97 conjunts are in the unsatisfiable core [2022-12-13 19:35:38,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:35:38,448 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-12-13 19:35:38,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 19:35:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:35:38,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:35:38,878 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 38 treesize of output 32 [2022-12-13 19:35:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 19:35:38,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678771361] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:35:38,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:35:38,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 25 [2022-12-13 19:35:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313912476] [2022-12-13 19:35:38,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:35:38,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 19:35:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:35:38,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 19:35:38,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2022-12-13 19:35:38,900 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 25 states, 23 states have (on average 4.086956521739131) internal successors, (94), 20 states have internal predecessors, (94), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 19:35:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:35:39,359 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-12-13 19:35:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 19:35:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.086956521739131) internal successors, (94), 20 states have internal predecessors, (94), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-12-13 19:35:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 19:35:39,359 INFO L225 Difference]: With dead ends: 90 [2022-12-13 19:35:39,359 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 19:35:39,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 19:35:39,361 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 19:35:39,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 456 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 19:35:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 19:35:39,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 19:35:39,361 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-12-13 19:35:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 19:35:39,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-12-13 19:35:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 19:35:39,362 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 19:35:39,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.086956521739131) internal successors, (94), 20 states have internal predecessors, (94), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-13 19:35:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 19:35:39,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 19:35:39,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-12-13 19:35:39,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-12-13 19:35:39,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-12-13 19:35:39,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-12-13 19:35:39,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 19:35:39,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:35:39,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 19:35:40,607 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-12-13 19:35:40,607 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point L762(lines 757 763) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_create_returnLabel#1(lines 738 747) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (or (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (.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|) .cse1 (= |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|) (<= .cse2 1) (<= 1 .cse2) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) (and .cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)))) [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-12-13 19:35:40,608 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_init_returnLabel#1(lines 728 737) 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-12-13 19:35:40,609 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-12-13 19:35:40,609 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-12-13 19:35:40,609 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 19:35:40,609 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-12-13 19:35:40,609 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-12-13 19:35:40,609 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 19:35:40,609 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-12-13 19:35:40,609 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-12-13 19:35:40,609 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-12-13 19:35:40,609 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_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-12-13 19:35:40,610 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_get_returnLabel#1(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|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |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|) (<= 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 .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-12-13 19:35:40,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-12-13 19:35:40,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 19:35:40,610 INFO L895 garLoopResultBuilder]: At program point ldv_atomic_add_return_returnLabel#1(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|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |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_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_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|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|))) (<= 2 .cse0))) [2022-12-13 19:35:40,610 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 766) no Hoare annotation was computed. [2022-12-13 19:35:40,610 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-12-13 19:35:40,610 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 19:35:40,610 INFO L895 garLoopResultBuilder]: At program point L761(line 761) 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|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |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|) (<= 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 .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-12-13 19:35:40,611 INFO L895 garLoopResultBuilder]: At program point L761-1(line 761) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (.cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0))) (or (and (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse0 .cse1) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |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_get_~kobj#1.base| 0)) (not .cse1) (<= (select .cse2 12) 2) .cse0 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 0 (select .cse2 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))))))) [2022-12-13 19:35:40,611 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-12-13 19:35:40,611 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-12-13 19:35:40,611 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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-12-13 19:35:40,611 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-12-13 19:35:40,611 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-12-13 19:35:40,611 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-12-13 19:35:40,611 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-12-13 19:35:40,611 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-12-13 19:35:40,611 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(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 |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (or (not (<= (select .cse0 12) 2)) .cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse2) (not (<= 0 (select .cse0 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse2))) [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-12-13 19:35:40,612 INFO L895 garLoopResultBuilder]: At program point ldv_atomic_sub_return_returnLabel#1(lines 663 670) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse3 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse2 (select .cse4 12))) (let ((.cse1 (not (<= .cse2 2))) (.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse5 (select .cse4 .cse3))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (or .cse1 .cse0 (not (<= 2 .cse2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse3) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse3)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse4 .cse3 v_ArrVal_521))) (<= .cse5 (+ v_ArrVal_521 1)))) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or .cse1 .cse0 (not (<= 0 .cse5)) (= |old(#valid)| |#valid|)))))) [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-12-13 19:35:40,612 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOID_returnLabel#1(line -1) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse0 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (or (not (<= .cse0 2)) .cse1 (let ((.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse3 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse3 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse2)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select .cse3 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= 2 .cse0)))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-12-13 19:35:40,612 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-12-13 19:35:40,613 INFO L895 garLoopResultBuilder]: At program point ldv_kref_put_returnLabel#1(lines 688 691) the Hoare annotation is: (let ((.cse6 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse10 (not .cse6))) (and (let ((.cse11 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse4 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_~kobj#1.offset| 0)) (.cse1 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (<= (select .cse4 12) 2)) (.cse8 (<= (select .cse2 12) 2)) (.cse9 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)) (.cse0 (select .cse11 12))) (or (not (<= .cse0 2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse1) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse2 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse4 .cse1)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (and .cse3 .cse5 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse11 .cse1 v_ArrVal_521))) (<= (select .cse11 .cse1) (+ v_ArrVal_521 1)))) .cse6 .cse7 .cse8 (= |old(#valid)| |#valid|) .cse9) (not (<= 2 .cse0))))) (or .cse10 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)))))) [2022-12-13 19:35:40,613 INFO L895 garLoopResultBuilder]: At program point ldv_kref_sub_returnLabel#1(lines 671 679) the Hoare annotation is: (let ((.cse6 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse10 (not .cse6))) (and (let ((.cse11 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse2 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse4 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_~kobj#1.offset| 0)) (.cse1 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (<= (select .cse4 12) 2)) (.cse8 (<= (select .cse2 12) 2)) (.cse9 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|)) (.cse0 (select .cse11 12))) (or (not (<= .cse0 2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse1) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse2 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse4 .cse1)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (and .cse3 .cse5 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse11 .cse1 v_ArrVal_521))) (<= (select .cse11 .cse1) (+ v_ArrVal_521 1)))) .cse6 .cse7 .cse8 (= |old(#valid)| |#valid|) .cse9) (not (<= 2 .cse0))))) (or .cse10 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)))))) [2022-12-13 19:35:40,615 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:35:40,617 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:35:40,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:35:40 BoogieIcfgContainer [2022-12-13 19:35:40,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:35:40,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:35:40,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:35:40,637 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:35:40,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:34:55" (3/4) ... [2022-12-13 19:35:40,639 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 19:35:40,644 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-13 19:35:40,644 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-12-13 19:35:40,644 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-12-13 19:35:40,648 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2022-12-13 19:35:40,648 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-13 19:35:40,648 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 19:35:40,666 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) || (0 == \result && \result == 0) [2022-12-13 19:35:40,666 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && 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-12-13 19:35:40,666 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && 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) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 2 <= unknown-#memory_int-unknown[kobj][12] [2022-12-13 19:35:40,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(kobj == 0) || !(kobj == 0)) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i))) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || \old(\valid) == \valid) [2022-12-13 19:35:40,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || (((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) [2022-12-13 19:35:40,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || (((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) [2022-12-13 19:35:40,667 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) [2022-12-13 19:35:40,677 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:35:40,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:35:40,677 INFO L158 Benchmark]: Toolchain (without parser) took 46175.12ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 92.0MB in the beginning and 34.2MB in the end (delta: 57.7MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2022-12-13 19:35:40,677 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:35:40,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.56ms. Allocated memory is still 125.8MB. Free memory was 91.5MB in the beginning and 70.3MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 19:35:40,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.09ms. Allocated memory is still 125.8MB. Free memory was 70.3MB in the beginning and 67.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:35:40,678 INFO L158 Benchmark]: Boogie Preprocessor took 22.18ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 65.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:35:40,678 INFO L158 Benchmark]: RCFGBuilder took 366.80ms. Allocated memory is still 125.8MB. Free memory was 65.5MB in the beginning and 47.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 19:35:40,678 INFO L158 Benchmark]: TraceAbstraction took 45305.97ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 47.3MB in the beginning and 38.5MB in the end (delta: 8.8MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2022-12-13 19:35:40,678 INFO L158 Benchmark]: Witness Printer took 40.38ms. Allocated memory is still 151.0MB. Free memory was 38.5MB in the beginning and 34.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 19:35:40,679 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.15ms. Allocated memory is still 125.8MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.56ms. Allocated memory is still 125.8MB. Free memory was 91.5MB in the beginning and 70.3MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.09ms. Allocated memory is still 125.8MB. Free memory was 70.3MB in the beginning and 67.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.18ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 65.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.80ms. Allocated memory is still 125.8MB. Free memory was 65.5MB in the beginning and 47.8MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 45305.97ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 47.3MB in the beginning and 38.5MB in the end (delta: 8.8MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * Witness Printer took 40.38ms. Allocated memory is still 151.0MB. Free memory was 38.5MB in the beginning and 34.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] * 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: 45.2s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 759 mSDsluCounter, 3047 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 347 IncrementalHoareTripleChecker+Unchecked, 2562 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3468 IncrementalHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 485 mSDtfsCounter, 3468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 526 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 280 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 36.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 171, 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, 14 MinimizatonAttempts, 107 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 168 PreInvPairs, 317 NumberOfFragments, 1088 HoareAnnotationTreeSize, 168 FomulaSimplifications, 13 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2501 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 601 ConstructedInterpolants, 16 QuantifiedInterpolants, 3004 SizeOfPredicates, 297 NumberOfNonLiveVariables, 1944 ConjunctsInSsa, 718 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 25/70 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 == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && 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) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 2 <= unknown-#memory_int-unknown[kobj][12] - InvariantResult [Line: 715]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && 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: -1]: Loop Invariant Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj] - InvariantResult [Line: 663]: Loop Invariant [2022-12-13 19:35:40,687 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,687 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,692 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((!(kobj == 0) || !(kobj == 0)) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i))) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || \old(\valid) == \valid) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj] - InvariantResult [Line: 671]: Loop Invariant [2022-12-13 19:35:40,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,693 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,694 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || (((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: ((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) || (0 == \result && \result == 0) - InvariantResult [Line: 688]: Loop Invariant [2022-12-13 19:35:40,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,696 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 19:35:40,697 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || (((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) RESULT: Ultimate proved your program to be correct! [2022-12-13 19:35:40,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88c37d6a-86c9-4b68-8b70-62032830475c/bin/uautomizer-uyxdKDjOR8/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