./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.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_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1 --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 11:55:22,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 11:55:22,556 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-12-02 11:55:22,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 11:55:22,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 11:55:22,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 11:55:22,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 11:55:22,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 11:55:22,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 11:55:22,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 11:55:22,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 11:55:22,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 11:55:22,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 11:55:22,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 11:55:22,585 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 11:55:22,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 11:55:22,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 11:55:22,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:55:22,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 11:55:22,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:55:22,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 11:55:22,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 11:55:22,588 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_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2024-12-02 11:55:22,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 11:55:22,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 11:55:22,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 11:55:22,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 11:55:22,845 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 11:55:22,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-12-02 11:55:25,497 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/data/a5718d94a/0ad6227905914b3c8a08689d6c8896f4/FLAG46b51a2c6 [2024-12-02 11:55:25,736 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 11:55:25,737 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-12-02 11:55:25,746 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/data/a5718d94a/0ad6227905914b3c8a08689d6c8896f4/FLAG46b51a2c6 [2024-12-02 11:55:25,762 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/data/a5718d94a/0ad6227905914b3c8a08689d6c8896f4 [2024-12-02 11:55:25,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 11:55:25,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 11:55:25,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 11:55:25,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 11:55:25,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 11:55:25,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:55:25" (1/1) ... [2024-12-02 11:55:25,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6315db1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:25, skipping insertion in model container [2024-12-02 11:55:25,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:55:25" (1/1) ... [2024-12-02 11:55:25,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 11:55:25,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:55:25,973 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 11:55:26,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 11:55:26,017 INFO L204 MainTranslator]: Completed translation [2024-12-02 11:55:26,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26 WrapperNode [2024-12-02 11:55:26,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 11:55:26,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 11:55:26,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 11:55:26,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 11:55:26,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,054 INFO L138 Inliner]: procedures = 30, calls = 36, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 230 [2024-12-02 11:55:26,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 11:55:26,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 11:55:26,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 11:55:26,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 11:55:26,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,083 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-12-02 11:55:26,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 11:55:26,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 11:55:26,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 11:55:26,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 11:55:26,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (1/1) ... [2024-12-02 11:55:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 11:55:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 11:55:26,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 11:55:26,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 11:55:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 11:55:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-12-02 11:55:26,163 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-12-02 11:55:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-12-02 11:55:26,163 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-12-02 11:55:26,163 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-12-02 11:55:26,164 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-12-02 11:55:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-12-02 11:55:26,164 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-12-02 11:55:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-12-02 11:55:26,164 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-12-02 11:55:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-12-02 11:55:26,164 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-12-02 11:55:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-12-02 11:55:26,164 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-12-02 11:55:26,164 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-12-02 11:55:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 11:55:26,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 11:55:26,235 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 11:55:26,236 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 11:55:26,548 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-12-02 11:55:26,548 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 11:55:26,561 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 11:55:26,561 INFO L312 CfgBuilder]: Removed 8 assume(true) statements. [2024-12-02 11:55:26,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:26 BoogieIcfgContainer [2024-12-02 11:55:26,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 11:55:26,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 11:55:26,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 11:55:26,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 11:55:26,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:55:25" (1/3) ... [2024-12-02 11:55:26,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab9eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:55:26, skipping insertion in model container [2024-12-02 11:55:26,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:55:26" (2/3) ... [2024-12-02 11:55:26,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab9eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:55:26, skipping insertion in model container [2024-12-02 11:55:26,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:26" (3/3) ... [2024-12-02 11:55:26,572 INFO L128 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2024-12-02 11:55:26,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 11:55:26,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG token_ring.01.cil-2.c that has 8 procedures, 120 locations, 1 initial locations, 4 loop locations, and 4 error locations. [2024-12-02 11:55:26,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 11:55:26,655 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;@5d20a97d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 11:55:26,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-12-02 11:55:26,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 98 states have internal predecessors, (143), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-12-02 11:55:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 11:55:26,666 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:26,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:26,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:26,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2135238899, now seen corresponding path program 1 times [2024-12-02 11:55:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:26,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375956322] [2024-12-02 11:55:26,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:27,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:27,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375956322] [2024-12-02 11:55:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375956322] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:27,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:27,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:55:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744264458] [2024-12-02 11:55:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:27,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:55:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:27,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:55:27,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:55:27,064 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 98 states have internal predecessors, (143), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:27,444 INFO L93 Difference]: Finished difference Result 340 states and 511 transitions. [2024-12-02 11:55:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-02 11:55:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-12-02 11:55:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:27,456 INFO L225 Difference]: With dead ends: 340 [2024-12-02 11:55:27,456 INFO L226 Difference]: Without dead ends: 215 [2024-12-02 11:55:27,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:27,462 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 237 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:27,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 454 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:55:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-12-02 11:55:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 206. [2024-12-02 11:55:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 169 states have internal predecessors, (244), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (26), 25 states have call predecessors, (26), 25 states have call successors, (26) [2024-12-02 11:55:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 295 transitions. [2024-12-02 11:55:27,523 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 295 transitions. Word has length 53 [2024-12-02 11:55:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:27,524 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 295 transitions. [2024-12-02 11:55:27,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 295 transitions. [2024-12-02 11:55:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 11:55:27,526 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:27,527 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:27,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-02 11:55:27,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:27,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1565736943, now seen corresponding path program 1 times [2024-12-02 11:55:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788304944] [2024-12-02 11:55:27,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:27,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788304944] [2024-12-02 11:55:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788304944] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:55:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827668006] [2024-12-02 11:55:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:27,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:55:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:27,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:55:27,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:27,681 INFO L87 Difference]: Start difference. First operand 206 states and 295 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:28,075 INFO L93 Difference]: Finished difference Result 519 states and 743 transitions. [2024-12-02 11:55:28,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:55:28,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-12-02 11:55:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:28,078 INFO L225 Difference]: With dead ends: 519 [2024-12-02 11:55:28,079 INFO L226 Difference]: Without dead ends: 322 [2024-12-02 11:55:28,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:55:28,081 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 217 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:28,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 761 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:55:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-12-02 11:55:28,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 297. [2024-12-02 11:55:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 238 states have (on average 1.4789915966386555) internal successors, (352), 244 states have internal predecessors, (352), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (39), 36 states have call predecessors, (39), 35 states have call successors, (39) [2024-12-02 11:55:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 426 transitions. [2024-12-02 11:55:28,121 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 426 transitions. Word has length 53 [2024-12-02 11:55:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:28,121 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 426 transitions. [2024-12-02 11:55:28,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 426 transitions. [2024-12-02 11:55:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 11:55:28,123 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:28,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:28,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-02 11:55:28,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:28,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1989383665, now seen corresponding path program 1 times [2024-12-02 11:55:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:28,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103535504] [2024-12-02 11:55:28,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:28,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103535504] [2024-12-02 11:55:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103535504] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:28,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:28,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:55:28,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820289654] [2024-12-02 11:55:28,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:28,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:55:28,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:28,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:55:28,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:28,249 INFO L87 Difference]: Start difference. First operand 297 states and 426 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:28,631 INFO L93 Difference]: Finished difference Result 820 states and 1176 transitions. [2024-12-02 11:55:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:55:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-12-02 11:55:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:28,635 INFO L225 Difference]: With dead ends: 820 [2024-12-02 11:55:28,635 INFO L226 Difference]: Without dead ends: 532 [2024-12-02 11:55:28,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:55:28,638 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 256 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:28,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 732 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:55:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-12-02 11:55:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 476. [2024-12-02 11:55:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 383 states have (on average 1.4647519582245432) internal successors, (561), 393 states have internal predecessors, (561), 53 states have call successors, (53), 30 states have call predecessors, (53), 36 states have return successors, (69), 56 states have call predecessors, (69), 53 states have call successors, (69) [2024-12-02 11:55:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 683 transitions. [2024-12-02 11:55:28,691 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 683 transitions. Word has length 53 [2024-12-02 11:55:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:28,691 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 683 transitions. [2024-12-02 11:55:28,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 683 transitions. [2024-12-02 11:55:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 11:55:28,693 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:28,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:28,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-12-02 11:55:28,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:28,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash 617576367, now seen corresponding path program 1 times [2024-12-02 11:55:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:28,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411409508] [2024-12-02 11:55:28,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:28,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:28,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411409508] [2024-12-02 11:55:28,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411409508] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:28,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:55:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280232719] [2024-12-02 11:55:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:28,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:55:28,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:55:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:28,805 INFO L87 Difference]: Start difference. First operand 476 states and 683 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:29,182 INFO L93 Difference]: Finished difference Result 1347 states and 1943 transitions. [2024-12-02 11:55:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:55:29,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-12-02 11:55:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:29,188 INFO L225 Difference]: With dead ends: 1347 [2024-12-02 11:55:29,188 INFO L226 Difference]: Without dead ends: 880 [2024-12-02 11:55:29,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:55:29,190 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 209 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:29,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 716 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:55:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-12-02 11:55:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 789. [2024-12-02 11:55:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 628 states have (on average 1.4347133757961783) internal successors, (901), 652 states have internal predecessors, (901), 85 states have call successors, (85), 52 states have call predecessors, (85), 72 states have return successors, (149), 92 states have call predecessors, (149), 85 states have call successors, (149) [2024-12-02 11:55:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1135 transitions. [2024-12-02 11:55:29,283 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1135 transitions. Word has length 53 [2024-12-02 11:55:29,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:29,284 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1135 transitions. [2024-12-02 11:55:29,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:29,284 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1135 transitions. [2024-12-02 11:55:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-02 11:55:29,286 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:29,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:29,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-12-02 11:55:29,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:29,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1227790799, now seen corresponding path program 1 times [2024-12-02 11:55:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198980777] [2024-12-02 11:55:29,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:29,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198980777] [2024-12-02 11:55:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198980777] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:29,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:55:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127898431] [2024-12-02 11:55:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:55:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:29,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:55:29,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:55:29,339 INFO L87 Difference]: Start difference. First operand 789 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:29,518 INFO L93 Difference]: Finished difference Result 1990 states and 2887 transitions. [2024-12-02 11:55:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 11:55:29,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-12-02 11:55:29,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:29,526 INFO L225 Difference]: With dead ends: 1990 [2024-12-02 11:55:29,526 INFO L226 Difference]: Without dead ends: 1211 [2024-12-02 11:55:29,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:55:29,530 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 248 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:29,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 477 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:55:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-12-02 11:55:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1186. [2024-12-02 11:55:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 940 states have (on average 1.4) internal successors, (1316), 975 states have internal predecessors, (1316), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-12-02 11:55:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1661 transitions. [2024-12-02 11:55:29,687 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1661 transitions. Word has length 53 [2024-12-02 11:55:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:29,687 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1661 transitions. [2024-12-02 11:55:29,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1661 transitions. [2024-12-02 11:55:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 11:55:29,689 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:29,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:29,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-12-02 11:55:29,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:29,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash -371506657, now seen corresponding path program 1 times [2024-12-02 11:55:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668076597] [2024-12-02 11:55:29,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668076597] [2024-12-02 11:55:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668076597] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:29,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:55:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320881803] [2024-12-02 11:55:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:55:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:29,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:55:29,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:55:29,762 INFO L87 Difference]: Start difference. First operand 1186 states and 1661 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:29,890 INFO L93 Difference]: Finished difference Result 2377 states and 3374 transitions. [2024-12-02 11:55:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:55:29,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-12-02 11:55:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:29,899 INFO L225 Difference]: With dead ends: 2377 [2024-12-02 11:55:29,899 INFO L226 Difference]: Without dead ends: 1201 [2024-12-02 11:55:29,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:55:29,903 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:29,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:55:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2024-12-02 11:55:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1201. [2024-12-02 11:55:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 955 states have (on average 1.3842931937172775) internal successors, (1322), 990 states have internal predecessors, (1322), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-12-02 11:55:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1667 transitions. [2024-12-02 11:55:30,034 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1667 transitions. Word has length 54 [2024-12-02 11:55:30,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:30,034 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1667 transitions. [2024-12-02 11:55:30,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:30,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1667 transitions. [2024-12-02 11:55:30,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 11:55:30,036 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:30,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:30,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-12-02 11:55:30,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:30,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 330093217, now seen corresponding path program 1 times [2024-12-02 11:55:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:30,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199608890] [2024-12-02 11:55:30,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:30,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:30,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199608890] [2024-12-02 11:55:30,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199608890] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:30,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:30,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-02 11:55:30,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979536426] [2024-12-02 11:55:30,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:30,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-02 11:55:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:30,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-02 11:55:30,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:55:30,107 INFO L87 Difference]: Start difference. First operand 1201 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:30,216 INFO L93 Difference]: Finished difference Result 2434 states and 3422 transitions. [2024-12-02 11:55:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:55:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-12-02 11:55:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:30,224 INFO L225 Difference]: With dead ends: 2434 [2024-12-02 11:55:30,224 INFO L226 Difference]: Without dead ends: 1243 [2024-12-02 11:55:30,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-12-02 11:55:30,228 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:30,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:55:30,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-12-02 11:55:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1243. [2024-12-02 11:55:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 997 states have (on average 1.3681043129388164) internal successors, (1364), 1032 states have internal predecessors, (1364), 134 states have call successors, (134), 82 states have call predecessors, (134), 108 states have return successors, (211), 136 states have call predecessors, (211), 134 states have call successors, (211) [2024-12-02 11:55:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1709 transitions. [2024-12-02 11:55:30,312 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1709 transitions. Word has length 54 [2024-12-02 11:55:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:30,313 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1709 transitions. [2024-12-02 11:55:30,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1709 transitions. [2024-12-02 11:55:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 11:55:30,315 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:30,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:30,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-12-02 11:55:30,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 470641827, now seen corresponding path program 1 times [2024-12-02 11:55:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290574645] [2024-12-02 11:55:30,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290574645] [2024-12-02 11:55:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290574645] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:55:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486384791] [2024-12-02 11:55:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:30,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:55:30,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:30,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:55:30,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:30,441 INFO L87 Difference]: Start difference. First operand 1243 states and 1709 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:30,762 INFO L93 Difference]: Finished difference Result 1689 states and 2319 transitions. [2024-12-02 11:55:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:55:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-12-02 11:55:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:30,769 INFO L225 Difference]: With dead ends: 1689 [2024-12-02 11:55:30,769 INFO L226 Difference]: Without dead ends: 949 [2024-12-02 11:55:30,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:55:30,772 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 214 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:30,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 506 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:55:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-12-02 11:55:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 883. [2024-12-02 11:55:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 712 states have (on average 1.3623595505617978) internal successors, (970), 728 states have internal predecessors, (970), 100 states have call successors, (100), 59 states have call predecessors, (100), 67 states have return successors, (119), 99 states have call predecessors, (119), 100 states have call successors, (119) [2024-12-02 11:55:30,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1189 transitions. [2024-12-02 11:55:30,836 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1189 transitions. Word has length 54 [2024-12-02 11:55:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:30,836 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1189 transitions. [2024-12-02 11:55:30,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1189 transitions. [2024-12-02 11:55:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 11:55:30,837 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:30,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-12-02 11:55:30,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash -347006623, now seen corresponding path program 1 times [2024-12-02 11:55:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449164221] [2024-12-02 11:55:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:30,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449164221] [2024-12-02 11:55:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449164221] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:55:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41854421] [2024-12-02 11:55:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:30,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:55:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:30,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:55:30,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:30,953 INFO L87 Difference]: Start difference. First operand 883 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:31,345 INFO L93 Difference]: Finished difference Result 1589 states and 2142 transitions. [2024-12-02 11:55:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:55:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-12-02 11:55:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:31,352 INFO L225 Difference]: With dead ends: 1589 [2024-12-02 11:55:31,352 INFO L226 Difference]: Without dead ends: 950 [2024-12-02 11:55:31,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:55:31,355 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 215 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:31,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 493 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-12-02 11:55:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2024-12-02 11:55:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 872. [2024-12-02 11:55:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 705 states have (on average 1.3574468085106384) internal successors, (957), 717 states have internal predecessors, (957), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2024-12-02 11:55:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1164 transitions. [2024-12-02 11:55:31,418 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1164 transitions. Word has length 54 [2024-12-02 11:55:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:31,419 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1164 transitions. [2024-12-02 11:55:31,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1164 transitions. [2024-12-02 11:55:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 11:55:31,420 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:31,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:31,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-12-02 11:55:31,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:31,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2035950365, now seen corresponding path program 1 times [2024-12-02 11:55:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:31,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666269568] [2024-12-02 11:55:31,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666269568] [2024-12-02 11:55:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666269568] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:31,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:31,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:55:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212267352] [2024-12-02 11:55:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:55:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:31,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:55:31,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:31,533 INFO L87 Difference]: Start difference. First operand 872 states and 1164 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:31,871 INFO L93 Difference]: Finished difference Result 1532 states and 2037 transitions. [2024-12-02 11:55:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-12-02 11:55:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-12-02 11:55:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:31,877 INFO L225 Difference]: With dead ends: 1532 [2024-12-02 11:55:31,877 INFO L226 Difference]: Without dead ends: 814 [2024-12-02 11:55:31,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-12-02 11:55:31,880 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 180 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:31,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 520 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-12-02 11:55:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-12-02 11:55:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 764. [2024-12-02 11:55:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 622 states have (on average 1.3536977491961415) internal successors, (842), 632 states have internal predecessors, (842), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2024-12-02 11:55:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1014 transitions. [2024-12-02 11:55:31,949 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1014 transitions. Word has length 54 [2024-12-02 11:55:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:31,949 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1014 transitions. [2024-12-02 11:55:31,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1014 transitions. [2024-12-02 11:55:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-02 11:55:31,950 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:31,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:31,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-12-02 11:55:31,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:31,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash 264872225, now seen corresponding path program 1 times [2024-12-02 11:55:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:31,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535896509] [2024-12-02 11:55:31,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535896509] [2024-12-02 11:55:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535896509] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:55:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661591979] [2024-12-02 11:55:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:32,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:55:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:32,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:55:32,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:55:32,007 INFO L87 Difference]: Start difference. First operand 764 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:32,233 INFO L93 Difference]: Finished difference Result 2200 states and 2960 transitions. [2024-12-02 11:55:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:55:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2024-12-02 11:55:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:32,241 INFO L225 Difference]: With dead ends: 2200 [2024-12-02 11:55:32,241 INFO L226 Difference]: Without dead ends: 1447 [2024-12-02 11:55:32,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12-02 11:55:32,244 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 182 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:32,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 343 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:55:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2024-12-02 11:55:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1439. [2024-12-02 11:55:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1169 states have (on average 1.3327630453378956) internal successors, (1558), 1186 states have internal predecessors, (1558), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2024-12-02 11:55:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1917 transitions. [2024-12-02 11:55:32,338 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1917 transitions. Word has length 54 [2024-12-02 11:55:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:32,338 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1917 transitions. [2024-12-02 11:55:32,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1917 transitions. [2024-12-02 11:55:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-02 11:55:32,339 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:32,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:32,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-12-02 11:55:32,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:32,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:32,340 INFO L85 PathProgramCache]: Analyzing trace with hash -372475642, now seen corresponding path program 1 times [2024-12-02 11:55:32,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:32,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815621608] [2024-12-02 11:55:32,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:32,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815621608] [2024-12-02 11:55:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815621608] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:55:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100228274] [2024-12-02 11:55:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:32,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:55:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:55:32,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:55:32,362 INFO L87 Difference]: Start difference. First operand 1439 states and 1917 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:32,437 INFO L93 Difference]: Finished difference Result 2602 states and 3444 transitions. [2024-12-02 11:55:32,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:55:32,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-12-02 11:55:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:32,444 INFO L225 Difference]: With dead ends: 2602 [2024-12-02 11:55:32,444 INFO L226 Difference]: Without dead ends: 1174 [2024-12-02 11:55:32,447 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-12-02 11:55:32,447 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:32,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:55:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-12-02 11:55:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2024-12-02 11:55:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 960 states have (on average 1.321875) internal successors, (1269), 975 states have internal predecessors, (1269), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152) [2024-12-02 11:55:32,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1543 transitions. [2024-12-02 11:55:32,524 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1543 transitions. Word has length 55 [2024-12-02 11:55:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:32,525 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1543 transitions. [2024-12-02 11:55:32,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-12-02 11:55:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1543 transitions. [2024-12-02 11:55:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-02 11:55:32,525 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:32,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 11:55:32,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-12-02 11:55:32,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1311337292, now seen corresponding path program 1 times [2024-12-02 11:55:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193779541] [2024-12-02 11:55:32,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 11:55:32,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:32,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193779541] [2024-12-02 11:55:32,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193779541] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:32,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:55:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554865431] [2024-12-02 11:55:32,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:32,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:55:32,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:32,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:55:32,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:55:32,553 INFO L87 Difference]: Start difference. First operand 1174 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-12-02 11:55:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:32,665 INFO L93 Difference]: Finished difference Result 3106 states and 4099 transitions. [2024-12-02 11:55:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:55:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2024-12-02 11:55:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:32,676 INFO L225 Difference]: With dead ends: 3106 [2024-12-02 11:55:32,676 INFO L226 Difference]: Without dead ends: 1942 [2024-12-02 11:55:32,680 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-12-02 11:55:32,680 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 118 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:32,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 322 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:55:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2024-12-02 11:55:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1924. [2024-12-02 11:55:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1924 states, 1572 states have (on average 1.3021628498727735) internal successors, (2047), 1596 states have internal predecessors, (2047), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249) [2024-12-02 11:55:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 2496 transitions. [2024-12-02 11:55:32,849 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 2496 transitions. Word has length 56 [2024-12-02 11:55:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:32,849 INFO L471 AbstractCegarLoop]: Abstraction has 1924 states and 2496 transitions. [2024-12-02 11:55:32,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-12-02 11:55:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 2496 transitions. [2024-12-02 11:55:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-02 11:55:32,850 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:32,851 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 11:55:32,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-12-02 11:55:32,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash -824982412, now seen corresponding path program 1 times [2024-12-02 11:55:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29669365] [2024-12-02 11:55:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-02 11:55:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29669365] [2024-12-02 11:55:32,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29669365] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:32,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:32,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-12-02 11:55:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733298158] [2024-12-02 11:55:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:32,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-02 11:55:32,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:32,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-02 11:55:32,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-12-02 11:55:32,932 INFO L87 Difference]: Start difference. First operand 1924 states and 2496 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:55:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:33,625 INFO L93 Difference]: Finished difference Result 5707 states and 7470 transitions. [2024-12-02 11:55:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 11:55:33,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2024-12-02 11:55:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:33,648 INFO L225 Difference]: With dead ends: 5707 [2024-12-02 11:55:33,648 INFO L226 Difference]: Without dead ends: 3794 [2024-12-02 11:55:33,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-12-02 11:55:33,655 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 551 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:33,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 682 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:55:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2024-12-02 11:55:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3696. [2024-12-02 11:55:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3018 states have (on average 1.2842942345924453) internal successors, (3876), 3063 states have internal predecessors, (3876), 384 states have call successors, (384), 258 states have call predecessors, (384), 290 states have return successors, (555), 376 states have call predecessors, (555), 384 states have call successors, (555) [2024-12-02 11:55:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 4815 transitions. [2024-12-02 11:55:34,065 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 4815 transitions. Word has length 73 [2024-12-02 11:55:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:34,066 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 4815 transitions. [2024-12-02 11:55:34,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-12-02 11:55:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 4815 transitions. [2024-12-02 11:55:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-02 11:55:34,068 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:34,069 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 11:55:34,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-12-02 11:55:34,069 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:34,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:34,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1893221054, now seen corresponding path program 1 times [2024-12-02 11:55:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:34,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738856908] [2024-12-02 11:55:34,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-02 11:55:34,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:34,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738856908] [2024-12-02 11:55:34,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738856908] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 11:55:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510712580] [2024-12-02 11:55:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 11:55:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:34,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 11:55:34,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 11:55:34,191 INFO L87 Difference]: Start difference. First operand 3696 states and 4815 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-12-02 11:55:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:34,618 INFO L93 Difference]: Finished difference Result 6721 states and 8706 transitions. [2024-12-02 11:55:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-02 11:55:34,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 87 [2024-12-02 11:55:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:34,641 INFO L225 Difference]: With dead ends: 6721 [2024-12-02 11:55:34,641 INFO L226 Difference]: Without dead ends: 3790 [2024-12-02 11:55:34,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-12-02 11:55:34,649 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 169 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:34,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 339 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 11:55:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2024-12-02 11:55:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 3752. [2024-12-02 11:55:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3752 states, 3046 states have (on average 1.2724885095206828) internal successors, (3876), 3111 states have internal predecessors, (3876), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531) [2024-12-02 11:55:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 4791 transitions. [2024-12-02 11:55:35,004 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 4791 transitions. Word has length 87 [2024-12-02 11:55:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:35,004 INFO L471 AbstractCegarLoop]: Abstraction has 3752 states and 4791 transitions. [2024-12-02 11:55:35,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-12-02 11:55:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 4791 transitions. [2024-12-02 11:55:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-02 11:55:35,006 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:35,007 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 11:55:35,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-12-02 11:55:35,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:35,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash 2133460800, now seen corresponding path program 1 times [2024-12-02 11:55:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:35,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290028948] [2024-12-02 11:55:35,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-02 11:55:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290028948] [2024-12-02 11:55:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290028948] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 11:55:35,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379743595] [2024-12-02 11:55:35,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:55:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:35,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:55:35,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:55:35,041 INFO L87 Difference]: Start difference. First operand 3752 states and 4791 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-12-02 11:55:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:35,206 INFO L93 Difference]: Finished difference Result 3754 states and 4791 transitions. [2024-12-02 11:55:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:55:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2024-12-02 11:55:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:35,220 INFO L225 Difference]: With dead ends: 3754 [2024-12-02 11:55:35,220 INFO L226 Difference]: Without dead ends: 3025 [2024-12-02 11:55:35,222 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-12-02 11:55:35,223 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:35,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 152 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:55:35,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2024-12-02 11:55:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 3025. [2024-12-02 11:55:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2460 states have (on average 1.278048780487805) internal successors, (3144), 2515 states have internal predecessors, (3144), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2024-12-02 11:55:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 3878 transitions. [2024-12-02 11:55:35,443 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 3878 transitions. Word has length 87 [2024-12-02 11:55:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:35,443 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 3878 transitions. [2024-12-02 11:55:35,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-12-02 11:55:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 3878 transitions. [2024-12-02 11:55:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-02 11:55:35,444 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:35,444 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 11:55:35,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-12-02 11:55:35,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:35,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash -344937820, now seen corresponding path program 1 times [2024-12-02 11:55:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216432991] [2024-12-02 11:55:35,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:35,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-02 11:55:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216432991] [2024-12-02 11:55:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216432991] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:35,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-12-02 11:55:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944120446] [2024-12-02 11:55:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:35,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-12-02 11:55:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:35,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-12-02 11:55:35,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-12-02 11:55:35,530 INFO L87 Difference]: Start difference. First operand 3025 states and 3878 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-12-02 11:55:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:36,247 INFO L93 Difference]: Finished difference Result 5077 states and 6577 transitions. [2024-12-02 11:55:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-02 11:55:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2024-12-02 11:55:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:36,262 INFO L225 Difference]: With dead ends: 5077 [2024-12-02 11:55:36,262 INFO L226 Difference]: Without dead ends: 3107 [2024-12-02 11:55:36,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-12-02 11:55:36,267 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 884 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:36,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 766 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-12-02 11:55:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2024-12-02 11:55:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3025. [2024-12-02 11:55:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2460 states have (on average 1.2691056910569105) internal successors, (3122), 2515 states have internal predecessors, (3122), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-12-02 11:55:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 3823 transitions. [2024-12-02 11:55:36,538 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 3823 transitions. Word has length 89 [2024-12-02 11:55:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:36,538 INFO L471 AbstractCegarLoop]: Abstraction has 3025 states and 3823 transitions. [2024-12-02 11:55:36,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-12-02 11:55:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 3823 transitions. [2024-12-02 11:55:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-02 11:55:36,540 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:36,541 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 11:55:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-12-02 11:55:36,541 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash 293950538, now seen corresponding path program 1 times [2024-12-02 11:55:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149431971] [2024-12-02 11:55:36,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 11:55:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-02 11:55:36,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-02 11:55:36,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149431971] [2024-12-02 11:55:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149431971] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 11:55:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 11:55:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-02 11:55:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117391276] [2024-12-02 11:55:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 11:55:36,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 11:55:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-02 11:55:36,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 11:55:36,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 11:55:36,585 INFO L87 Difference]: Start difference. First operand 3025 states and 3823 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-12-02 11:55:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 11:55:36,828 INFO L93 Difference]: Finished difference Result 3025 states and 3823 transitions. [2024-12-02 11:55:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 11:55:36,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 95 [2024-12-02 11:55:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 11:55:36,841 INFO L225 Difference]: With dead ends: 3025 [2024-12-02 11:55:36,841 INFO L226 Difference]: Without dead ends: 3024 [2024-12-02 11:55:36,843 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-12-02 11:55:36,843 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 11:55:36,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 11:55:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3024 states. [2024-12-02 11:55:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3024 to 3024. [2024-12-02 11:55:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 2460 states have (on average 1.2654471544715447) internal successors, (3113), 2514 states have internal predecessors, (3113), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-12-02 11:55:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 3814 transitions. [2024-12-02 11:55:37,047 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 3814 transitions. Word has length 95 [2024-12-02 11:55:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 11:55:37,047 INFO L471 AbstractCegarLoop]: Abstraction has 3024 states and 3814 transitions. [2024-12-02 11:55:37,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-12-02 11:55:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 3814 transitions. [2024-12-02 11:55:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-02 11:55:37,049 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 11:55:37,049 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-12-02 11:55:37,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-12-02 11:55:37,049 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-12-02 11:55:37,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 11:55:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash 522532389, now seen corresponding path program 1 times [2024-12-02 11:55:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-02 11:55:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086905878] [2024-12-02 11:55:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 11:55:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 11:55:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:55:37,064 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 11:55:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 11:55:37,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-12-02 11:55:37,109 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-12-02 11:55:37,110 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-12-02 11:55:37,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-12-02 11:55:37,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-12-02 11:55:37,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-12-02 11:55:37,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-12-02 11:55:37,116 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] [2024-12-02 11:55:37,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-12-02 11:55:37,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:55:37 BoogieIcfgContainer [2024-12-02 11:55:37,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-12-02 11:55:37,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-02 11:55:37,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-02 11:55:37,182 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-02 11:55:37,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:55:26" (3/4) ... [2024-12-02 11:55:37,183 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-02 11:55:37,263 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 69. [2024-12-02 11:55:37,349 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml [2024-12-02 11:55:37,349 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/witness.yml [2024-12-02 11:55:37,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-02 11:55:37,351 INFO L158 Benchmark]: Toolchain (without parser) took 11584.57ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 117.2MB in the beginning and 223.2MB in the end (delta: -106.0MB). Peak memory consumption was 307.9MB. Max. memory is 16.1GB. [2024-12-02 11:55:37,351 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:55:37,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.25ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 103.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 11:55:37,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.96ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 11:55:37,352 INFO L158 Benchmark]: Boogie Preprocessor took 44.52ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 100.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 11:55:37,352 INFO L158 Benchmark]: RCFGBuilder took 461.78ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 80.8MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:55:37,353 INFO L158 Benchmark]: TraceAbstraction took 10616.78ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 80.3MB in the beginning and 236.1MB in the end (delta: -155.9MB). Peak memory consumption was 257.6MB. Max. memory is 16.1GB. [2024-12-02 11:55:37,353 INFO L158 Benchmark]: Witness Printer took 168.19ms. Allocated memory is still 553.6MB. Free memory was 236.1MB in the beginning and 223.2MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-02 11:55:37,355 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.24ms. Allocated memory is still 142.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.25ms. Allocated memory is still 142.6MB. Free memory was 117.0MB in the beginning and 103.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.96ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 102.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.52ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 100.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 461.78ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 80.8MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10616.78ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 80.3MB in the beginning and 236.1MB in the end (delta: -155.9MB). Peak memory consumption was 257.6MB. Max. memory is 16.1GB. * Witness Printer took 168.19ms. Allocated memory is still 553.6MB. Free memory was 236.1MB in the beginning and 223.2MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. 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 - CounterExampleResult [Line: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L353] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 120 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4212 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4117 mSDsluCounter, 8768 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5841 mSDsCounter, 593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3444 IncrementalHoareTripleChecker+Invalid, 4037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 593 mSolverCounterUnsat, 2927 mSDtfsCounter, 3444 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3752occurred in iteration=15, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 644 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1113 ConstructedInterpolants, 0 QuantifiedInterpolants, 1940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 116/116 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 RESULT: Ultimate proved your program to be incorrect! [2024-12-02 11:55:37,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e5f3927-031b-441a-8f0a-857bf2cc4c28/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)