./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_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_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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 b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:35:48,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:35:48,854 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-29 00:35:48,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:35:48,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:35:48,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:35:48,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:35:48,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:35:48,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:35:48,886 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:35:48,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:35:48,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:35:48,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:35:48,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:35:48,889 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:35:48,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:35:48,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:35:48,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:35:48,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:35:48,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:35:48,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:35:48,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:35:48,892 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 00:35:48,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:35:48,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:35:48,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:35:48,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:35:48,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:35:48,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:35:48,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:35:48,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:48,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:35:48,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:35:48,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:35:48,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:35:48,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:35:48,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:35:48,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:35:48,909 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:35:48,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:35:48,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:35:48,909 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_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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 -> b4fc024eb4a291394a4ae1b1322682ed27f27b7bc4916ad7f6f7dabc24e8b4cb [2023-11-29 00:35:49,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:35:49,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:35:49,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:35:49,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:35:49,144 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:35:49,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2023-11-29 00:35:51,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:35:52,214 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:35:52,214 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_15_good.i [2023-11-29 00:35:52,237 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/data/6b978bf20/b6e075f3121a4af09700b8316c2d0ba8/FLAG1645f4f3c [2023-11-29 00:35:52,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/data/6b978bf20/b6e075f3121a4af09700b8316c2d0ba8 [2023-11-29 00:35:52,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:35:52,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:35:52,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:52,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:35:52,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:35:52,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:52" (1/1) ... [2023-11-29 00:35:52,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70da4a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:52, skipping insertion in model container [2023-11-29 00:35:52,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:52" (1/1) ... [2023-11-29 00:35:52,326 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:35:53,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:53,104 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:35:53,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:53,389 WARN L675 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:35:53,389 WARN L675 CHandler]: The function __ctype_b_loc is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:35:53,390 WARN L675 CHandler]: The function iswxdigit is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:35:53,390 WARN L675 CHandler]: The function time is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:35:53,398 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:35:53,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53 WrapperNode [2023-11-29 00:35:53,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:53,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:35:53,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:35:53,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:35:53,408 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:35:53" (1/1) ... [2023-11-29 00:35:53,437 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:35:53" (1/1) ... [2023-11-29 00:35:53,468 INFO L138 Inliner]: procedures = 502, calls = 82, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 175 [2023-11-29 00:35:53,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:35:53,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:35:53,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:35:53,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:35:53,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,506 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:35:53,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:35:53,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:35:53,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:35:53,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:35:53,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (1/1) ... [2023-11-29 00:35:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:53,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:35:53,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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:35:53,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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:35:53,596 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2023-11-29 00:35:53,597 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2023-11-29 00:35:53,597 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2023-11-29 00:35:53,597 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2023-11-29 00:35:53,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:35:53,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:35:53,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:35:53,598 INFO L130 BoogieDeclarations]: Found specification of procedure time [2023-11-29 00:35:53,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:35:53,760 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:35:53,762 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:35:53,956 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:35:53,990 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:35:53,991 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:35:53,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:35:53 BoogieIcfgContainer [2023-11-29 00:35:53,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:35:53,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:35:53,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:35:53,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:35:53,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:35:52" (1/3) ... [2023-11-29 00:35:53,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb01d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:35:53, skipping insertion in model container [2023-11-29 00:35:53,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:53" (2/3) ... [2023-11-29 00:35:54,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb01d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:35:53, skipping insertion in model container [2023-11-29 00:35:54,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:35:53" (3/3) ... [2023-11-29 00:35:54,001 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_15_good.i [2023-11-29 00:35:54,023 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:35:54,023 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-29 00:35:54,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:35:54,083 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;@372854a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:35:54,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-29 00:35:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 67 states have internal predecessors, (90), 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:35:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:35:54,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:54,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:54,098 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:35:54,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1108735124, now seen corresponding path program 1 times [2023-11-29 00:35:54,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:54,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596262362] [2023-11-29 00:35:54,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:54,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,382 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:35:54,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:54,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596262362] [2023-11-29 00:35:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596262362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:54,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032756849] [2023-11-29 00:35:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:54,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:54,445 INFO L87 Difference]: Start difference. First operand has 86 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 67 states have internal predecessors, (90), 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:35:54,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:54,516 INFO L93 Difference]: Finished difference Result 166 states and 234 transitions. [2023-11-29 00:35:54,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:54,519 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:35:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:54,527 INFO L225 Difference]: With dead ends: 166 [2023-11-29 00:35:54,527 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 00:35:54,531 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:35:54,534 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 5 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:54,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 222 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 00:35:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-11-29 00:35:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 66 states have internal predecessors, (88), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 00:35:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2023-11-29 00:35:54,582 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 14 [2023-11-29 00:35:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:54,583 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2023-11-29 00:35:54,583 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:35:54,583 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2023-11-29 00:35:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:35:54,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:54,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:54,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:35:54,586 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:35:54,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1518396922, now seen corresponding path program 1 times [2023-11-29 00:35:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336149047] [2023-11-29 00:35:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,652 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:35:54,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:54,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336149047] [2023-11-29 00:35:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336149047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:54,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:54,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162782784] [2023-11-29 00:35:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:54,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:54,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:54,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:54,656 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:35:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:54,685 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2023-11-29 00:35:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2023-11-29 00:35:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:54,687 INFO L225 Difference]: With dead ends: 141 [2023-11-29 00:35:54,688 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 00:35:54,689 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:35:54,690 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:54,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 00:35:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 00:35:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 54 states have internal predecessors, (70), 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:35:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2023-11-29 00:35:54,702 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 15 [2023-11-29 00:35:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:54,703 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2023-11-29 00:35:54,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:35:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2023-11-29 00:35:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 00:35:54,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:54,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:54,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:35:54,705 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:54,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 277890740, now seen corresponding path program 1 times [2023-11-29 00:35:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599245326] [2023-11-29 00:35:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,757 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:35:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599245326] [2023-11-29 00:35:54,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599245326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:54,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:54,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788042674] [2023-11-29 00:35:54,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:54,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:54,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:54,760 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:35:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:54,784 INFO L93 Difference]: Finished difference Result 123 states and 166 transitions. [2023-11-29 00:35:54,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-29 00:35:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:54,786 INFO L225 Difference]: With dead ends: 123 [2023-11-29 00:35:54,786 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 00:35:54,787 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:35:54,789 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 160 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:35:54,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 160 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 00:35:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 00:35:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 54 states have internal predecessors, (69), 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:35:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2023-11-29 00:35:54,798 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 18 [2023-11-29 00:35:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:54,798 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2023-11-29 00:35:54,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:35:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2023-11-29 00:35:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 00:35:54,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:54,800 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] [2023-11-29 00:35:54,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:35:54,800 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:35:54,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1118157740, now seen corresponding path program 1 times [2023-11-29 00:35:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069731099] [2023-11-29 00:35:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 00:35:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,855 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:35:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:54,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069731099] [2023-11-29 00:35:54,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069731099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144018351] [2023-11-29 00:35:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:54,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:54,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:54,858 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:35:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:54,879 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2023-11-29 00:35:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2023-11-29 00:35:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:54,881 INFO L225 Difference]: With dead ends: 123 [2023-11-29 00:35:54,881 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 00:35:54,882 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:35:54,883 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 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:35:54,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 00:35:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-11-29 00:35:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 53 states have internal predecessors, (67), 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:35:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2023-11-29 00:35:54,891 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 23 [2023-11-29 00:35:54,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:54,892 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2023-11-29 00:35:54,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:35:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2023-11-29 00:35:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:35:54,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:54,893 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] [2023-11-29 00:35:54,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:35:54,894 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:35:54,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 857860882, now seen corresponding path program 1 times [2023-11-29 00:35:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402913123] [2023-11-29 00:35:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,955 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:35:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402913123] [2023-11-29 00:35:54,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402913123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:54,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102046285] [2023-11-29 00:35:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:54,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:54,958 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:35:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:54,988 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2023-11-29 00:35:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 26 [2023-11-29 00:35:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:54,990 INFO L225 Difference]: With dead ends: 117 [2023-11-29 00:35:54,990 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 00:35:54,991 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:35:54,992 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:54,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 155 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 00:35:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2023-11-29 00:35:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 57 states have internal predecessors, (72), 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:35:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2023-11-29 00:35:55,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 26 [2023-11-29 00:35:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,001 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2023-11-29 00:35:55,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:35:55,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2023-11-29 00:35:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 00:35:55,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,003 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] [2023-11-29 00:35:55,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:35:55,004 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:35:55,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1756197432, now seen corresponding path program 1 times [2023-11-29 00:35:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641105694] [2023-11-29 00:35:55,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,054 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:35:55,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641105694] [2023-11-29 00:35:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641105694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:55,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421264459] [2023-11-29 00:35:55,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,057 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:35:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,075 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2023-11-29 00:35:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 27 [2023-11-29 00:35:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,077 INFO L225 Difference]: With dead ends: 110 [2023-11-29 00:35:55,077 INFO L226 Difference]: Without dead ends: 57 [2023-11-29 00:35:55,077 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:35:55,078 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 131 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:35:55,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 131 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-29 00:35:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-29 00:35:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.302325581395349) internal successors, (56), 46 states have internal predecessors, (56), 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:35:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2023-11-29 00:35:55,085 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 27 [2023-11-29 00:35:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,085 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2023-11-29 00:35:55,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:35:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2023-11-29 00:35:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:35:55,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,087 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, 1, 1] [2023-11-29 00:35:55,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:35:55,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1284875332, now seen corresponding path program 1 times [2023-11-29 00:35:55,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296899615] [2023-11-29 00:35:55,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,133 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:35:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296899615] [2023-11-29 00:35:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296899615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115778271] [2023-11-29 00:35:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,136 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:35:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,151 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2023-11-29 00:35:55,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:35:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,152 INFO L225 Difference]: With dead ends: 92 [2023-11-29 00:35:55,152 INFO L226 Difference]: Without dead ends: 54 [2023-11-29 00:35:55,153 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:35:55,154 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 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:35:55,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-29 00:35:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-29 00:35:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 44 states have internal predecessors, (52), 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:35:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2023-11-29 00:35:55,160 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 31 [2023-11-29 00:35:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,161 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2023-11-29 00:35:55,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:35:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2023-11-29 00:35:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 00:35:55,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 00:35:55,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:35:55,163 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1066500383, now seen corresponding path program 1 times [2023-11-29 00:35:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365447638] [2023-11-29 00:35:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:35:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365447638] [2023-11-29 00:35:55,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365447638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497343765] [2023-11-29 00:35:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,227 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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:35:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,247 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-11-29 00:35:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 38 [2023-11-29 00:35:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,249 INFO L225 Difference]: With dead ends: 54 [2023-11-29 00:35:55,249 INFO L226 Difference]: Without dead ends: 53 [2023-11-29 00:35:55,249 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:35:55,250 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 95 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:35:55,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-29 00:35:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-29 00:35:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 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:35:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2023-11-29 00:35:55,255 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 38 [2023-11-29 00:35:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,256 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2023-11-29 00:35:55,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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:35:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2023-11-29 00:35:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 00:35:55,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 00:35:55,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:35:55,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1298226327, now seen corresponding path program 1 times [2023-11-29 00:35:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693454296] [2023-11-29 00:35:55,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:35:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693454296] [2023-11-29 00:35:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693454296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115922046] [2023-11-29 00:35:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,331 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:35:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,355 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2023-11-29 00:35:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 39 [2023-11-29 00:35:55,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,356 INFO L225 Difference]: With dead ends: 81 [2023-11-29 00:35:55,356 INFO L226 Difference]: Without dead ends: 64 [2023-11-29 00:35:55,357 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:35:55,357 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:55,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-29 00:35:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2023-11-29 00:35:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 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:35:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2023-11-29 00:35:55,363 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 39 [2023-11-29 00:35:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,364 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-11-29 00:35:55,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:35:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2023-11-29 00:35:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 00:35:55,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 00:35:55,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:35:55,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1240968025, now seen corresponding path program 1 times [2023-11-29 00:35:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934265873] [2023-11-29 00:35:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:35:55,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934265873] [2023-11-29 00:35:55,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934265873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275588409] [2023-11-29 00:35:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,415 INFO L87 Difference]: Start difference. First operand 58 states and 71 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, (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:35:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,432 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2023-11-29 00:35:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,433 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, (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 39 [2023-11-29 00:35:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,434 INFO L225 Difference]: With dead ends: 87 [2023-11-29 00:35:55,434 INFO L226 Difference]: Without dead ends: 58 [2023-11-29 00:35:55,434 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:35:55,435 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 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:35:55,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-29 00:35:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-29 00:35:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 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:35:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2023-11-29 00:35:55,441 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 39 [2023-11-29 00:35:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,441 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2023-11-29 00:35:55,442 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, (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:35:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2023-11-29 00:35:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:35:55,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,443 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:35:55,443 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1597852403, now seen corresponding path program 1 times [2023-11-29 00:35:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698340069] [2023-11-29 00:35:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 00:35:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 00:35:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698340069] [2023-11-29 00:35:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698340069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218333097] [2023-11-29 00:35:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,497 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:35:55,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,513 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2023-11-29 00:35:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,513 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), 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 44 [2023-11-29 00:35:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,514 INFO L225 Difference]: With dead ends: 81 [2023-11-29 00:35:55,514 INFO L226 Difference]: Without dead ends: 50 [2023-11-29 00:35:55,515 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:35:55,515 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 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:35:55,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-29 00:35:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-29 00:35:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 00:35:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-11-29 00:35:55,520 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 44 [2023-11-29 00:35:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,521 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-29 00:35:55,521 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), 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:35:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-11-29 00:35:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 00:35:55,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,522 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 00:35:55,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:35:55,522 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1358551996, now seen corresponding path program 1 times [2023-11-29 00:35:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921760386] [2023-11-29 00:35:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:35:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921760386] [2023-11-29 00:35:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921760386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168095868] [2023-11-29 00:35:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,572 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:35:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,585 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-11-29 00:35:55,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 43 [2023-11-29 00:35:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,586 INFO L225 Difference]: With dead ends: 66 [2023-11-29 00:35:55,586 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 00:35:55,586 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:35:55,587 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 86 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:35:55,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 86 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 00:35:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-29 00:35:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:35:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2023-11-29 00:35:55,591 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 43 [2023-11-29 00:35:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,591 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2023-11-29 00:35:55,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:35:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2023-11-29 00:35:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 00:35:55,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,593 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 00:35:55,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:35:55,593 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:35:55,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -60602609, now seen corresponding path program 1 times [2023-11-29 00:35:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041396690] [2023-11-29 00:35:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 00:35:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:35:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041396690] [2023-11-29 00:35:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041396690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159451951] [2023-11-29 00:35:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,660 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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:35:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,676 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2023-11-29 00:35:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 49 [2023-11-29 00:35:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,677 INFO L225 Difference]: With dead ends: 47 [2023-11-29 00:35:55,677 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 00:35:55,677 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:35:55,678 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 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:35:55,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 00:35:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 00:35:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:35:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2023-11-29 00:35:55,682 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 49 [2023-11-29 00:35:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,682 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2023-11-29 00:35:55,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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:35:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2023-11-29 00:35:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 00:35:55,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 00:35:55,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:35:55,684 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1878680669, now seen corresponding path program 1 times [2023-11-29 00:35:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824481111] [2023-11-29 00:35:55,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 00:35:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:35:55,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824481111] [2023-11-29 00:35:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824481111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868581501] [2023-11-29 00:35:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,746 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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:35:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,762 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2023-11-29 00:35:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 50 [2023-11-29 00:35:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,763 INFO L225 Difference]: With dead ends: 52 [2023-11-29 00:35:55,763 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 00:35:55,763 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:35:55,764 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:55,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 00:35:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-29 00:35:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:35:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2023-11-29 00:35:55,767 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 50 [2023-11-29 00:35:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,768 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2023-11-29 00:35:55,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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:35:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2023-11-29 00:35:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 00:35:55,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:55,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-11-29 00:35:55,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:35:55,769 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-29 00:35:55,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -689638541, now seen corresponding path program 1 times [2023-11-29 00:35:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:35:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638246600] [2023-11-29 00:35:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:35:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:35:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:35:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 00:35:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 00:35:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:35:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:35:55,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638246600] [2023-11-29 00:35:55,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638246600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:55,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:55,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:35:55,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060208754] [2023-11-29 00:35:55,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:55,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:55,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:35:55,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:55,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:55,822 INFO L87 Difference]: Start difference. First operand 46 states and 50 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, (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:35:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:55,833 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2023-11-29 00:35:55,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:55,833 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, (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 51 [2023-11-29 00:35:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:55,834 INFO L225 Difference]: With dead ends: 50 [2023-11-29 00:35:55,834 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:35:55,834 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:35:55,835 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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:35:55,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:35:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:35:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:35:55,836 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:35:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:35:55,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2023-11-29 00:35:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:55,837 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:35:55,837 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, (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:35:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:35:55,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:35:55,839 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-29 00:35:55,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-29 00:35:55,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-29 00:35:55,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-29 00:35:55,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-29 00:35:55,840 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-29 00:35:55,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-29 00:35:55,841 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-29 00:35:55,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:35:55,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:35:55,881 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2023-11-29 00:35:55,882 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2023-11-29 00:35:55,882 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2023-11-29 00:35:55,882 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2023-11-29 00:35:55,882 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2023-11-29 00:35:55,882 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2023-11-29 00:35:55,882 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2023-11-29 00:35:55,882 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2023-11-29 00:35:55,882 INFO L899 garLoopResultBuilder]: For program point L1629(lines 1629 1641) no Hoare annotation was computed. [2023-11-29 00:35:55,882 INFO L899 garLoopResultBuilder]: For program point L1662-1(line 1662) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: false [2023-11-29 00:35:55,883 INFO L899 garLoopResultBuilder]: For program point L1572-1(line 1572) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2023-11-29 00:35:55,883 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2023-11-29 00:35:55,884 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2023-11-29 00:35:55,884 INFO L899 garLoopResultBuilder]: For program point L1564-1(line 1564) no Hoare annotation was computed. [2023-11-29 00:35:55,884 INFO L899 garLoopResultBuilder]: For program point L1597-2(line 1597) no Hoare annotation was computed. [2023-11-29 00:35:55,884 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2023-11-29 00:35:55,884 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2023-11-29 00:35:55,884 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2023-11-29 00:35:55,884 INFO L899 garLoopResultBuilder]: For program point L1647(lines 1647 1655) no Hoare annotation was computed. [2023-11-29 00:35:55,884 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2023-11-29 00:35:55,884 INFO L899 garLoopResultBuilder]: For program point L1639-1(line 1639) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point L1631-1(line 1631) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point L1656(lines 1656 1668) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point L1623-1(line 1623) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:35:55,885 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch105#1| [2023-11-29 00:35:55,885 INFO L899 garLoopResultBuilder]: For program point L1607-1(line 1607) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1566-1(line 1566) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1566-2(line 1566) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1558-1(line 1558) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2023-11-29 00:35:55,886 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1658-1(line 1658) no Hoare annotation was computed. [2023-11-29 00:35:55,887 INFO L895 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: false [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1592-1(line 1592) no Hoare annotation was computed. [2023-11-29 00:35:55,887 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch100#1| [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2023-11-29 00:35:55,887 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2023-11-29 00:35:55,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2023-11-29 00:35:55,888 INFO L899 garLoopResultBuilder]: For program point L1552(lines 1552 1560) no Hoare annotation was computed. [2023-11-29 00:35:55,888 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch110#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2023-11-29 00:35:55,888 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2023-11-29 00:35:55,888 INFO L899 garLoopResultBuilder]: For program point L1635-1(line 1635) no Hoare annotation was computed. [2023-11-29 00:35:55,888 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2023-11-29 00:35:55,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point L1561(lines 1561 1580) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point L1586(lines 1586 1594) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: false [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point L1603-1(line 1603) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2023-11-29 00:35:55,889 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point L1595(lines 1595 1614) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point L1620(lines 1620 1628) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point L1612-1(line 1612) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2023-11-29 00:35:55,890 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2023-11-29 00:35:55,894 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:35:55,896 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:35:55,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:35:55 BoogieIcfgContainer [2023-11-29 00:35:55,901 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:35:55,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:35:55,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:35:55,902 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:35:55,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:35:53" (3/4) ... [2023-11-29 00:35:55,904 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:35:55,908 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2023-11-29 00:35:55,908 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2023-11-29 00:35:55,915 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2023-11-29 00:35:55,915 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 00:35:55,916 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 00:35:55,916 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:35:55,917 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:35:56,023 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:35:56,024 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:35:56,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:35:56,025 INFO L158 Benchmark]: Toolchain (without parser) took 3769.74ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 89.5MB in the beginning and 147.9MB in the end (delta: -58.4MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2023-11-29 00:35:56,025 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:35:56,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1142.91ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 89.5MB in the beginning and 133.0MB in the end (delta: -43.4MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2023-11-29 00:35:56,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.99ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 129.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:35:56,026 INFO L158 Benchmark]: Boogie Preprocessor took 54.73ms. Allocated memory is still 188.7MB. Free memory was 129.8MB in the beginning and 126.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:35:56,026 INFO L158 Benchmark]: RCFGBuilder took 466.75ms. Allocated memory is still 188.7MB. Free memory was 126.7MB in the beginning and 106.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 00:35:56,027 INFO L158 Benchmark]: TraceAbstraction took 1906.57ms. Allocated memory is still 188.7MB. Free memory was 106.7MB in the beginning and 49.8MB in the end (delta: 56.9MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2023-11-29 00:35:56,027 INFO L158 Benchmark]: Witness Printer took 122.68ms. Allocated memory is still 188.7MB. Free memory was 49.8MB in the beginning and 147.9MB in the end (delta: -98.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:35:56,029 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.18ms. Allocated memory is still 132.1MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1142.91ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 89.5MB in the beginning and 133.0MB in the end (delta: -43.4MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.99ms. Allocated memory is still 188.7MB. Free memory was 133.0MB in the beginning and 129.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.73ms. Allocated memory is still 188.7MB. Free memory was 129.8MB in the beginning and 126.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.75ms. Allocated memory is still 188.7MB. Free memory was 126.7MB in the beginning and 106.7MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1906.57ms. Allocated memory is still 188.7MB. Free memory was 106.7MB in the beginning and 49.8MB in the end (delta: 56.9MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 122.68ms. Allocated memory is still 188.7MB. Free memory was 49.8MB in the beginning and 147.9MB in the end (delta: -98.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: 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, 86 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 1851 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 883 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 968 mSDtfsCounter, 210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 93 PreInvPairs, 99 NumberOfFragments, 24 HoareAnnotationTreeSize, 93 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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:35:56,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d94e33e3-c137-4ca4-bd96-8919a02dc2ad/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