./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash 75f94ec890a31cd0d9e6ecdb36e033f6c1d3a88cbf7a148d56b584438268f28f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:17:23,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:17:23,929 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-29 00:17:23,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:17:23,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:17:23,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:17:23,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:17:23,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:17:23,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:17:23,961 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:17:23,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:17:23,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:17:23,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:17:23,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:17:23,964 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:17:23,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:17:23,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:17:23,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:17:23,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:17:23,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:17:23,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:17:23,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:17:23,971 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 00:17:23,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:17:23,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:17:23,972 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:17:23,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:17:23,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:17:23,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:17:23,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:17:23,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:17:23,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:17:23,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:17:23,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:17:23,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:17:23,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:17:23,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:17:23,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:17:23,977 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:17:23,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:17:23,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:17:23,978 INFO L153 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_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/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_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 75f94ec890a31cd0d9e6ecdb36e033f6c1d3a88cbf7a148d56b584438268f28f [2023-11-29 00:17:24,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:17:24,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:17:24,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:17:24,245 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:17:24,246 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:17:24,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i [2023-11-29 00:17:26,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:17:27,199 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:17:27,200 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_add_15_good.i [2023-11-29 00:17:27,225 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/data/4fca10359/efd8363e56fa4e7687daf5cfd927c15c/FLAG8a4646d8e [2023-11-29 00:17:27,239 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/data/4fca10359/efd8363e56fa4e7687daf5cfd927c15c [2023-11-29 00:17:27,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:17:27,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:17:27,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:17:27,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:17:27,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:17:27,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:17:27" (1/1) ... [2023-11-29 00:17:27,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de1e419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:27, skipping insertion in model container [2023-11-29 00:17:27,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:17:27" (1/1) ... [2023-11-29 00:17:27,309 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:17:27,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:17:27,976 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:17:28,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:17:28,165 WARN L675 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:17:28,165 WARN L675 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:17:28,165 WARN L675 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:17:28,166 WARN L675 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:17:28,172 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:17:28,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28 WrapperNode [2023-11-29 00:17:28,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:17:28,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:17:28,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:17:28,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:17:28,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,240 INFO L138 Inliner]: procedures = 502, calls = 82, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 271 [2023-11-29 00:17:28,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:17:28,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:17:28,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:17:28,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:17:28,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,283 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2023-11-29 00:17:28,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:17:28,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:17:28,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:17:28,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:17:28,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (1/1) ... [2023-11-29 00:17:28,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:17:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:17:28,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:17:28,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:17:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-11-29 00:17:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-11-29 00:17:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-11-29 00:17:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-11-29 00:17:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:17:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:17:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:17:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-11-29 00:17:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:17:28,539 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:17:28,541 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:17:28,837 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:17:28,867 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:17:28,868 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:17:28,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:17:28 BoogieIcfgContainer [2023-11-29 00:17:28,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:17:28,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:17:28,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:17:28,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:17:28,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:17:27" (1/3) ... [2023-11-29 00:17:28,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442a0865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:17:28, skipping insertion in model container [2023-11-29 00:17:28,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:17:28" (2/3) ... [2023-11-29 00:17:28,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442a0865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:17:28, skipping insertion in model container [2023-11-29 00:17:28,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:17:28" (3/3) ... [2023-11-29 00:17:28,877 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_add_15_good.i [2023-11-29 00:17:28,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:17:28,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-29 00:17:28,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:17:28,944 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=LoopHeads, 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;@726fc09b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:17:28,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 00:17:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 99 states have internal predecessors, (144), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 00:17:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:17:28,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:28,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:28,958 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:28,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash 385513625, now seen corresponding path program 1 times [2023-11-29 00:17:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141145308] [2023-11-29 00:17:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:29,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141145308] [2023-11-29 00:17:29,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141145308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:29,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412309487] [2023-11-29 00:17:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:29,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,238 INFO L87 Difference]: Start difference. First operand has 118 states, 91 states have (on average 1.5824175824175823) internal successors, (144), 99 states have internal predecessors, (144), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:17:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:29,294 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2023-11-29 00:17:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-29 00:17:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:29,306 INFO L225 Difference]: With dead ends: 211 [2023-11-29 00:17:29,306 INFO L226 Difference]: Without dead ends: 106 [2023-11-29 00:17:29,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,313 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 32 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:29,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 291 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-29 00:17:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-11-29 00:17:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.5714285714285714) internal successors, (132), 91 states have internal predecessors, (132), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:17:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2023-11-29 00:17:29,359 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 14 [2023-11-29 00:17:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:29,360 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2023-11-29 00:17:29,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:17:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2023-11-29 00:17:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 00:17:29,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:29,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:29,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:17:29,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:29,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1625395449, now seen corresponding path program 1 times [2023-11-29 00:17:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:29,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528738499] [2023-11-29 00:17:29,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:29,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:29,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528738499] [2023-11-29 00:17:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528738499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:29,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:29,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:17:29,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907216608] [2023-11-29 00:17:29,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:29,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:29,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,542 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-11-29 00:17:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:29,573 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2023-11-29 00:17:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:29,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2023-11-29 00:17:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:29,576 INFO L225 Difference]: With dead ends: 106 [2023-11-29 00:17:29,576 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 00:17:29,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,578 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:29,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 246 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 00:17:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-11-29 00:17:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:17:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2023-11-29 00:17:29,592 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 19 [2023-11-29 00:17:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:29,593 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2023-11-29 00:17:29,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-11-29 00:17:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2023-11-29 00:17:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 00:17:29,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:29,594 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] [2023-11-29 00:17:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:17:29,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:29,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1152348483, now seen corresponding path program 1 times [2023-11-29 00:17:29,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244398809] [2023-11-29 00:17:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:29,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244398809] [2023-11-29 00:17:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244398809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:29,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:17:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150722669] [2023-11-29 00:17:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:29,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:29,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:29,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,664 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2023-11-29 00:17:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:29,692 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2023-11-29 00:17:29,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:29,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2023-11-29 00:17:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:29,695 INFO L225 Difference]: With dead ends: 106 [2023-11-29 00:17:29,695 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 00:17:29,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,697 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 33 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:29,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 257 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 00:17:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2023-11-29 00:17:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.5476190476190477) internal successors, (130), 89 states have internal predecessors, (130), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:17:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2023-11-29 00:17:29,709 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 20 [2023-11-29 00:17:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:29,710 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2023-11-29 00:17:29,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2023-11-29 00:17:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2023-11-29 00:17:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 00:17:29,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:29,712 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] [2023-11-29 00:17:29,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:17:29,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:29,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash 290880789, now seen corresponding path program 1 times [2023-11-29 00:17:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:29,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477213479] [2023-11-29 00:17:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:29,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477213479] [2023-11-29 00:17:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477213479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:29,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:29,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:29,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123912909] [2023-11-29 00:17:29,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:29,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:29,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:29,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:29,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,766 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-11-29 00:17:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:29,789 INFO L93 Difference]: Finished difference Result 174 states and 254 transitions. [2023-11-29 00:17:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 24 [2023-11-29 00:17:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:29,791 INFO L225 Difference]: With dead ends: 174 [2023-11-29 00:17:29,791 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 00:17:29,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,794 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 8 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:29,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 280 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 00:17:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-29 00:17:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.5357142857142858) internal successors, (129), 89 states have internal predecessors, (129), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 00:17:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2023-11-29 00:17:29,805 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 24 [2023-11-29 00:17:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:29,805 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2023-11-29 00:17:29,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-11-29 00:17:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2023-11-29 00:17:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 00:17:29,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:29,807 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:17:29,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:17:29,808 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:29,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 13235577, now seen corresponding path program 1 times [2023-11-29 00:17:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:29,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121503909] [2023-11-29 00:17:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:29,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 00:17:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:17:29,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121503909] [2023-11-29 00:17:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121503909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:29,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:29,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:29,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050360261] [2023-11-29 00:17:29,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:29,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:29,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:29,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,866 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:17:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:29,888 INFO L93 Difference]: Finished difference Result 174 states and 253 transitions. [2023-11-29 00:17:29,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:29,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-11-29 00:17:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:29,890 INFO L225 Difference]: With dead ends: 174 [2023-11-29 00:17:29,890 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 00:17:29,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,892 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:29,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 00:17:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 00:17:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 88 states have internal predecessors, (127), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 00:17:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2023-11-29 00:17:29,901 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 29 [2023-11-29 00:17:29,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:29,901 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2023-11-29 00:17:29,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:17:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2023-11-29 00:17:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:17:29,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:29,903 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] [2023-11-29 00:17:29,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:17:29,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:29,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash 89198750, now seen corresponding path program 1 times [2023-11-29 00:17:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033047002] [2023-11-29 00:17:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033047002] [2023-11-29 00:17:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033047002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:29,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:29,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322665792] [2023-11-29 00:17:29,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:29,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:29,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:29,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,957 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:29,975 INFO L93 Difference]: Finished difference Result 149 states and 210 transitions. [2023-11-29 00:17:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:29,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-11-29 00:17:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:29,976 INFO L225 Difference]: With dead ends: 149 [2023-11-29 00:17:29,977 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 00:17:29,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:29,978 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:29,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 242 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 00:17:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 00:17:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 86 states have internal predecessors, (123), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 00:17:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2023-11-29 00:17:29,986 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 31 [2023-11-29 00:17:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:29,986 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2023-11-29 00:17:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2023-11-29 00:17:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 00:17:29,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:29,988 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, 1, 1] [2023-11-29 00:17:29,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:17:29,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:29,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash 29663845, now seen corresponding path program 1 times [2023-11-29 00:17:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:29,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323543079] [2023-11-29 00:17:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323543079] [2023-11-29 00:17:30,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323543079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:17:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106607162] [2023-11-29 00:17:30,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,098 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,120 INFO L93 Difference]: Finished difference Result 99 states and 143 transitions. [2023-11-29 00:17:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2023-11-29 00:17:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,122 INFO L225 Difference]: With dead ends: 99 [2023-11-29 00:17:30,122 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 00:17:30,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,123 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 41 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 221 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 00:17:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 00:17:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 85 states have internal predecessors, (122), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 00:17:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-11-29 00:17:30,130 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 36 [2023-11-29 00:17:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,131 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-11-29 00:17:30,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-11-29 00:17:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 00:17:30,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,132 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, 1, 1, 1] [2023-11-29 00:17:30,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:17:30,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,133 INFO L85 PathProgramCache]: Analyzing trace with hash 919579457, now seen corresponding path program 1 times [2023-11-29 00:17:30,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375637001] [2023-11-29 00:17:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:30,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375637001] [2023-11-29 00:17:30,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375637001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:17:30,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468312011] [2023-11-29 00:17:30,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,200 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,223 INFO L93 Difference]: Finished difference Result 99 states and 143 transitions. [2023-11-29 00:17:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2023-11-29 00:17:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,225 INFO L225 Difference]: With dead ends: 99 [2023-11-29 00:17:30,225 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 00:17:30,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,226 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 33 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 232 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 00:17:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2023-11-29 00:17:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.4938271604938271) internal successors, (121), 84 states have internal predecessors, (121), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 00:17:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2023-11-29 00:17:30,233 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 37 [2023-11-29 00:17:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,233 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2023-11-29 00:17:30,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2023-11-29 00:17:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 00:17:30,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,235 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:30,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:17:30,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash 784226750, now seen corresponding path program 1 times [2023-11-29 00:17:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716249677] [2023-11-29 00:17:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:17:30,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716249677] [2023-11-29 00:17:30,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716249677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:30,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299324165] [2023-11-29 00:17:30,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,289 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,307 INFO L93 Difference]: Finished difference Result 130 states and 182 transitions. [2023-11-29 00:17:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2023-11-29 00:17:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,309 INFO L225 Difference]: With dead ends: 130 [2023-11-29 00:17:30,309 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 00:17:30,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,310 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 7 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 249 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 00:17:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-29 00:17:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 00:17:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2023-11-29 00:17:30,317 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 41 [2023-11-29 00:17:30,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,317 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2023-11-29 00:17:30,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:17:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2023-11-29 00:17:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 00:17:30,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:30,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:17:30,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1385960961, now seen corresponding path program 1 times [2023-11-29 00:17:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650332287] [2023-11-29 00:17:30,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:17:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:17:30,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650332287] [2023-11-29 00:17:30,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650332287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:17:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895392890] [2023-11-29 00:17:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,395 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:17:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,418 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2023-11-29 00:17:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-11-29 00:17:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,419 INFO L225 Difference]: With dead ends: 106 [2023-11-29 00:17:30,419 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 00:17:30,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,420 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 255 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 00:17:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-11-29 00:17:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 86 states have internal predecessors, (122), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 00:17:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-11-29 00:17:30,427 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 47 [2023-11-29 00:17:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,427 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-11-29 00:17:30,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:17:30,428 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-11-29 00:17:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 00:17:30,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:30,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:17:30,429 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1386020543, now seen corresponding path program 1 times [2023-11-29 00:17:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657057860] [2023-11-29 00:17:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:17:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:17:30,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657057860] [2023-11-29 00:17:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657057860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644962696] [2023-11-29 00:17:30,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,487 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:17:30,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,505 INFO L93 Difference]: Finished difference Result 126 states and 173 transitions. [2023-11-29 00:17:30,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-11-29 00:17:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,506 INFO L225 Difference]: With dead ends: 126 [2023-11-29 00:17:30,507 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 00:17:30,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,508 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 251 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 00:17:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 00:17:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 86 states have internal predecessors, (121), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 00:17:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2023-11-29 00:17:30,514 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 47 [2023-11-29 00:17:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,514 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2023-11-29 00:17:30,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:17:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2023-11-29 00:17:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 00:17:30,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,516 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2023-11-29 00:17:30,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:17:30,516 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash 224739147, now seen corresponding path program 1 times [2023-11-29 00:17:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463455223] [2023-11-29 00:17:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:17:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-29 00:17:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:17:30,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463455223] [2023-11-29 00:17:30,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463455223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095257586] [2023-11-29 00:17:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,582 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:17:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,599 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2023-11-29 00:17:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2023-11-29 00:17:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,601 INFO L225 Difference]: With dead ends: 120 [2023-11-29 00:17:30,601 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 00:17:30,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,602 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 00:17:30,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-29 00:17:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:17:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2023-11-29 00:17:30,607 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 52 [2023-11-29 00:17:30,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,607 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2023-11-29 00:17:30,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:17:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2023-11-29 00:17:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 00:17:30,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:30,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:17:30,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1324127250, now seen corresponding path program 1 times [2023-11-29 00:17:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246513669] [2023-11-29 00:17:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:17:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:17:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246513669] [2023-11-29 00:17:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246513669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080039089] [2023-11-29 00:17:30,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,669 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:17:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,684 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2023-11-29 00:17:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2023-11-29 00:17:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,686 INFO L225 Difference]: With dead ends: 105 [2023-11-29 00:17:30,686 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 00:17:30,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,687 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 227 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 00:17:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 00:17:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:17:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2023-11-29 00:17:30,716 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 52 [2023-11-29 00:17:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,716 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2023-11-29 00:17:30,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:17:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2023-11-29 00:17:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-29 00:17:30,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,717 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:30,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:17:30,718 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2135633364, now seen corresponding path program 1 times [2023-11-29 00:17:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347979990] [2023-11-29 00:17:30,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:17:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:17:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:17:30,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347979990] [2023-11-29 00:17:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347979990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:17:30,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425373085] [2023-11-29 00:17:30,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,815 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:17:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,836 INFO L93 Difference]: Finished difference Result 93 states and 127 transitions. [2023-11-29 00:17:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2023-11-29 00:17:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,838 INFO L225 Difference]: With dead ends: 93 [2023-11-29 00:17:30,838 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 00:17:30,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,839 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 229 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 00:17:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-29 00:17:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 00:17:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2023-11-29 00:17:30,845 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 57 [2023-11-29 00:17:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,845 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2023-11-29 00:17:30,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:17:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2023-11-29 00:17:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:17:30,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:17:30,847 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:30,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:17:30,847 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:17:30,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:17:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1778339992, now seen corresponding path program 1 times [2023-11-29 00:17:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:17:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153111010] [2023-11-29 00:17:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:17:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:17:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:17:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:17:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:17:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 00:17:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:17:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 00:17:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:17:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153111010] [2023-11-29 00:17:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153111010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:17:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:17:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:17:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791504871] [2023-11-29 00:17:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:17:30,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:17:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:17:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:17:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,917 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:17:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:17:30,930 INFO L93 Difference]: Finished difference Result 91 states and 125 transitions. [2023-11-29 00:17:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:17:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2023-11-29 00:17:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:17:30,931 INFO L225 Difference]: With dead ends: 91 [2023-11-29 00:17:30,931 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:17:30,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:17:30,932 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:17:30,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:17:30,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:17:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:17:30,933 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) [2023-11-29 00:17:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:17:30,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2023-11-29 00:17:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:17:30,934 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:17:30,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:17:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:17:30,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:17:30,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-29 00:17:30,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-29 00:17:30,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-29 00:17:30,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-29 00:17:30,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-29 00:17:30,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-29 00:17:30,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-29 00:17:30,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-29 00:17:30,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:17:30,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:17:30,993 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-11-29 00:17:30,993 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-11-29 00:17:30,993 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2023-11-29 00:17:30,993 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2023-11-29 00:17:30,993 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1554-17(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1554-19(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1554-21(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1554-23(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1554-24(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1554-26(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1554-28(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,994 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2023-11-29 00:17:30,994 INFO L899 garLoopResultBuilder]: For program point L1654-1(line 1654) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1554-30(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1554-31(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: false [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1589-1(line 1589) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L902 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: true [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: false [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1606-1(line 1606) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1634) no Hoare annotation was computed. [2023-11-29 00:17:30,995 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2023-11-29 00:17:30,996 INFO L899 garLoopResultBuilder]: For program point L1640(lines 1640 1648) no Hoare annotation was computed. [2023-11-29 00:17:30,996 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch112#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2023-11-29 00:17:30,996 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2023-11-29 00:17:30,996 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2023-11-29 00:17:30,996 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2023-11-29 00:17:30,996 INFO L899 garLoopResultBuilder]: For program point L1558-1(line 1558) no Hoare annotation was computed. [2023-11-29 00:17:30,996 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2023-11-29 00:17:30,996 INFO L899 garLoopResultBuilder]: For program point L1674-1(line 1674) no Hoare annotation was computed. [2023-11-29 00:17:30,996 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2023-11-29 00:17:30,996 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2023-11-29 00:17:30,996 INFO L899 garLoopResultBuilder]: For program point L1658-1(line 1658) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1608) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1594(line 1594) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1561(lines 1561 1577) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1594-1(line 1594) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2023-11-29 00:17:30,997 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch134#1| [2023-11-29 00:17:30,997 INFO L899 garLoopResultBuilder]: For program point L1628-1(line 1628) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: false [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point L1646-1(line 1646) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2023-11-29 00:17:30,998 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2023-11-29 00:17:30,998 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point L1564-1(line 1564) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1622) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch129#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: false [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point L1632-1(line 1632) no Hoare annotation was computed. [2023-11-29 00:17:30,999 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1566-1(line 1566) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 1660) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1616(line 1616) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1591) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L895 garLoopResultBuilder]: At program point L1617(line 1617) the Hoare annotation is: false [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1617-1(line 1617) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,000 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1560) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-2(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-4(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-6(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-8(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-9(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-11(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-13(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1585-15(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L895 garLoopResultBuilder]: At program point L1602(line 1602) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch129#1| (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2023-11-29 00:17:31,001 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-17(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-19(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-21(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-23(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-24(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-26(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-28(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1585-30(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,002 INFO L899 garLoopResultBuilder]: For program point L1619(line 1619) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1585-31(line 1585) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch112#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1570-1(line 1570) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1554-1(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1554-2(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1554-4(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,003 INFO L899 garLoopResultBuilder]: For program point L1554-6(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,004 INFO L899 garLoopResultBuilder]: For program point L1554-8(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,004 INFO L899 garLoopResultBuilder]: For program point L1554-9(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,004 INFO L899 garLoopResultBuilder]: For program point L1554-11(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,004 INFO L899 garLoopResultBuilder]: For program point L1554-13(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,004 INFO L899 garLoopResultBuilder]: For program point L1554-15(line 1554) no Hoare annotation was computed. [2023-11-29 00:17:31,007 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:17:31,009 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:17:31,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:17:31 BoogieIcfgContainer [2023-11-29 00:17:31,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:17:31,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:17:31,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:17:31,015 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:17:31,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:17:28" (3/4) ... [2023-11-29 00:17:31,017 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:17:31,021 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-11-29 00:17:31,021 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-11-29 00:17:31,029 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2023-11-29 00:17:31,029 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-29 00:17:31,030 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 00:17:31,031 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:17:31,031 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:17:31,141 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:17:31,141 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:17:31,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:17:31,142 INFO L158 Benchmark]: Toolchain (without parser) took 3899.11ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 142.5MB in the beginning and 119.6MB in the end (delta: 22.9MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2023-11-29 00:17:31,142 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 99.2MB in the beginning and 99.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:17:31,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 929.24ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 77.4MB in the end (delta: 65.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2023-11-29 00:17:31,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.62ms. Allocated memory is still 172.0MB. Free memory was 77.4MB in the beginning and 73.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:17:31,143 INFO L158 Benchmark]: Boogie Preprocessor took 70.79ms. Allocated memory is still 172.0MB. Free memory was 73.5MB in the beginning and 138.7MB in the end (delta: -65.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:17:31,144 INFO L158 Benchmark]: RCFGBuilder took 555.60ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 111.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 00:17:31,144 INFO L158 Benchmark]: TraceAbstraction took 2143.62ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 110.9MB in the beginning and 126.9MB in the end (delta: -16.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-11-29 00:17:31,144 INFO L158 Benchmark]: Witness Printer took 126.89ms. Allocated memory is still 207.6MB. Free memory was 126.9MB in the beginning and 119.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:17:31,146 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 99.2MB in the beginning and 99.0MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 929.24ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 77.4MB in the end (delta: 65.1MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.62ms. Allocated memory is still 172.0MB. Free memory was 77.4MB in the beginning and 73.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.79ms. Allocated memory is still 172.0MB. Free memory was 73.5MB in the beginning and 138.7MB in the end (delta: -65.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 555.60ms. Allocated memory is still 172.0MB. Free memory was 138.7MB in the beginning and 111.9MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2143.62ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 110.9MB in the beginning and 126.9MB in the end (delta: -16.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 126.89ms. Allocated memory is still 207.6MB. Free memory was 126.9MB in the beginning and 119.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 3715 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1722 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1993 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 80 PreInvPairs, 88 NumberOfFragments, 48 HoareAnnotationTreeSize, 80 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 549 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 28/28 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 00:17:31,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eddae8a0-096d-475c-a9d3-fa57f233c277/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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