./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB --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 32bit --witnessprinter.graph.data.programhash c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:21:29,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:21:29,736 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-27 20:21:29,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:21:29,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:21:29,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:21:29,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:21:29,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:21:29,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:21:29,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:21:29,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:21:29,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:21:29,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:21:29,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:21:29,781 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:21:29,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:21:29,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:21:29,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:21:29,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:21:29,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:21:29,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:21:29,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:21:29,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:21:29,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:21:29,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:21:29,786 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:21:29,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:21:29,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:21:29,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:21:29,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:21:29,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:21:29,787 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2024-11-27 20:21:30,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:21:30,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:21:30,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:21:30,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:21:30,176 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:21:30,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-11-27 20:21:33,241 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/data/69c138dfb/ac5b99f7b40b4cd9b9ef29e5de9d181a/FLAG7a3d553cd [2024-11-27 20:21:33,685 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:21:33,689 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-11-27 20:21:33,713 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/data/69c138dfb/ac5b99f7b40b4cd9b9ef29e5de9d181a/FLAG7a3d553cd [2024-11-27 20:21:33,847 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/data/69c138dfb/ac5b99f7b40b4cd9b9ef29e5de9d181a [2024-11-27 20:21:33,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:21:33,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:21:33,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:21:33,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:21:33,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:21:33,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:21:33" (1/1) ... [2024-11-27 20:21:33,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72dd077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:33, skipping insertion in model container [2024-11-27 20:21:33,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:21:33" (1/1) ... [2024-11-27 20:21:33,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:21:34,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:21:34,249 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:21:34,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:21:34,359 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:21:34,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34 WrapperNode [2024-11-27 20:21:34,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:21:34,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:21:34,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:21:34,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:21:34,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,443 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 847 [2024-11-27 20:21:34,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:21:34,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:21:34,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:21:34,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:21:34,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:21:34,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:21:34,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:21:34,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:21:34,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:21:34,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (1/1) ... [2024-11-27 20:21:34,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:21:34,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:34,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:21:34,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:21:34,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:21:34,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:21:34,610 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-27 20:21:34,610 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-27 20:21:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:21:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:21:34,740 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:21:34,742 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:21:35,851 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-11-27 20:21:35,851 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:21:35,871 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:21:35,871 INFO L312 CfgBuilder]: Removed 26 assume(true) statements. [2024-11-27 20:21:35,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:21:35 BoogieIcfgContainer [2024-11-27 20:21:35,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:21:35,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:21:35,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:21:35,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:21:35,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:21:33" (1/3) ... [2024-11-27 20:21:35,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9e5287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:21:35, skipping insertion in model container [2024-11-27 20:21:35,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:21:34" (2/3) ... [2024-11-27 20:21:35,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9e5287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:21:35, skipping insertion in model container [2024-11-27 20:21:35,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:21:35" (3/3) ... [2024-11-27 20:21:35,884 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2024-11-27 20:21:35,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:21:35,903 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.1.cil.c that has 2 procedures, 274 locations, 1 initial locations, 13 loop locations, and 8 error locations. [2024-11-27 20:21:35,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:21:35,991 INFO L333 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, 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;@8b4e6fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:21:35,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-27 20:21:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 259 states have (on average 1.8918918918918919) internal successors, (490), 272 states have internal predecessors, (490), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:21:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-27 20:21:36,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:36,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:36,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:36,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1985341752, now seen corresponding path program 1 times [2024-11-27 20:21:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622730253] [2024-11-27 20:21:36,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:36,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:36,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622730253] [2024-11-27 20:21:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622730253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:36,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763455869] [2024-11-27 20:21:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:36,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:36,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:36,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:36,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:36,408 INFO L87 Difference]: Start difference. First operand has 274 states, 259 states have (on average 1.8918918918918919) internal successors, (490), 272 states have internal predecessors, (490), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-27 20:21:37,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:37,069 INFO L93 Difference]: Finished difference Result 719 states and 1312 transitions. [2024-11-27 20:21:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:37,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2024-11-27 20:21:37,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:37,092 INFO L225 Difference]: With dead ends: 719 [2024-11-27 20:21:37,093 INFO L226 Difference]: Without dead ends: 430 [2024-11-27 20:21:37,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:37,107 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 257 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:37,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 768 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:21:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-27 20:21:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 416. [2024-11-27 20:21:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 408 states have (on average 1.6200980392156863) internal successors, (661), 415 states have internal predecessors, (661), 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) [2024-11-27 20:21:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 661 transitions. [2024-11-27 20:21:37,194 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 661 transitions. Word has length 17 [2024-11-27 20:21:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:37,195 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 661 transitions. [2024-11-27 20:21:37,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2024-11-27 20:21:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 661 transitions. [2024-11-27 20:21:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-27 20:21:37,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:37,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:37,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:21:37,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:37,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash -444981321, now seen corresponding path program 1 times [2024-11-27 20:21:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320278856] [2024-11-27 20:21:37,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:37,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:37,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320278856] [2024-11-27 20:21:37,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320278856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:37,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:37,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:21:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955250421] [2024-11-27 20:21:37,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:37,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:37,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:37,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:37,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:37,317 INFO L87 Difference]: Start difference. First operand 416 states and 661 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-11-27 20:21:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:37,492 INFO L93 Difference]: Finished difference Result 1052 states and 1686 transitions. [2024-11-27 20:21:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:37,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 21 [2024-11-27 20:21:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:37,500 INFO L225 Difference]: With dead ends: 1052 [2024-11-27 20:21:37,500 INFO L226 Difference]: Without dead ends: 650 [2024-11-27 20:21:37,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:37,505 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 231 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:37,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1030 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-27 20:21:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 642. [2024-11-27 20:21:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 634 states have (on average 1.613564668769716) internal successors, (1023), 641 states have internal predecessors, (1023), 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) [2024-11-27 20:21:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1023 transitions. [2024-11-27 20:21:37,549 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1023 transitions. Word has length 21 [2024-11-27 20:21:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:37,550 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 1023 transitions. [2024-11-27 20:21:37,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-11-27 20:21:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1023 transitions. [2024-11-27 20:21:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-27 20:21:37,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:37,553 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:37,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:21:37,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:37,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1228057549, now seen corresponding path program 1 times [2024-11-27 20:21:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:37,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098794778] [2024-11-27 20:21:37,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098794778] [2024-11-27 20:21:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098794778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:37,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:37,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:21:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759471201] [2024-11-27 20:21:37,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:37,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:21:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:37,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:21:37,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:21:37,785 INFO L87 Difference]: Start difference. First operand 642 states and 1023 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-11-27 20:21:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:38,394 INFO L93 Difference]: Finished difference Result 1532 states and 2456 transitions. [2024-11-27 20:21:38,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:21:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) Word has length 49 [2024-11-27 20:21:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:38,403 INFO L225 Difference]: With dead ends: 1532 [2024-11-27 20:21:38,403 INFO L226 Difference]: Without dead ends: 904 [2024-11-27 20:21:38,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:21:38,407 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 600 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:38,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1440 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:21:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-11-27 20:21:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 794. [2024-11-27 20:21:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 786 states have (on average 1.623409669211196) internal successors, (1276), 793 states have internal predecessors, (1276), 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) [2024-11-27 20:21:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1276 transitions. [2024-11-27 20:21:38,488 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1276 transitions. Word has length 49 [2024-11-27 20:21:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:38,490 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1276 transitions. [2024-11-27 20:21:38,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-11-27 20:21:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1276 transitions. [2024-11-27 20:21:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-27 20:21:38,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:38,497 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:38,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:21:38,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:38,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1003680411, now seen corresponding path program 1 times [2024-11-27 20:21:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743652863] [2024-11-27 20:21:38,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:38,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743652863] [2024-11-27 20:21:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743652863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:21:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706111840] [2024-11-27 20:21:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:38,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:21:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:38,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:21:38,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:21:38,679 INFO L87 Difference]: Start difference. First operand 794 states and 1276 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2024-11-27 20:21:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:38,989 INFO L93 Difference]: Finished difference Result 1958 states and 3140 transitions. [2024-11-27 20:21:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:21:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) Word has length 51 [2024-11-27 20:21:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:38,996 INFO L225 Difference]: With dead ends: 1958 [2024-11-27 20:21:38,997 INFO L226 Difference]: Without dead ends: 1178 [2024-11-27 20:21:38,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:21:38,999 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 480 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:39,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1237 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:21:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2024-11-27 20:21:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1097. [2024-11-27 20:21:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1089 states have (on average 1.6161616161616161) internal successors, (1760), 1096 states have internal predecessors, (1760), 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) [2024-11-27 20:21:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1760 transitions. [2024-11-27 20:21:39,083 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1760 transitions. Word has length 51 [2024-11-27 20:21:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:39,083 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1760 transitions. [2024-11-27 20:21:39,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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) [2024-11-27 20:21:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1760 transitions. [2024-11-27 20:21:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 20:21:39,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:39,088 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:39,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:21:39,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:39,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2051064775, now seen corresponding path program 1 times [2024-11-27 20:21:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:39,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587998306] [2024-11-27 20:21:39,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:39,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:39,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587998306] [2024-11-27 20:21:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587998306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:39,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:39,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:39,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211993147] [2024-11-27 20:21:39,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:39,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:39,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:39,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:39,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:39,227 INFO L87 Difference]: Start difference. First operand 1097 states and 1760 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-27 20:21:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:39,372 INFO L93 Difference]: Finished difference Result 3110 states and 4982 transitions. [2024-11-27 20:21:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2024-11-27 20:21:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:39,382 INFO L225 Difference]: With dead ends: 3110 [2024-11-27 20:21:39,382 INFO L226 Difference]: Without dead ends: 2027 [2024-11-27 20:21:39,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:39,386 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 331 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:39,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1053 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2024-11-27 20:21:39,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1876. [2024-11-27 20:21:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1868 states have (on average 1.6065310492505354) internal successors, (3001), 1875 states have internal predecessors, (3001), 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) [2024-11-27 20:21:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 3001 transitions. [2024-11-27 20:21:39,506 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 3001 transitions. Word has length 62 [2024-11-27 20:21:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:39,508 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 3001 transitions. [2024-11-27 20:21:39,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-27 20:21:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 3001 transitions. [2024-11-27 20:21:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 20:21:39,511 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:39,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:39,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:21:39,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:39,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1949173227, now seen corresponding path program 1 times [2024-11-27 20:21:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846947251] [2024-11-27 20:21:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846947251] [2024-11-27 20:21:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846947251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559423972] [2024-11-27 20:21:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:39,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:39,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:39,621 INFO L87 Difference]: Start difference. First operand 1876 states and 3001 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-27 20:21:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:39,725 INFO L93 Difference]: Finished difference Result 3860 states and 6249 transitions. [2024-11-27 20:21:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:39,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 62 [2024-11-27 20:21:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:39,737 INFO L225 Difference]: With dead ends: 3860 [2024-11-27 20:21:39,737 INFO L226 Difference]: Without dead ends: 2008 [2024-11-27 20:21:39,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:39,742 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 359 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:39,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 674 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:21:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2024-11-27 20:21:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1833. [2024-11-27 20:21:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1825 states have (on average 1.6295890410958904) internal successors, (2974), 1832 states have internal predecessors, (2974), 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) [2024-11-27 20:21:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2974 transitions. [2024-11-27 20:21:39,876 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2974 transitions. Word has length 62 [2024-11-27 20:21:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:39,877 INFO L471 AbstractCegarLoop]: Abstraction has 1833 states and 2974 transitions. [2024-11-27 20:21:39,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-27 20:21:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2974 transitions. [2024-11-27 20:21:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-27 20:21:39,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:39,886 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:39,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:21:39,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1042952105, now seen corresponding path program 1 times [2024-11-27 20:21:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573582441] [2024-11-27 20:21:39,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:40,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573582441] [2024-11-27 20:21:40,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573582441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:40,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432826033] [2024-11-27 20:21:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:40,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:40,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:40,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:40,032 INFO L87 Difference]: Start difference. First operand 1833 states and 2974 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2024-11-27 20:21:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:40,280 INFO L93 Difference]: Finished difference Result 4026 states and 6518 transitions. [2024-11-27 20:21:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) Word has length 77 [2024-11-27 20:21:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:40,291 INFO L225 Difference]: With dead ends: 4026 [2024-11-27 20:21:40,292 INFO L226 Difference]: Without dead ends: 2211 [2024-11-27 20:21:40,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:40,295 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 188 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:40,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 798 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2024-11-27 20:21:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2199. [2024-11-27 20:21:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 2191 states have (on average 1.6083979917845732) internal successors, (3524), 2198 states have internal predecessors, (3524), 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) [2024-11-27 20:21:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 3524 transitions. [2024-11-27 20:21:40,443 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 3524 transitions. Word has length 77 [2024-11-27 20:21:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:40,443 INFO L471 AbstractCegarLoop]: Abstraction has 2199 states and 3524 transitions. [2024-11-27 20:21:40,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2024-11-27 20:21:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 3524 transitions. [2024-11-27 20:21:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:21:40,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:40,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:40,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:21:40,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash 263980689, now seen corresponding path program 1 times [2024-11-27 20:21:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:40,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678056642] [2024-11-27 20:21:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:40,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:40,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678056642] [2024-11-27 20:21:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678056642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346370250] [2024-11-27 20:21:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:40,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:40,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:40,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:40,612 INFO L87 Difference]: Start difference. First operand 2199 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-11-27 20:21:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:41,132 INFO L93 Difference]: Finished difference Result 5021 states and 8165 transitions. [2024-11-27 20:21:41,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:41,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) Word has length 85 [2024-11-27 20:21:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:41,148 INFO L225 Difference]: With dead ends: 5021 [2024-11-27 20:21:41,149 INFO L226 Difference]: Without dead ends: 2976 [2024-11-27 20:21:41,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:41,153 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 237 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:41,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 835 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:21:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2024-11-27 20:21:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2487. [2024-11-27 20:21:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2479 states have (on average 1.5348931020572811) internal successors, (3805), 2486 states have internal predecessors, (3805), 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) [2024-11-27 20:21:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3805 transitions. [2024-11-27 20:21:41,290 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3805 transitions. Word has length 85 [2024-11-27 20:21:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:41,291 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3805 transitions. [2024-11-27 20:21:41,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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) [2024-11-27 20:21:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3805 transitions. [2024-11-27 20:21:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 20:21:41,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:41,294 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:41,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:21:41,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:41,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:41,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1935611644, now seen corresponding path program 1 times [2024-11-27 20:21:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:41,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599258456] [2024-11-27 20:21:41,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:41,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 20:21:41,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:41,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599258456] [2024-11-27 20:21:41,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599258456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:41,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:41,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:41,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077204460] [2024-11-27 20:21:41,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:41,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:41,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:41,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:41,393 INFO L87 Difference]: Start difference. First operand 2487 states and 3805 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) [2024-11-27 20:21:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:41,662 INFO L93 Difference]: Finished difference Result 6449 states and 9969 transitions. [2024-11-27 20:21:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) Word has length 92 [2024-11-27 20:21:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:41,680 INFO L225 Difference]: With dead ends: 6449 [2024-11-27 20:21:41,680 INFO L226 Difference]: Without dead ends: 3982 [2024-11-27 20:21:41,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:41,686 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 304 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:41,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 986 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2024-11-27 20:21:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3408. [2024-11-27 20:21:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 3400 states have (on average 1.5373529411764706) internal successors, (5227), 3407 states have internal predecessors, (5227), 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) [2024-11-27 20:21:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 5227 transitions. [2024-11-27 20:21:41,889 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 5227 transitions. Word has length 92 [2024-11-27 20:21:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:41,889 INFO L471 AbstractCegarLoop]: Abstraction has 3408 states and 5227 transitions. [2024-11-27 20:21:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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) [2024-11-27 20:21:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 5227 transitions. [2024-11-27 20:21:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:21:41,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:41,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:41,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:21:41,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:41,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1159690339, now seen corresponding path program 1 times [2024-11-27 20:21:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:41,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673052283] [2024-11-27 20:21:41,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 20:21:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673052283] [2024-11-27 20:21:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673052283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:42,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826238910] [2024-11-27 20:21:42,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:42,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:42,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:42,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:42,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:42,009 INFO L87 Difference]: Start difference. First operand 3408 states and 5227 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-27 20:21:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:42,358 INFO L93 Difference]: Finished difference Result 9040 states and 13939 transitions. [2024-11-27 20:21:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:42,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) Word has length 93 [2024-11-27 20:21:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:42,429 INFO L225 Difference]: With dead ends: 9040 [2024-11-27 20:21:42,429 INFO L226 Difference]: Without dead ends: 5792 [2024-11-27 20:21:42,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:42,435 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 352 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:42,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 859 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2024-11-27 20:21:42,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 5762. [2024-11-27 20:21:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5762 states, 5754 states have (on average 1.4923531456378172) internal successors, (8587), 5761 states have internal predecessors, (8587), 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) [2024-11-27 20:21:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5762 states to 5762 states and 8587 transitions. [2024-11-27 20:21:42,682 INFO L78 Accepts]: Start accepts. Automaton has 5762 states and 8587 transitions. Word has length 93 [2024-11-27 20:21:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:42,684 INFO L471 AbstractCegarLoop]: Abstraction has 5762 states and 8587 transitions. [2024-11-27 20:21:42,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-27 20:21:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5762 states and 8587 transitions. [2024-11-27 20:21:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:21:42,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:42,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:42,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:21:42,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:42,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1301394056, now seen corresponding path program 1 times [2024-11-27 20:21:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:42,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315419384] [2024-11-27 20:21:42,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315419384] [2024-11-27 20:21:42,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315419384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:42,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:42,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678699132] [2024-11-27 20:21:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:42,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:42,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:42,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:42,842 INFO L87 Difference]: Start difference. First operand 5762 states and 8587 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-27 20:21:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:43,089 INFO L93 Difference]: Finished difference Result 11251 states and 16836 transitions. [2024-11-27 20:21:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:43,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) Word has length 93 [2024-11-27 20:21:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:43,115 INFO L225 Difference]: With dead ends: 11251 [2024-11-27 20:21:43,115 INFO L226 Difference]: Without dead ends: 5647 [2024-11-27 20:21:43,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:43,124 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 331 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:43,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 424 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5647 states. [2024-11-27 20:21:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5647 to 5647. [2024-11-27 20:21:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5647 states, 5639 states have (on average 1.4589466217414435) internal successors, (8227), 5646 states have internal predecessors, (8227), 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) [2024-11-27 20:21:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 8227 transitions. [2024-11-27 20:21:43,454 INFO L78 Accepts]: Start accepts. Automaton has 5647 states and 8227 transitions. Word has length 93 [2024-11-27 20:21:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:43,455 INFO L471 AbstractCegarLoop]: Abstraction has 5647 states and 8227 transitions. [2024-11-27 20:21:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2024-11-27 20:21:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5647 states and 8227 transitions. [2024-11-27 20:21:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 20:21:43,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:43,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:43,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:21:43,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:43,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:43,459 INFO L85 PathProgramCache]: Analyzing trace with hash -691942683, now seen corresponding path program 1 times [2024-11-27 20:21:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:43,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529155084] [2024-11-27 20:21:43,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:43,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:43,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:43,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529155084] [2024-11-27 20:21:43,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529155084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:43,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:43,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:21:43,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384267407] [2024-11-27 20:21:43,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:43,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:21:43,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:43,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:21:43,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:21:43,605 INFO L87 Difference]: Start difference. First operand 5647 states and 8227 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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) [2024-11-27 20:21:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:44,274 INFO L93 Difference]: Finished difference Result 15125 states and 22109 transitions. [2024-11-27 20:21:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:21:44,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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) Word has length 102 [2024-11-27 20:21:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:44,331 INFO L225 Difference]: With dead ends: 15125 [2024-11-27 20:21:44,331 INFO L226 Difference]: Without dead ends: 9685 [2024-11-27 20:21:44,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:21:44,342 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 607 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:44,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2555 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9685 states. [2024-11-27 20:21:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9685 to 8529. [2024-11-27 20:21:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8529 states, 8521 states have (on average 1.469897899307593) internal successors, (12525), 8528 states have internal predecessors, (12525), 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) [2024-11-27 20:21:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8529 states to 8529 states and 12525 transitions. [2024-11-27 20:21:44,945 INFO L78 Accepts]: Start accepts. Automaton has 8529 states and 12525 transitions. Word has length 102 [2024-11-27 20:21:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:44,946 INFO L471 AbstractCegarLoop]: Abstraction has 8529 states and 12525 transitions. [2024-11-27 20:21:44,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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) [2024-11-27 20:21:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8529 states and 12525 transitions. [2024-11-27 20:21:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-27 20:21:44,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:44,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:44,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:21:44,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:44,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:44,953 INFO L85 PathProgramCache]: Analyzing trace with hash -932771968, now seen corresponding path program 1 times [2024-11-27 20:21:44,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:44,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69950614] [2024-11-27 20:21:44,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:21:45,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69950614] [2024-11-27 20:21:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69950614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508242173] [2024-11-27 20:21:45,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:45,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:45,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:21:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:45,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:21:45,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:21:45,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508242173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:45,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:21:45,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-27 20:21:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792893717] [2024-11-27 20:21:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:45,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:45,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:45,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:45,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:21:45,423 INFO L87 Difference]: Start difference. First operand 8529 states and 12525 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2024-11-27 20:21:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:45,772 INFO L93 Difference]: Finished difference Result 16856 states and 24808 transitions. [2024-11-27 20:21:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:45,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) Word has length 104 [2024-11-27 20:21:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:45,801 INFO L225 Difference]: With dead ends: 16856 [2024-11-27 20:21:45,801 INFO L226 Difference]: Without dead ends: 8486 [2024-11-27 20:21:45,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:21:45,813 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 286 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:45,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 454 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:21:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2024-11-27 20:21:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 8486. [2024-11-27 20:21:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 8478 states have (on average 1.4549422033498467) internal successors, (12335), 8485 states have internal predecessors, (12335), 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) [2024-11-27 20:21:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 12335 transitions. [2024-11-27 20:21:46,317 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 12335 transitions. Word has length 104 [2024-11-27 20:21:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:46,318 INFO L471 AbstractCegarLoop]: Abstraction has 8486 states and 12335 transitions. [2024-11-27 20:21:46,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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) [2024-11-27 20:21:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 12335 transitions. [2024-11-27 20:21:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 20:21:46,322 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:46,322 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:46,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:21:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:46,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2068085917, now seen corresponding path program 1 times [2024-11-27 20:21:46,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069361124] [2024-11-27 20:21:46,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:21:46,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:46,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069361124] [2024-11-27 20:21:46,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069361124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:46,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:46,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:46,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541592460] [2024-11-27 20:21:46,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:46,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:21:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:46,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:21:46,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:21:46,700 INFO L87 Difference]: Start difference. First operand 8486 states and 12335 transitions. Second operand has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 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) [2024-11-27 20:21:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:47,477 INFO L93 Difference]: Finished difference Result 17407 states and 25307 transitions. [2024-11-27 20:21:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:21:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 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) Word has length 106 [2024-11-27 20:21:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:47,536 INFO L225 Difference]: With dead ends: 17407 [2024-11-27 20:21:47,536 INFO L226 Difference]: Without dead ends: 17403 [2024-11-27 20:21:47,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:21:47,544 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 704 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:47,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1259 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17403 states. [2024-11-27 20:21:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17403 to 15527. [2024-11-27 20:21:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15527 states, 15519 states have (on average 1.4657516592563953) internal successors, (22747), 15526 states have internal predecessors, (22747), 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) [2024-11-27 20:21:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15527 states to 15527 states and 22747 transitions. [2024-11-27 20:21:48,472 INFO L78 Accepts]: Start accepts. Automaton has 15527 states and 22747 transitions. Word has length 106 [2024-11-27 20:21:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:48,473 INFO L471 AbstractCegarLoop]: Abstraction has 15527 states and 22747 transitions. [2024-11-27 20:21:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.0) internal successors, (105), 4 states have internal predecessors, (105), 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) [2024-11-27 20:21:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 15527 states and 22747 transitions. [2024-11-27 20:21:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 20:21:48,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:48,476 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:48,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:21:48,479 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:48,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:48,479 INFO L85 PathProgramCache]: Analyzing trace with hash -339284881, now seen corresponding path program 1 times [2024-11-27 20:21:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452008256] [2024-11-27 20:21:48,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:21:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452008256] [2024-11-27 20:21:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452008256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013930647] [2024-11-27 20:21:48,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:48,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:48,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:48,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:48,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:21:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:48,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-27 20:21:48,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-27 20:21:48,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:48,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013930647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:48,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:21:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-27 20:21:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460437514] [2024-11-27 20:21:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:48,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:21:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:48,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:21:48,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:21:48,962 INFO L87 Difference]: Start difference. First operand 15527 states and 22747 transitions. Second operand has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 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) [2024-11-27 20:21:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:49,463 INFO L93 Difference]: Finished difference Result 15819 states and 23147 transitions. [2024-11-27 20:21:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:21:49,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 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) Word has length 110 [2024-11-27 20:21:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:49,509 INFO L225 Difference]: With dead ends: 15819 [2024-11-27 20:21:49,509 INFO L226 Difference]: Without dead ends: 15818 [2024-11-27 20:21:49,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:21:49,518 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 144 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:49,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1227 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15818 states. [2024-11-27 20:21:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15818 to 15526. [2024-11-27 20:21:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15526 states, 15519 states have (on average 1.4642051678587538) internal successors, (22723), 15525 states have internal predecessors, (22723), 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) [2024-11-27 20:21:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15526 states to 15526 states and 22723 transitions. [2024-11-27 20:21:50,173 INFO L78 Accepts]: Start accepts. Automaton has 15526 states and 22723 transitions. Word has length 110 [2024-11-27 20:21:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:50,174 INFO L471 AbstractCegarLoop]: Abstraction has 15526 states and 22723 transitions. [2024-11-27 20:21:50,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 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) [2024-11-27 20:21:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 15526 states and 22723 transitions. [2024-11-27 20:21:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-27 20:21:50,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:50,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:50,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:50,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-27 20:21:50,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:50,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1927896490, now seen corresponding path program 1 times [2024-11-27 20:21:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:50,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095416082] [2024-11-27 20:21:50,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:50,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:21:50,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095416082] [2024-11-27 20:21:50,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095416082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432625076] [2024-11-27 20:21:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:50,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:50,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:50,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:50,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:21:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:50,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-27 20:21:50,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:21:50,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:50,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432625076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:50,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:21:50,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-27 20:21:50,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717964521] [2024-11-27 20:21:50,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:50,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:50,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:50,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:50,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:21:50,760 INFO L87 Difference]: Start difference. First operand 15526 states and 22723 transitions. Second operand has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 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) [2024-11-27 20:21:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:51,251 INFO L93 Difference]: Finished difference Result 15818 states and 23123 transitions. [2024-11-27 20:21:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:51,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 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) Word has length 111 [2024-11-27 20:21:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:51,294 INFO L225 Difference]: With dead ends: 15818 [2024-11-27 20:21:51,295 INFO L226 Difference]: Without dead ends: 15817 [2024-11-27 20:21:51,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:21:51,299 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 143 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:51,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 862 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15817 states. [2024-11-27 20:21:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15817 to 15525. [2024-11-27 20:21:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15525 states, 15519 states have (on average 1.4626586764611123) internal successors, (22699), 15524 states have internal predecessors, (22699), 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) [2024-11-27 20:21:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15525 states to 15525 states and 22699 transitions. [2024-11-27 20:21:51,845 INFO L78 Accepts]: Start accepts. Automaton has 15525 states and 22699 transitions. Word has length 111 [2024-11-27 20:21:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 15525 states and 22699 transitions. [2024-11-27 20:21:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.5) internal successors, (107), 3 states have internal predecessors, (107), 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) [2024-11-27 20:21:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 15525 states and 22699 transitions. [2024-11-27 20:21:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-27 20:21:51,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:51,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:51,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:21:52,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-27 20:21:52,060 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:52,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1379701474, now seen corresponding path program 1 times [2024-11-27 20:21:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:52,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655096520] [2024-11-27 20:21:52,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:52,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:21:52,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:52,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655096520] [2024-11-27 20:21:52,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655096520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:52,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:52,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:52,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207869540] [2024-11-27 20:21:52,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:52,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:52,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:52,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:52,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:52,210 INFO L87 Difference]: Start difference. First operand 15525 states and 22699 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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) [2024-11-27 20:21:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:52,768 INFO L93 Difference]: Finished difference Result 19845 states and 28879 transitions. [2024-11-27 20:21:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:52,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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) Word has length 184 [2024-11-27 20:21:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:52,786 INFO L225 Difference]: With dead ends: 19845 [2024-11-27 20:21:52,787 INFO L226 Difference]: Without dead ends: 4525 [2024-11-27 20:21:52,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:52,806 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 156 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:52,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 460 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:21:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2024-11-27 20:21:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 3133. [2024-11-27 20:21:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 3127 states have (on average 1.202110649184522) internal successors, (3759), 3132 states have internal predecessors, (3759), 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) [2024-11-27 20:21:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 3759 transitions. [2024-11-27 20:21:53,026 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 3759 transitions. Word has length 184 [2024-11-27 20:21:53,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:53,027 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 3759 transitions. [2024-11-27 20:21:53,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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) [2024-11-27 20:21:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 3759 transitions. [2024-11-27 20:21:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-27 20:21:53,035 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:53,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:53,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:21:53,036 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:53,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -555295234, now seen corresponding path program 1 times [2024-11-27 20:21:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:53,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382992117] [2024-11-27 20:21:53,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-27 20:21:53,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382992117] [2024-11-27 20:21:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382992117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:53,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:53,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:21:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642151747] [2024-11-27 20:21:53,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:53,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:21:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:53,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:21:53,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:53,198 INFO L87 Difference]: Start difference. First operand 3133 states and 3759 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) [2024-11-27 20:21:53,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:53,331 INFO L93 Difference]: Finished difference Result 4535 states and 5365 transitions. [2024-11-27 20:21:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:21:53,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) Word has length 195 [2024-11-27 20:21:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:53,339 INFO L225 Difference]: With dead ends: 4535 [2024-11-27 20:21:53,340 INFO L226 Difference]: Without dead ends: 1385 [2024-11-27 20:21:53,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:21:53,345 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 168 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:53,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 324 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:21:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-27 20:21:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1375. [2024-11-27 20:21:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1369 states have (on average 1.1183345507669833) internal successors, (1531), 1374 states have internal predecessors, (1531), 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) [2024-11-27 20:21:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1531 transitions. [2024-11-27 20:21:53,443 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1531 transitions. Word has length 195 [2024-11-27 20:21:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1531 transitions. [2024-11-27 20:21:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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) [2024-11-27 20:21:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1531 transitions. [2024-11-27 20:21:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-27 20:21:53,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:53,449 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:53,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:21:53,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:53,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:53,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1347791811, now seen corresponding path program 1 times [2024-11-27 20:21:53,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:53,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685167458] [2024-11-27 20:21:53,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:53,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 20:21:53,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685167458] [2024-11-27 20:21:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685167458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:21:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357422812] [2024-11-27 20:21:53,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:53,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:53,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:21:53,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:21:53,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:21:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:54,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:21:54,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:21:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 20:21:54,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:21:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357422812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-27 20:21:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-27 20:21:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396420792] [2024-11-27 20:21:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:21:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:54,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:21:54,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:21:54,269 INFO L87 Difference]: Start difference. First operand 1375 states and 1531 transitions. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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) [2024-11-27 20:21:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:54,383 INFO L93 Difference]: Finished difference Result 1670 states and 1859 transitions. [2024-11-27 20:21:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:21:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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) Word has length 200 [2024-11-27 20:21:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:54,389 INFO L225 Difference]: With dead ends: 1670 [2024-11-27 20:21:54,390 INFO L226 Difference]: Without dead ends: 813 [2024-11-27 20:21:54,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:21:54,392 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 228 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:54,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 507 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:21:54,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-27 20:21:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 777. [2024-11-27 20:21:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 775 states have (on average 1.1174193548387097) internal successors, (866), 776 states have internal predecessors, (866), 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) [2024-11-27 20:21:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 866 transitions. [2024-11-27 20:21:54,431 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 866 transitions. Word has length 200 [2024-11-27 20:21:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:54,434 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 866 transitions. [2024-11-27 20:21:54,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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) [2024-11-27 20:21:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 866 transitions. [2024-11-27 20:21:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-27 20:21:54,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:54,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:54,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 20:21:54,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:21:54,639 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash 150590942, now seen corresponding path program 1 times [2024-11-27 20:21:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037240513] [2024-11-27 20:21:54,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:54,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:54,824 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-27 20:21:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037240513] [2024-11-27 20:21:54,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037240513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:54,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:54,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:21:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222680466] [2024-11-27 20:21:54,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:54,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:21:54,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:54,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:21:54,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:21:54,827 INFO L87 Difference]: Start difference. First operand 777 states and 866 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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) [2024-11-27 20:21:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:54,925 INFO L93 Difference]: Finished difference Result 896 states and 996 transitions. [2024-11-27 20:21:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:21:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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) Word has length 204 [2024-11-27 20:21:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:54,932 INFO L225 Difference]: With dead ends: 896 [2024-11-27 20:21:54,932 INFO L226 Difference]: Without dead ends: 779 [2024-11-27 20:21:54,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:21:54,934 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 157 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:54,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 766 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:21:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-11-27 20:21:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 771. [2024-11-27 20:21:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 769 states have (on average 1.1131339401820546) internal successors, (856), 770 states have internal predecessors, (856), 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) [2024-11-27 20:21:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 856 transitions. [2024-11-27 20:21:54,976 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 856 transitions. Word has length 204 [2024-11-27 20:21:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:54,976 INFO L471 AbstractCegarLoop]: Abstraction has 771 states and 856 transitions. [2024-11-27 20:21:54,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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) [2024-11-27 20:21:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 856 transitions. [2024-11-27 20:21:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-27 20:21:54,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:21:54,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:54,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:21:54,981 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-27 20:21:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:21:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 326941031, now seen corresponding path program 1 times [2024-11-27 20:21:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:21:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099555853] [2024-11-27 20:21:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:21:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:21:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:21:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-27 20:21:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:21:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099555853] [2024-11-27 20:21:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099555853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:21:55,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:21:55,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:21:55,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119979790] [2024-11-27 20:21:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:21:55,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:21:55,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:21:55,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:21:55,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:21:55,214 INFO L87 Difference]: Start difference. First operand 771 states and 856 transitions. Second operand has 5 states, 4 states have (on average 50.5) internal successors, (202), 5 states have internal predecessors, (202), 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) [2024-11-27 20:21:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:21:55,323 INFO L93 Difference]: Finished difference Result 783 states and 868 transitions. [2024-11-27 20:21:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:21:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 50.5) internal successors, (202), 5 states have internal predecessors, (202), 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) Word has length 206 [2024-11-27 20:21:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:21:55,329 INFO L225 Difference]: With dead ends: 783 [2024-11-27 20:21:55,329 INFO L226 Difference]: Without dead ends: 0 [2024-11-27 20:21:55,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:21:55,331 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 202 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:21:55,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 514 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:21:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-27 20:21:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-27 20:21:55,332 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) [2024-11-27 20:21:55,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-27 20:21:55,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2024-11-27 20:21:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:21:55,336 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-27 20:21:55,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 50.5) internal successors, (202), 5 states have internal predecessors, (202), 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) [2024-11-27 20:21:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-27 20:21:55,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-27 20:21:55,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-27 20:21:55,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-27 20:21:55,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-27 20:21:55,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-27 20:21:55,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-27 20:21:55,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-27 20:21:55,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-27 20:21:55,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-27 20:21:55,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 20:21:55,345 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:21:55,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-27 20:22:04,795 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:22:04,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:22:04 BoogieIcfgContainer [2024-11-27 20:22:04,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:22:04,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:22:04,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:22:04,872 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:22:04,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:21:35" (3/4) ... [2024-11-27 20:22:04,879 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 20:22:04,889 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-27 20:22:04,919 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-27 20:22:04,920 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-27 20:22:04,922 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 20:22:04,923 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 20:22:05,197 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 20:22:05,198 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 20:22:05,198 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:22:05,199 INFO L158 Benchmark]: Toolchain (without parser) took 31346.00ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 92.0MB in the beginning and 1.0GB in the end (delta: -937.3MB). Peak memory consumption was 732.4MB. Max. memory is 16.1GB. [2024-11-27 20:22:05,202 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:22:05,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.27ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 72.0MB in the end (delta: 19.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:22:05,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.82ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:22:05,203 INFO L158 Benchmark]: Boogie Preprocessor took 75.49ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 65.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:22:05,203 INFO L158 Benchmark]: RCFGBuilder took 1348.34ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 67.7MB in the end (delta: -2.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-27 20:22:05,203 INFO L158 Benchmark]: TraceAbstraction took 28996.13ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 67.1MB in the beginning and 389.1MB in the end (delta: -322.0MB). Peak memory consumption was 734.3MB. Max. memory is 16.1GB. [2024-11-27 20:22:05,203 INFO L158 Benchmark]: Witness Printer took 326.32ms. Allocated memory is still 1.1GB. Free memory was 389.1MB in the beginning and 1.0GB in the end (delta: -640.3MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-27 20:22:05,206 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.32ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 73.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.27ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 72.0MB in the end (delta: 19.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.82ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.49ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 65.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1348.34ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 67.7MB in the end (delta: -2.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28996.13ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 67.1MB in the beginning and 389.1MB in the end (delta: -322.0MB). Peak memory consumption was 734.3MB. Max. memory is 16.1GB. * Witness Printer took 326.32ms. Allocated memory is still 1.1GB. Free memory was 389.1MB in the beginning and 1.0GB in the end (delta: -640.3MB). Peak memory consumption was 26.6MB. 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: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: 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 2 procedures, 274 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6465 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6465 mSDsluCounter, 19032 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9341 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1503 IncrementalHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 9691 mSDtfsCounter, 1503 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15527occurred in iteration=14, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 6706 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2749 NumberOfCodeBlocks, 2749 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2724 ConstructedInterpolants, 0 QuantifiedInterpolants, 4920 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1819 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 589/599 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) || ((((((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: ((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) || ((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (s_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (s_run_st == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (s_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((2 <= c_write_req_ev) && (s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (s_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((2 <= c_write_req_ev) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (s_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || ((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || ((req_tt_a == 0) && ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))))) || (((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 876]: Location Invariant Derived location invariant: (((((req_tt_a == 0) && ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || ((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((2 <= c_write_req_ev) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-27 20:22:05,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88425d25-424c-4017-a8b8-70bc4f625e76/bin/uautomizer-verify-aQ6SnzHsRB/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