./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4e7fbc69 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_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS --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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- 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-4e7fbc6 [2022-11-23 03:30:12,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:30:12,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:30:12,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:30:12,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:30:12,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:30:12,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:30:12,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:30:12,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:30:12,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:30:12,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:30:12,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:30:12,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:30:12,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:30:12,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:30:12,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:30:12,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:30:12,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:30:12,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:30:12,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:30:12,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:30:12,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:30:12,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:30:12,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:30:12,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:30:12,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:30:12,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:30:12,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:30:12,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:30:12,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:30:12,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:30:12,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:30:12,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:30:12,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:30:12,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:30:12,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:30:12,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:30:12,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:30:12,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:30:12,735 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:30:12,736 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:30:12,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-23 03:30:12,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:30:12,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:30:12,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:30:12,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:30:12,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:30:12,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:30:12,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:30:12,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:30:12,786 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:30:12,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:30:12,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:30:12,788 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:30:12,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:30:12,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:30:12,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:30:12,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:30:12,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:30:12,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:30:12,789 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-23 03:30:12,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:30:12,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:30:12,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:30:12,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:30:12,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:30:12,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:30:12,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:30:12,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:30:12,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:30:12,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:30:12,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:30:12,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:30:12,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:30:12,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:30:12,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:30:12,794 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:30:12,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:30:12,795 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_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/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_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2022-11-23 03:30:13,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:30:13,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:30:13,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:30:13,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:30:13,196 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:30:13,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-23 03:30:16,424 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:30:16,770 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:30:16,777 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-23 03:30:16,792 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/data/6716adc40/c955b1b7b38d4527a2f52e04ecf85d7d/FLAG022dd0527 [2022-11-23 03:30:16,811 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/data/6716adc40/c955b1b7b38d4527a2f52e04ecf85d7d [2022-11-23 03:30:16,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:30:16,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:30:16,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:30:16,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:30:16,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:30:16,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:30:16" (1/1) ... [2022-11-23 03:30:16,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@872f0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:16, skipping insertion in model container [2022-11-23 03:30:16,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:30:16" (1/1) ... [2022-11-23 03:30:16,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:30:16,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:30:17,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:30:17,441 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:30:17,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:30:17,547 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:30:17,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17 WrapperNode [2022-11-23 03:30:17,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:30:17,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:30:17,550 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:30:17,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:30:17,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,613 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 125 [2022-11-23 03:30:17,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:30:17,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:30:17,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:30:17,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:30:17,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:30:17,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:30:17,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:30:17,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:30:17,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (1/1) ... [2022-11-23 03:30:17,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:30:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:17,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:30:17,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:30:17,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:30:17,787 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-23 03:30:17,788 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-23 03:30:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-23 03:30:17,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-23 03:30:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-23 03:30:17,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-23 03:30:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 03:30:17,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:30:17,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:30:18,010 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:30:18,013 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:30:18,477 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:30:18,485 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:30:18,494 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:30:18,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:30:18 BoogieIcfgContainer [2022-11-23 03:30:18,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:30:18,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:30:18,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:30:18,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:30:18,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:30:16" (1/3) ... [2022-11-23 03:30:18,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6068c403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:30:18, skipping insertion in model container [2022-11-23 03:30:18,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:30:17" (2/3) ... [2022-11-23 03:30:18,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6068c403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:30:18, skipping insertion in model container [2022-11-23 03:30:18,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:30:18" (3/3) ... [2022-11-23 03:30:18,513 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-11-23 03:30:18,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:30:18,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-23 03:30:18,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:30:18,670 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;@ca033f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:30:18,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-23 03:30:18,676 INFO L276 IsEmpty]: Start isEmpty. 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), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 03:30:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 03:30:18,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:18,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:18,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -846947467, now seen corresponding path program 1 times [2022-11-23 03:30:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:18,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267621447] [2022-11-23 03:30:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:19,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:19,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267621447] [2022-11-23 03:30:19,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267621447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:19,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:19,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:30:19,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466197033] [2022-11-23 03:30:19,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:19,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:19,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:19,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:19,336 INFO L87 Difference]: Start difference. First 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), 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-11-23 03:30:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:19,575 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-11-23 03:30:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:30:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-23 03:30:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:19,589 INFO L225 Difference]: With dead ends: 122 [2022-11-23 03:30:19,590 INFO L226 Difference]: Without dead ends: 80 [2022-11-23 03:30:19,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:19,598 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 44 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 267 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:19,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 267 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:30:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-23 03:30:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2022-11-23 03:30:19,648 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-11-23 03:30:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-23 03:30:19,652 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2022-11-23 03:30:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:19,653 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-23 03:30:19,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-23 03:30:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 03:30:19,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:19,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:19,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:30:19,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:19,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash 895862868, now seen corresponding path program 1 times [2022-11-23 03:30:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:19,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842371139] [2022-11-23 03:30:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:19,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:19,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842371139] [2022-11-23 03:30:19,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842371139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:19,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:19,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:30:19,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381413296] [2022-11-23 03:30:19,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:19,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:30:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:30:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:30:19,899 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:20,190 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-11-23 03:30:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:30:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-23 03:30:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:20,197 INFO L225 Difference]: With dead ends: 100 [2022-11-23 03:30:20,197 INFO L226 Difference]: Without dead ends: 72 [2022-11-23 03:30:20,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:20,200 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:20,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:30:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-23 03:30:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2022-11-23 03:30:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 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-11-23 03:30:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-23 03:30:20,230 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 12 [2022-11-23 03:30:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:20,231 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-23 03:30:20,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-23 03:30:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 03:30:20,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:20,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:20,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:30:20,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:20,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash 366281122, now seen corresponding path program 1 times [2022-11-23 03:30:20,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:20,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720558862] [2022-11-23 03:30:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720558862] [2022-11-23 03:30:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720558862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:20,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:20,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:30:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742806270] [2022-11-23 03:30:20,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:20,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:30:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:20,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:30:20,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:30:20,476 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:20,665 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-11-23 03:30:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:30:20,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-23 03:30:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:20,667 INFO L225 Difference]: With dead ends: 113 [2022-11-23 03:30:20,668 INFO L226 Difference]: Without dead ends: 82 [2022-11-23 03:30:20,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:30:20,670 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 57 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 278 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:20,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 278 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:30:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-23 03:30:20,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2022-11-23 03:30:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 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-11-23 03:30:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-23 03:30:20,682 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2022-11-23 03:30:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:20,682 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-23 03:30:20,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-23 03:30:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 03:30:20,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:20,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:20,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:30:20,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:20,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:20,685 INFO L85 PathProgramCache]: Analyzing trace with hash 495363841, now seen corresponding path program 1 times [2022-11-23 03:30:20,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:20,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936276538] [2022-11-23 03:30:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:20,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:20,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:20,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936276538] [2022-11-23 03:30:20,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936276538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:20,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:20,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:30:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988099951] [2022-11-23 03:30:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:20,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:30:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:30:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:20,922 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:21,135 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-11-23 03:30:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:30:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-23 03:30:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:21,139 INFO L225 Difference]: With dead ends: 107 [2022-11-23 03:30:21,139 INFO L226 Difference]: Without dead ends: 66 [2022-11-23 03:30:21,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:30:21,144 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 24 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:21,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 183 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:30:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-23 03:30:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-11-23 03:30:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.25) internal successors, (55), 49 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-11-23 03:30:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-23 03:30:21,158 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2022-11-23 03:30:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:21,158 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-23 03:30:21,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-23 03:30:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 03:30:21,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:21,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:21,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:30:21,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash -835975854, now seen corresponding path program 1 times [2022-11-23 03:30:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:21,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882675217] [2022-11-23 03:30:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:21,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:21,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882675217] [2022-11-23 03:30:21,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882675217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:21,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:21,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:30:21,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156243516] [2022-11-23 03:30:21,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:21,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:30:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:30:21,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:30:21,425 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:21,702 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-23 03:30:21,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:30:21,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-23 03:30:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:21,709 INFO L225 Difference]: With dead ends: 90 [2022-11-23 03:30:21,709 INFO L226 Difference]: Without dead ends: 56 [2022-11-23 03:30:21,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-23 03:30:21,714 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:21,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 255 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:30:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-23 03:30:21,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-11-23 03:30:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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-11-23 03:30:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-23 03:30:21,742 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2022-11-23 03:30:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:21,743 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-23 03:30:21,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-23 03:30:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 03:30:21,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:21,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:21,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:30:21,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1292786891, now seen corresponding path program 1 times [2022-11-23 03:30:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:21,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455698103] [2022-11-23 03:30:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:21,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:21,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455698103] [2022-11-23 03:30:21,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455698103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:21,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:21,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 03:30:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815118563] [2022-11-23 03:30:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:21,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:30:21,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:30:21,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:30:21,930 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:22,097 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-11-23 03:30:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:30:22,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-23 03:30:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:22,101 INFO L225 Difference]: With dead ends: 86 [2022-11-23 03:30:22,101 INFO L226 Difference]: Without dead ends: 54 [2022-11-23 03:30:22,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:30:22,112 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 151 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-11-23 03:30:22,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 151 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:30:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-23 03:30:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-11-23 03:30:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 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-11-23 03:30:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-23 03:30:22,128 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2022-11-23 03:30:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:22,128 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-23 03:30:22,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 03:30:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-23 03:30:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 03:30:22,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:22,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:22,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:30:22,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash 259861478, now seen corresponding path program 1 times [2022-11-23 03:30:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:22,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841403656] [2022-11-23 03:30:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:22,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-23 03:30:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:22,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841403656] [2022-11-23 03:30:22,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841403656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:22,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:22,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:30:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145853535] [2022-11-23 03:30:22,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:22,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:30:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:22,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:30:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:30:22,355 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:22,499 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-11-23 03:30:22,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:30:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-11-23 03:30:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:22,501 INFO L225 Difference]: With dead ends: 97 [2022-11-23 03:30:22,501 INFO L226 Difference]: Without dead ends: 57 [2022-11-23 03:30:22,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:30:22,503 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 115 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-11-23 03:30:22,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 115 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 03:30:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-23 03:30:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-11-23 03:30:22,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.225) internal successors, (49), 44 states have internal predecessors, (49), 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-11-23 03:30:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-23 03:30:22,526 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 23 [2022-11-23 03:30:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:22,527 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-23 03:30:22,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-23 03:30:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 03:30:22,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:22,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:22,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:30:22,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash 451023015, now seen corresponding path program 1 times [2022-11-23 03:30:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:22,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419017003] [2022-11-23 03:30:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:30:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:22,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419017003] [2022-11-23 03:30:22,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419017003] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:22,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452859160] [2022-11-23 03:30:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:22,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:22,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:22,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:30:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:23,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-23 03:30:23,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:23,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:30:23,334 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-11-23 03:30:23,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:23,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:23,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-23 03:30:23,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:30:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:30:23,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:30:23,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452859160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:23,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:30:23,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-23 03:30:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829516550] [2022-11-23 03:30:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:23,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:30:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:23,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:30:23,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-23 03:30:23,554 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:23,997 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-11-23 03:30:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 03:30:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-11-23 03:30:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:23,998 INFO L225 Difference]: With dead ends: 63 [2022-11-23 03:30:23,998 INFO L226 Difference]: Without dead ends: 62 [2022-11-23 03:30:23,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-11-23 03:30:24,000 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 77 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:24,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 265 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 207 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2022-11-23 03:30:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-23 03:30:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-11-23 03:30:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 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-11-23 03:30:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-23 03:30:24,010 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2022-11-23 03:30:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:24,011 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-23 03:30:24,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-23 03:30:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 03:30:24,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:24,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:24,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 03:30:24,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:24,221 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1096811657, now seen corresponding path program 1 times [2022-11-23 03:30:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517625387] [2022-11-23 03:30:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:24,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:24,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:30:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:24,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517625387] [2022-11-23 03:30:24,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517625387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:24,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56580405] [2022-11-23 03:30:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:24,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:24,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:24,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:24,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:30:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:24,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-23 03:30:24,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:24,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:30:24,884 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-11-23 03:30:24,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:24,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:24,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-23 03:30:25,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:30:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:30:25,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:30:25,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56580405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:25,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:30:25,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-23 03:30:25,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783279785] [2022-11-23 03:30:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:25,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 03:30:25,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 03:30:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-23 03:30:25,107 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:25,463 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-11-23 03:30:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 03:30:25,464 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-23 03:30:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:25,465 INFO L225 Difference]: With dead ends: 58 [2022-11-23 03:30:25,465 INFO L226 Difference]: Without dead ends: 57 [2022-11-23 03:30:25,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-11-23 03:30:25,466 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 58 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:25,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 309 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 220 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-11-23 03:30:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-23 03:30:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-11-23 03:30:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.175) 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-11-23 03:30:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-23 03:30:25,474 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2022-11-23 03:30:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:25,475 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-23 03:30:25,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-23 03:30:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 03:30:25,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:25,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:25,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:30:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:25,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1913158811, now seen corresponding path program 1 times [2022-11-23 03:30:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:25,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828624192] [2022-11-23 03:30:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:25,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:25,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:30:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:30:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:25,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828624192] [2022-11-23 03:30:25,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828624192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:30:25,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:30:25,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 03:30:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779335134] [2022-11-23 03:30:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:30:25,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:30:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:30:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:30:25,881 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:26,150 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-23 03:30:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:30:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-23 03:30:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:26,152 INFO L225 Difference]: With dead ends: 77 [2022-11-23 03:30:26,152 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 03:30:26,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-23 03:30:26,153 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 56 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 147 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.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:26,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 147 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:30:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 03:30:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-11-23 03:30:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.15) internal successors, (46), 42 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-11-23 03:30:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-23 03:30:26,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2022-11-23 03:30:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:26,165 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-23 03:30:26,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 03:30:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-23 03:30:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 03:30:26,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:26,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:26,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:30:26,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1920244181, now seen corresponding path program 1 times [2022-11-23 03:30:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851559798] [2022-11-23 03:30:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:30:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:26,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851559798] [2022-11-23 03:30:26,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851559798] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:26,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062585418] [2022-11-23 03:30:26,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:26,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:26,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:26,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:30:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:26,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 148 conjunts are in the unsatisfiable core [2022-11-23 03:30:26,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:26,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:30:26,833 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_286 Int) (v_ArrVal_285 Int) (LDV_INIT_LIST_HEAD_~list.offset Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_285) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_286))))) is different from true [2022-11-23 03:30:26,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:26,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:26,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-23 03:30:27,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:30:27,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:30:27,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-11-23 03:30:27,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:30:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:27,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:30:27,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062585418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:27,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:30:27,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2022-11-23 03:30:27,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471446906] [2022-11-23 03:30:27,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:30:27,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 03:30:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:27,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 03:30:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=968, Unknown=1, NotChecked=62, Total=1122 [2022-11-23 03:30:27,919 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:30:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:37,664 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-11-23 03:30:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 03:30:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-11-23 03:30:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:37,666 INFO L225 Difference]: With dead ends: 103 [2022-11-23 03:30:37,666 INFO L226 Difference]: Without dead ends: 63 [2022-11-23 03:30:37,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=260, Invalid=1994, Unknown=6, NotChecked=92, Total=2352 [2022-11-23 03:30:37,668 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 150 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:37,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 247 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 654 Invalid, 0 Unknown, 53 Unchecked, 0.7s Time] [2022-11-23 03:30:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-23 03:30:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-11-23 03:30:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 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-11-23 03:30:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-23 03:30:37,681 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-11-23 03:30:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:37,681 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-23 03:30:37,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:30:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-23 03:30:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 03:30:37,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:37,683 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:30:37,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:30:37,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 03:30:37,895 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:30:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1143461147, now seen corresponding path program 1 times [2022-11-23 03:30:37,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:37,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766910754] [2022-11-23 03:30:37,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:37,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:38,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 03:30:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:38,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766910754] [2022-11-23 03:30:38,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766910754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:38,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001358215] [2022-11-23 03:30:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:38,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:38,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:38,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:38,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:30:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:38,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-23 03:30:38,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:38,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:30:38,762 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-11-23 03:30:38,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:38,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:38,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-23 03:30:39,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:30:39,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:30:39,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-11-23 03:30:39,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:30:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:39,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:30:42,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001358215] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:42,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:30:42,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2022-11-23 03:30:42,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692607347] [2022-11-23 03:30:42,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:30:42,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 03:30:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 03:30:42,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1090, Unknown=2, NotChecked=66, Total=1260 [2022-11-23 03:30:42,196 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:30:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:30:51,788 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-11-23 03:30:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:30:51,788 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-11-23 03:30:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:30:51,789 INFO L225 Difference]: With dead ends: 122 [2022-11-23 03:30:51,789 INFO L226 Difference]: Without dead ends: 59 [2022-11-23 03:30:51,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=273, Invalid=2375, Unknown=8, NotChecked=100, Total=2756 [2022-11-23 03:30:51,791 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 153 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:30:51,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 253 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 619 Invalid, 0 Unknown, 59 Unchecked, 0.7s Time] [2022-11-23 03:30:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-23 03:30:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-11-23 03:30:51,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 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-11-23 03:30:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-23 03:30:51,803 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 36 [2022-11-23 03:30:51,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:30:51,803 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-23 03:30:51,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:30:51,803 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-23 03:30:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-23 03:30:51,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:30:51,805 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, 1, 1] [2022-11-23 03:30:51,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-23 03:30:52,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 03:30:52,011 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-11-23 03:30:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:30:52,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1304169571, now seen corresponding path program 1 times [2022-11-23 03:30:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:30:52,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359664571] [2022-11-23 03:30:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:30:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:52,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:30:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-23 03:30:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 03:30:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:30:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:30:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359664571] [2022-11-23 03:30:52,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359664571] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098128079] [2022-11-23 03:30:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:30:52,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:30:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:30:52,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:30:52,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:30:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:30:52,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 198 conjunts are in the unsatisfiable core [2022-11-23 03:30:52,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:30:52,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:30:53,005 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-11-23 03:30:53,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:53,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:30:53,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-23 03:30:53,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 03:30:53,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:30:53,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-11-23 03:30:53,606 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-11-23 03:30:53,664 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-11-23 03:30:53,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 03:30:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:30:53,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:30:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098128079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:30:54,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:30:54,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 32 [2022-11-23 03:30:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037005906] [2022-11-23 03:30:54,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:30:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 03:30:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:30:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 03:30:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1086, Unknown=2, NotChecked=134, Total=1332 [2022-11-23 03:30:54,580 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 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-11-23 03:31:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:08,289 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-11-23 03:31:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 03:31:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 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 48 [2022-11-23 03:31:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:08,290 INFO L225 Difference]: With dead ends: 109 [2022-11-23 03:31:08,290 INFO L226 Difference]: Without dead ends: 67 [2022-11-23 03:31:08,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=300, Invalid=2455, Unknown=9, NotChecked=206, Total=2970 [2022-11-23 03:31:08,293 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 133 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:08,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 216 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 591 Invalid, 0 Unknown, 112 Unchecked, 0.6s Time] [2022-11-23 03:31:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-23 03:31:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-11-23 03:31:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:31:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-11-23 03:31:08,306 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 48 [2022-11-23 03:31:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:08,306 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-11-23 03:31:08,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 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-11-23 03:31:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-11-23 03:31:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 03:31:08,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:08,308 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 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] [2022-11-23 03:31:08,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:08,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:08,517 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:31:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash -710408717, now seen corresponding path program 1 times [2022-11-23 03:31:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:08,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703014453] [2022-11-23 03:31:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:31:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:08,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 03:31:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 03:31:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703014453] [2022-11-23 03:31:09,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703014453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220847033] [2022-11-23 03:31:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:09,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:09,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:09,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:31:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:09,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-23 03:31:09,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:09,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:31:09,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 03:31:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 03:31:09,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:31:10,031 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 30 treesize of output 24 [2022-11-23 03:31:10,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-23 03:31:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 03:31:10,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220847033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:31:10,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:31:10,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-11-23 03:31:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181505146] [2022-11-23 03:31:10,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:31:10,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 03:31:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 03:31:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2022-11-23 03:31:10,108 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 19 states have internal predecessors, (90), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 03:31:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:10,909 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-11-23 03:31:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 03:31:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 19 states have internal predecessors, (90), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2022-11-23 03:31:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:10,910 INFO L225 Difference]: With dead ends: 116 [2022-11-23 03:31:10,910 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 03:31:10,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-11-23 03:31:10,911 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 100 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:10,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 328 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:31:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 03:31:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-23 03:31:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 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-11-23 03:31:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-11-23 03:31:10,943 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-11-23 03:31:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:10,944 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-11-23 03:31:10,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 19 states have internal predecessors, (90), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 03:31:10,944 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-11-23 03:31:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-23 03:31:10,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:31:10,945 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1] [2022-11-23 03:31:10,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:11,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:11,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-23 03:31:11,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:31:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash -990130780, now seen corresponding path program 1 times [2022-11-23 03:31:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:31:11,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997014618] [2022-11-23 03:31:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:31:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:11,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:31:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:31:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:11,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-23 03:31:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:31:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:31:11,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997014618] [2022-11-23 03:31:11,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997014618] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:31:11,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913946163] [2022-11-23 03:31:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:31:11,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:11,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:31:11,683 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:31:11,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:31:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:31:11,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 105 conjunts are in the unsatisfiable core [2022-11-23 03:31:11,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:31:12,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 03:31:12,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-23 03:31:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 03:31:12,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:31:12,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-23 03:31:12,902 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-11-23 03:31:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 03:31:12,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913946163] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:31:12,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:31:12,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 27 [2022-11-23 03:31:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172582833] [2022-11-23 03:31:12,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:31:12,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-23 03:31:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:31:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-23 03:31:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2022-11-23 03:31:12,946 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 24 states have internal predecessors, (100), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 03:31:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:31:13,914 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-11-23 03:31:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 03:31:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 24 states have internal predecessors, (100), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2022-11-23 03:31:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:31:13,915 INFO L225 Difference]: With dead ends: 95 [2022-11-23 03:31:13,915 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 03:31:13,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 03:31:13,917 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 73 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:31:13,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 529 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:31:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 03:31:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 03:31:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:31:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 03:31:13,919 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-11-23 03:31:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:31:13,919 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 03:31:13,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 24 states have internal predecessors, (100), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-23 03:31:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 03:31:13,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 03:31:13,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-23 03:31:13,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-23 03:31:13,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-23 03:31:13,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-23 03:31:13,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:31:14,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:31:14,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 03:31:16,081 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-23 03:31:16,081 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-11-23 03:31:16,081 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-11-23 03:31:16,082 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-23 03:31:16,082 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-23 03:31:16,082 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-11-23 03:31:16,082 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-23 03:31:16,082 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-11-23 03:31:16,082 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-11-23 03:31:16,082 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse2 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse4 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse3 (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) .cse1 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse2 (= |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|) (<= .cse3 1) (<= 1 .cse3) (not .cse4) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) (and .cse1 .cse2 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0) .cse4))) [2022-11-23 03:31:16,083 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-11-23 03:31:16,083 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-23 03:31:16,083 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-23 03:31:16,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-23 03:31:16,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 03:31:16,083 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0))) [2022-11-23 03:31:16,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-23 03:31:16,083 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-11-23 03:31:16,084 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-23 03:31:16,084 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-11-23 03:31:16,084 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-11-23 03:31:16,084 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-23 03:31:16,085 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 03:31:16,085 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse15 (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12)) (.cse14 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse1 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)) (.cse12 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse4 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)) (.cse5 (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0))) (.cse6 (not .cse14)) (.cse13 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse7 (<= .cse15 2)) (.cse11 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) (.cse8 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) (.cse9 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse10 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 (select .cse10 .cse11)) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|)) (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse12 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse13 .cse9 .cse14) (let ((.cse16 (select .cse10 12))) (and (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 (<= 2 .cse15) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) .cse6 (<= .cse16 2) .cse13 .cse7 (= .cse11 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) .cse8 .cse9 (<= (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 .cse16)))))) [2022-11-23 03:31:16,085 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 763 769) no Hoare annotation was computed. [2022-11-23 03:31:16,085 INFO L895 garLoopResultBuilder]: At program point L731(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-11-23 03:31:16,086 INFO L895 garLoopResultBuilder]: At program point L661(lines 655 662) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |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-11-23 03:31:16,086 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-23 03:31:16,086 INFO L895 garLoopResultBuilder]: At program point L719(lines 715 720) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |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-11-23 03:31:16,087 INFO L895 garLoopResultBuilder]: At program point L761(line 761) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (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 (<= (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12) 2) (= (+ |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)) .cse3 (<= (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_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|) (= |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 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse2 .cse3 .cse1))) [2022-11-23 03:31:16,087 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-11-23 03:31:16,087 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 759) no Hoare annotation was computed. [2022-11-23 03:31:16,087 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-23 03:31:16,087 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-23 03:31:16,087 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 772) no Hoare annotation was computed. [2022-11-23 03:31:16,088 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(lines 538 542) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2022-11-23 03:31:16,088 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-11-23 03:31:16,088 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-23 03:31:16,088 INFO L895 garLoopResultBuilder]: At program point L669(lines 663 670) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse3 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse0 (select .cse4 .cse3))) (and (or (not (<= 0 .cse0)) (not (<= .cse0 2147483647)) (= |old(#valid)| |#valid|)) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse2 (select .cse4 12))) (or (not (<= .cse2 2)) .cse1 (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))) (<= .cse0 (+ 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|))))))) [2022-11-23 03:31:16,089 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-23 03:31:16,089 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-11-23 03:31:16,089 INFO L895 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: (let ((.cse9 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse0 (not .cse9))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse12 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse8 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse1 (select .cse7 12)) (.cse2 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse8)) (.cse3 (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse4 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|)) (.cse6 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse10 (<= (select .cse12 12) 2)) (.cse11 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse1 2)) .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse7 .cse8 v_ArrVal_521))) (<= (select .cse7 .cse8) (+ v_ArrVal_521 1)))) .cse9 .cse10 (= |old(#valid)| |#valid|) .cse11) (not (<= 2 .cse1)) (and .cse2 .cse3 (<= 0 (select .cse12 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse4 .cse5 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse8)) .cse6 .cse9 .cse10 .cse11))))))) [2022-11-23 03:31:16,090 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-23 03:31:16,090 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse0 (= |old(#valid)| |#valid|))) (and (let ((.cse1 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))) (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse0) (not (<= 0 .cse1)) (not (<= .cse1 2147483647)))) (or (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)) (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse0))) [2022-11-23 03:31:16,090 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-23 03:31:16,090 INFO L895 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: (let ((.cse9 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse0 (not .cse9))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse12 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse8 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse1 (select .cse7 12)) (.cse2 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse8)) (.cse3 (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse4 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|)) (.cse6 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse10 (<= (select .cse12 12) 2)) (.cse11 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse1 2)) .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse7 .cse8 v_ArrVal_521))) (<= (select .cse7 .cse8) (+ v_ArrVal_521 1)))) .cse9 .cse10 (= |old(#valid)| |#valid|) .cse11) (not (<= 2 .cse1)) (and .cse2 .cse3 (<= 0 (select .cse12 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse4 .cse5 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse8)) .cse6 .cse9 .cse10 .cse11))))))) [2022-11-23 03:31:16,091 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-23 03:31:16,091 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-23 03:31:16,091 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-11-23 03:31:16,091 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-11-23 03:31:16,092 INFO L895 garLoopResultBuilder]: At program point L-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-11-23 03:31:16,092 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-11-23 03:31:16,092 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-11-23 03:31:16,092 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-23 03:31:16,096 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:31:16,098 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:31:16,129 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,130 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,132 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,133 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,136 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,138 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,147 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:31:16 BoogieIcfgContainer [2022-11-23 03:31:16,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:31:16,150 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:31:16,150 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:31:16,150 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:31:16,151 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:30:18" (3/4) ... [2022-11-23 03:31:16,154 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 03:31:16,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-23 03:31:16,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-23 03:31:16,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-23 03:31:16,167 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2022-11-23 03:31:16,167 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-23 03:31:16,167 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-23 03:31:16,192 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]) && !(\result == 0)) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) || (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) [2022-11-23 03:31:16,193 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-11-23 03:31:16,194 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-11-23 03:31:16,194 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 <= \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12]) || !(\old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= 2147483647)) || \old(\valid) == \valid) && (!(#in~kobj == 0) || !(#in~kobj == 0))) && (((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || ((((((((v == #in~kobj + 12 && kobj == #in~kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#in~kobj := \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) [2022-11-23 03:31:16,194 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(#in~kobj == 0) || !(#in~kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && temp <= 2) && #in~kobj == kobj) && v == #in~kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#in~kobj := \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= v_ArrVal_521 + 1)) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && #in~kobj == kobj) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) [2022-11-23 03:31:16,195 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(#in~kobj == 0) || !(#in~kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && temp <= 2) && #in~kobj == kobj) && v == #in~kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#in~kobj := \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= v_ArrVal_521 + 1)) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && #in~kobj == kobj) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) [2022-11-23 03:31:16,195 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || ((((((((v == #in~kobj + 12 && kobj == #in~kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) && (!(#in~kobj == 0) || !(#in~kobj == 0)) [2022-11-23 03:31:16,211 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:31:16,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:31:16,216 INFO L158 Benchmark]: Toolchain (without parser) took 59399.44ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 100.1MB in the beginning and 110.2MB in the end (delta: -10.0MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2022-11-23 03:31:16,216 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 146.8MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:31:16,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.19ms. Allocated memory is still 146.8MB. Free memory was 100.1MB in the beginning and 78.7MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 03:31:16,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.81ms. Allocated memory is still 146.8MB. Free memory was 78.7MB in the beginning and 75.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 03:31:16,218 INFO L158 Benchmark]: Boogie Preprocessor took 64.24ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 75.9MB in the beginning and 165.4MB in the end (delta: -89.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-11-23 03:31:16,218 INFO L158 Benchmark]: RCFGBuilder took 817.33ms. Allocated memory is still 195.0MB. Free memory was 165.4MB in the beginning and 148.4MB in the end (delta: 17.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-11-23 03:31:16,218 INFO L158 Benchmark]: TraceAbstraction took 57648.92ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 147.6MB in the beginning and 114.4MB in the end (delta: 33.2MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2022-11-23 03:31:16,220 INFO L158 Benchmark]: Witness Printer took 65.41ms. Allocated memory is still 234.9MB. Free memory was 114.4MB in the beginning and 110.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 03:31:16,221 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.34ms. Allocated memory is still 146.8MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.19ms. Allocated memory is still 146.8MB. Free memory was 100.1MB in the beginning and 78.7MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.81ms. Allocated memory is still 146.8MB. Free memory was 78.7MB in the beginning and 75.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.24ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 75.9MB in the beginning and 165.4MB in the end (delta: -89.5MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * RCFGBuilder took 817.33ms. Allocated memory is still 195.0MB. Free memory was 165.4MB in the beginning and 148.4MB in the end (delta: 17.0MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57648.92ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 147.6MB in the beginning and 114.4MB in the end (delta: 33.2MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. * Witness Printer took 65.41ms. Allocated memory is still 234.9MB. Free memory was 114.4MB in the beginning and 110.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, 54 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 57.5s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1103 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1089 mSDsluCounter, 3691 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 356 IncrementalHoareTripleChecker+Unchecked, 3144 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4103 IncrementalHoareTripleChecker+Invalid, 4699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 547 mSDtfsCounter, 4103 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 333 SyntacticMatches, 2 SemanticMatches, 314 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 39.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=13, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 129 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 184 PreInvPairs, 295 NumberOfFragments, 1217 HoareAnnotationTreeSize, 184 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2401 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 767 ConstructedInterpolants, 16 QuantifiedInterpolants, 3600 SizeOfPredicates, 382 NumberOfNonLiveVariables, 2502 ConjunctsInSsa, 898 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 52/127 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: 663]: Loop Invariant [2022-11-23 03:31:16,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,244 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,245 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,247 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: (((!(0 <= \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12]) || !(\old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= 2147483647)) || \old(\valid) == \valid) && (!(#in~kobj == 0) || !(#in~kobj == 0))) && (((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || ((((((((v == #in~kobj + 12 && kobj == #in~kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#in~kobj := \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) - 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]) && !(\result == 0)) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) || (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 671]: Loop Invariant [2022-11-23 03:31:16,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,253 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,254 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,255 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: (!(#in~kobj == 0) || !(#in~kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && temp <= 2) && #in~kobj == kobj) && v == #in~kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#in~kobj := \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= v_ArrVal_521 + 1)) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && #in~kobj == kobj) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) - 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: 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: -1]: Loop Invariant Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || ((((((((v == #in~kobj + 12 && kobj == #in~kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) && (!(#in~kobj == 0) || !(#in~kobj == 0)) - 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: 688]: Loop Invariant [2022-11-23 03:31:16,265 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,266 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-23 03:31:16,267 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: (!(#in~kobj == 0) || !(#in~kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[#in~kobj][12] <= 2) || !(#in~kobj == 0)) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && temp <= 2) && #in~kobj == kobj) && v == #in~kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[#in~kobj := \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[#in~kobj][#in~kobj + 12] <= v_ArrVal_521 + 1)) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[#in~kobj][12])) || (((((((((v == #in~kobj + 12 && kobj == #in~kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && #in~kobj == kobj) && \result <= unknown-#memory_int-unknown[#in~kobj][#in~kobj + 12]) && v == #in~kobj) && #in~kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) RESULT: Ultimate proved your program to be correct! [2022-11-23 03:31:16,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2827eca7-83ee-4c07-aede-13b2de1bdad1/bin/uautomizer-QkZJyEgLgS/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