./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:18:57,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:18:57,178 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:18:57,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:18:57,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:18:57,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:18:57,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:18:57,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:18:57,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:18:57,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:18:57,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:18:57,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:18:57,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:18:57,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:18:57,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:18:57,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:18:57,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:18:57,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:18:57,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:18:57,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:18:57,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:18:57,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:18:57,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:18:57,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:18:57,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:18:57,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:18:57,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:18:57,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:18:57,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:18:57,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:18:57,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:18:57,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:18:57,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:18:57,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:18:57,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:18:57,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:18:57,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:18:57,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:18:57,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:18:57,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:18:57,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:18:57,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:18:57,215 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_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd 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 ! call(reach_error())) ) 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 -> e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 [2024-11-13 14:18:57,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:18:57,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:18:57,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:18:57,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:18:57,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:18:57,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i Unable to find full path for "g++" [2024-11-13 14:18:59,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:18:59,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:18:59,985 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i [2024-11-13 14:18:59,995 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/data/14110652b/6ebf0df2e4f64cdda97bc362343e49bc/FLAG7b50beef1 [2024-11-13 14:19:00,288 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/data/14110652b/6ebf0df2e4f64cdda97bc362343e49bc [2024-11-13 14:19:00,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:19:00,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:19:00,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:19:00,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:19:00,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:19:00,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee61da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00, skipping insertion in model container [2024-11-13 14:19:00,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:19:00,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i[916,929] [2024-11-13 14:19:00,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:19:00,624 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:19:00,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i[916,929] [2024-11-13 14:19:00,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:19:00,703 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:19:00,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00 WrapperNode [2024-11-13 14:19:00,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:19:00,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:19:00,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:19:00,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:19:00,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,797 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-13 14:19:00,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:19:00,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:19:00,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:19:00,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:19:00,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:19:00,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:19:00,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:19:00,903 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:19:00,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:19:00,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (1/1) ... [2024-11-13 14:19:00,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:19:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:19:00,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:19:00,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5907dc7-d5f6-48f0-a512-7e45bfca2832/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:19:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:19:00,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:19:00,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:19:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:19:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:19:00,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:19:01,094 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:19:01,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:19:01,937 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-13 14:19:01,938 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:19:01,949 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:19:01,949 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:19:01,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:19:01 BoogieIcfgContainer [2024-11-13 14:19:01,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:19:01,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:19:01,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:19:01,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:19:01,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:19:00" (1/3) ... [2024-11-13 14:19:01,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d27978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:19:01, skipping insertion in model container [2024-11-13 14:19:01,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:19:00" (2/3) ... [2024-11-13 14:19:01,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d27978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:19:01, skipping insertion in model container [2024-11-13 14:19:01,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:19:01" (3/3) ... [2024-11-13 14:19:01,962 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-63.i [2024-11-13 14:19:01,981 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:19:01,983 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-63.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:19:02,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:19:02,064 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;@3ec1f395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:19:02,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:19:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:19:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:02,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:02,093 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:02,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:02,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:02,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1314267218, now seen corresponding path program 1 times [2024-11-13 14:19:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458088841] [2024-11-13 14:19:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458088841] [2024-11-13 14:19:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458088841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:19:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188801883] [2024-11-13 14:19:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:02,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:19:02,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:19:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:19:02,974 INFO L87 Difference]: Start difference. First operand has 89 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:03,034 INFO L93 Difference]: Finished difference Result 170 states and 290 transitions. [2024-11-13 14:19:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:19:03,037 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:03,046 INFO L225 Difference]: With dead ends: 170 [2024-11-13 14:19:03,047 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 14:19:03,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:19:03,054 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:03,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:19:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 14:19:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 14:19:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 14:19:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-13 14:19:03,116 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 143 [2024-11-13 14:19:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:03,118 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-13 14:19:03,119 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-13 14:19:03,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:03,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:03,125 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:03,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:19:03,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash -483607026, now seen corresponding path program 1 times [2024-11-13 14:19:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:03,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195929538] [2024-11-13 14:19:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:03,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:03,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195929538] [2024-11-13 14:19:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195929538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:04,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:04,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:19:04,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702708458] [2024-11-13 14:19:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:04,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:19:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:04,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:19:04,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:04,154 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:04,476 INFO L93 Difference]: Finished difference Result 247 states and 373 transitions. [2024-11-13 14:19:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:19:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:04,483 INFO L225 Difference]: With dead ends: 247 [2024-11-13 14:19:04,483 INFO L226 Difference]: Without dead ends: 166 [2024-11-13 14:19:04,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:19:04,485 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 92 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:04,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 350 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:19:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-13 14:19:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2024-11-13 14:19:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 14:19:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-11-13 14:19:04,531 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 143 [2024-11-13 14:19:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:04,532 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-11-13 14:19:04,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-11-13 14:19:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:04,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:04,534 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:04,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:19:04,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:04,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -617620532, now seen corresponding path program 1 times [2024-11-13 14:19:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502031626] [2024-11-13 14:19:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:05,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502031626] [2024-11-13 14:19:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502031626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:05,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:05,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:19:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140571476] [2024-11-13 14:19:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:05,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:19:05,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:05,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:19:05,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:05,311 INFO L87 Difference]: Start difference. First operand 131 states and 198 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:05,583 INFO L93 Difference]: Finished difference Result 321 states and 475 transitions. [2024-11-13 14:19:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:19:05,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:05,589 INFO L225 Difference]: With dead ends: 321 [2024-11-13 14:19:05,590 INFO L226 Difference]: Without dead ends: 240 [2024-11-13 14:19:05,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:05,595 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 197 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:05,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 268 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:19:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-13 14:19:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2024-11-13 14:19:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 139 states have (on average 1.3525179856115108) internal successors, (188), 140 states have internal predecessors, (188), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:19:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 284 transitions. [2024-11-13 14:19:05,654 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 284 transitions. Word has length 143 [2024-11-13 14:19:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:05,659 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 284 transitions. [2024-11-13 14:19:05,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 284 transitions. [2024-11-13 14:19:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:05,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:05,662 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:19:05,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:05,667 INFO L85 PathProgramCache]: Analyzing trace with hash -981898296, now seen corresponding path program 1 times [2024-11-13 14:19:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:05,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306822934] [2024-11-13 14:19:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:05,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306822934] [2024-11-13 14:19:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306822934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:21,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:21,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 14:19:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010627122] [2024-11-13 14:19:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:19:21,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:19:21,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:19:21,415 INFO L87 Difference]: Start difference. First operand 192 states and 284 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:26,055 INFO L93 Difference]: Finished difference Result 792 states and 1148 transitions. [2024-11-13 14:19:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 14:19:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:26,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:26,066 INFO L225 Difference]: With dead ends: 792 [2024-11-13 14:19:26,066 INFO L226 Difference]: Without dead ends: 656 [2024-11-13 14:19:26,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2024-11-13 14:19:26,069 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1026 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:26,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 817 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 14:19:26,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-13 14:19:26,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 237. [2024-11-13 14:19:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 184 states have (on average 1.375) internal successors, (253), 185 states have internal predecessors, (253), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:19:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 349 transitions. [2024-11-13 14:19:26,112 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 349 transitions. Word has length 143 [2024-11-13 14:19:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:26,116 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 349 transitions. [2024-11-13 14:19:26,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 349 transitions. [2024-11-13 14:19:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:26,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:26,119 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:26,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:19:26,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:26,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1791244922, now seen corresponding path program 1 times [2024-11-13 14:19:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110152274] [2024-11-13 14:19:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110152274] [2024-11-13 14:19:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110152274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:37,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:19:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472386114] [2024-11-13 14:19:37,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:37,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:19:37,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:19:37,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:19:37,529 INFO L87 Difference]: Start difference. First operand 237 states and 349 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:40,338 INFO L93 Difference]: Finished difference Result 623 states and 903 transitions. [2024-11-13 14:19:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:19:40,341 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:40,344 INFO L225 Difference]: With dead ends: 623 [2024-11-13 14:19:40,345 INFO L226 Difference]: Without dead ends: 442 [2024-11-13 14:19:40,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2024-11-13 14:19:40,346 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 342 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:40,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 847 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:19:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-13 14:19:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 262. [2024-11-13 14:19:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 209 states have (on average 1.38755980861244) internal successors, (290), 210 states have internal predecessors, (290), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:19:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 386 transitions. [2024-11-13 14:19:40,376 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 386 transitions. Word has length 143 [2024-11-13 14:19:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:40,376 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 386 transitions. [2024-11-13 14:19:40,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 386 transitions. [2024-11-13 14:19:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:40,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:40,379 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:40,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:19:40,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:40,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash -194918706, now seen corresponding path program 1 times [2024-11-13 14:19:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000405364] [2024-11-13 14:19:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:40,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000405364] [2024-11-13 14:19:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000405364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:40,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:19:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176808603] [2024-11-13 14:19:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:40,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:19:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:40,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:19:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:19:40,762 INFO L87 Difference]: Start difference. First operand 262 states and 386 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:41,095 INFO L93 Difference]: Finished difference Result 548 states and 807 transitions. [2024-11-13 14:19:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:19:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:41,099 INFO L225 Difference]: With dead ends: 548 [2024-11-13 14:19:41,099 INFO L226 Difference]: Without dead ends: 342 [2024-11-13 14:19:41,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:19:41,103 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 165 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:41,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 543 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:19:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-13 14:19:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 327. [2024-11-13 14:19:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 254 states have internal predecessors, (344), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 14:19:41,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 480 transitions. [2024-11-13 14:19:41,150 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 480 transitions. Word has length 143 [2024-11-13 14:19:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:41,150 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 480 transitions. [2024-11-13 14:19:41,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 480 transitions. [2024-11-13 14:19:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:41,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:41,155 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:41,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:19:41,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:41,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1004265332, now seen corresponding path program 1 times [2024-11-13 14:19:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:41,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108373490] [2024-11-13 14:19:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:47,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:47,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108373490] [2024-11-13 14:19:47,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108373490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:47,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:47,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:19:47,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871618569] [2024-11-13 14:19:47,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:47,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:19:47,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:19:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:19:47,569 INFO L87 Difference]: Start difference. First operand 327 states and 480 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:49,867 INFO L93 Difference]: Finished difference Result 872 states and 1265 transitions. [2024-11-13 14:19:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 14:19:49,867 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:49,871 INFO L225 Difference]: With dead ends: 872 [2024-11-13 14:19:49,871 INFO L226 Difference]: Without dead ends: 601 [2024-11-13 14:19:49,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:19:49,873 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 474 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:49,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 782 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 14:19:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-11-13 14:19:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 367. [2024-11-13 14:19:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 292 states have (on average 1.3732876712328768) internal successors, (401), 294 states have internal predecessors, (401), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 14:19:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 537 transitions. [2024-11-13 14:19:49,915 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 537 transitions. Word has length 143 [2024-11-13 14:19:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:49,917 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 537 transitions. [2024-11-13 14:19:49,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 537 transitions. [2024-11-13 14:19:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-13 14:19:49,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:49,920 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:49,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:19:49,920 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:49,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:49,921 INFO L85 PathProgramCache]: Analyzing trace with hash -559196470, now seen corresponding path program 1 times [2024-11-13 14:19:49,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:49,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070385743] [2024-11-13 14:19:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070385743] [2024-11-13 14:19:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070385743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:50,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:50,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:19:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042922461] [2024-11-13 14:19:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:19:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:19:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:50,210 INFO L87 Difference]: Start difference. First operand 367 states and 537 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:50,403 INFO L93 Difference]: Finished difference Result 685 states and 1001 transitions. [2024-11-13 14:19:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:19:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-13 14:19:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:50,407 INFO L225 Difference]: With dead ends: 685 [2024-11-13 14:19:50,407 INFO L226 Difference]: Without dead ends: 414 [2024-11-13 14:19:50,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:50,409 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 134 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:50,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 411 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:19:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-13 14:19:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 355. [2024-11-13 14:19:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 280 states have (on average 1.3607142857142858) internal successors, (381), 282 states have internal predecessors, (381), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 14:19:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 517 transitions. [2024-11-13 14:19:50,443 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 517 transitions. Word has length 143 [2024-11-13 14:19:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:50,443 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 517 transitions. [2024-11-13 14:19:50,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 517 transitions. [2024-11-13 14:19:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 14:19:50,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:50,446 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:19:50,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:50,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash 228113806, now seen corresponding path program 1 times [2024-11-13 14:19:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174336491] [2024-11-13 14:19:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174336491] [2024-11-13 14:19:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174336491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:56,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:19:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541921562] [2024-11-13 14:19:56,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:56,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:19:56,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:56,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:19:56,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:19:56,287 INFO L87 Difference]: Start difference. First operand 355 states and 517 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:58,980 INFO L93 Difference]: Finished difference Result 918 states and 1333 transitions. [2024-11-13 14:19:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:19:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-13 14:19:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:58,985 INFO L225 Difference]: With dead ends: 918 [2024-11-13 14:19:58,985 INFO L226 Difference]: Without dead ends: 659 [2024-11-13 14:19:58,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:19:58,988 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 648 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:58,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 665 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-13 14:19:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-13 14:19:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 338. [2024-11-13 14:19:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 263 states have (on average 1.361216730038023) internal successors, (358), 265 states have internal predecessors, (358), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 14:19:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 494 transitions. [2024-11-13 14:19:59,028 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 494 transitions. Word has length 144 [2024-11-13 14:19:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 494 transitions. [2024-11-13 14:19:59,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 494 transitions. [2024-11-13 14:19:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 14:19:59,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:59,034 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:59,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:19:59,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:59,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:59,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1973909763, now seen corresponding path program 1 times [2024-11-13 14:19:59,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:59,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355843406] [2024-11-13 14:19:59,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:59,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:19:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:19:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:19:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:19:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:19:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:19:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:19:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:19:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:19:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:19:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:19:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:19:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:19:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:19:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:19:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:19:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:19:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:19:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:19:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:19:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:19:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:19:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:19:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355843406] [2024-11-13 14:19:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355843406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:19:59,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:19:59,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:19:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531329859] [2024-11-13 14:19:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:19:59,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:19:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:19:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:19:59,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:59,252 INFO L87 Difference]: Start difference. First operand 338 states and 494 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:19:59,362 INFO L93 Difference]: Finished difference Result 764 states and 1112 transitions. [2024-11-13 14:19:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:19:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-13 14:19:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:19:59,367 INFO L225 Difference]: With dead ends: 764 [2024-11-13 14:19:59,367 INFO L226 Difference]: Without dead ends: 522 [2024-11-13 14:19:59,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:19:59,369 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 114 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:19:59,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 227 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:19:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-13 14:19:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 517. [2024-11-13 14:19:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 420 states have (on average 1.3595238095238096) internal successors, (571), 425 states have internal predecessors, (571), 86 states have call successors, (86), 10 states have call predecessors, (86), 10 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-13 14:19:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 743 transitions. [2024-11-13 14:19:59,427 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 743 transitions. Word has length 144 [2024-11-13 14:19:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:19:59,428 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 743 transitions. [2024-11-13 14:19:59,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:19:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 743 transitions. [2024-11-13 14:19:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 14:19:59,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:19:59,430 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:19:59,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:19:59,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:19:59,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:19:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1309743052, now seen corresponding path program 1 times [2024-11-13 14:19:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:19:59,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096239548] [2024-11-13 14:19:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:19:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:19:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:20:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:20:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:20:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:20:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:20:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:20:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:20:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:20:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:20:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:20:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:20:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:20:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:20:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:20:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:20:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:20:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:20:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:20:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:20:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:20:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:20:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096239548] [2024-11-13 14:20:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096239548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:05,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:05,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:20:05,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502777115] [2024-11-13 14:20:05,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:20:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:20:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:20:05,156 INFO L87 Difference]: Start difference. First operand 517 states and 743 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:07,305 INFO L93 Difference]: Finished difference Result 1288 states and 1844 transitions. [2024-11-13 14:20:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:20:07,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-13 14:20:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:07,310 INFO L225 Difference]: With dead ends: 1288 [2024-11-13 14:20:07,310 INFO L226 Difference]: Without dead ends: 895 [2024-11-13 14:20:07,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-13 14:20:07,312 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 525 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:07,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 631 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-13 14:20:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-13 14:20:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 476. [2024-11-13 14:20:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 379 states have (on average 1.353562005277045) internal successors, (513), 384 states have internal predecessors, (513), 86 states have call successors, (86), 10 states have call predecessors, (86), 10 states have return successors, (86), 81 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-13 14:20:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 685 transitions. [2024-11-13 14:20:07,371 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 685 transitions. Word has length 144 [2024-11-13 14:20:07,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:07,372 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 685 transitions. [2024-11-13 14:20:07,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 685 transitions. [2024-11-13 14:20:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 14:20:07,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:07,374 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:07,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:20:07,375 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:20:07,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1386523302, now seen corresponding path program 1 times [2024-11-13 14:20:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:07,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967406316] [2024-11-13 14:20:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:20:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:20:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:20:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:20:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:20:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:20:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:20:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:20:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:20:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:20:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:20:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:20:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:20:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:20:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:20:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:20:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:20:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:20:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:20:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:20:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:20:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967406316] [2024-11-13 14:20:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967406316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:20:08,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631378654] [2024-11-13 14:20:08,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:08,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:20:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:08,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:20:08,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:20:08,832 INFO L87 Difference]: Start difference. First operand 476 states and 685 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:10,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:10,646 INFO L93 Difference]: Finished difference Result 1617 states and 2276 transitions. [2024-11-13 14:20:10,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:20:10,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-13 14:20:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:10,653 INFO L225 Difference]: With dead ends: 1617 [2024-11-13 14:20:10,653 INFO L226 Difference]: Without dead ends: 1197 [2024-11-13 14:20:10,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:20:10,656 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 382 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:10,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1112 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:20:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-13 14:20:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 865. [2024-11-13 14:20:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 756 states have (on average 1.3941798941798942) internal successors, (1054), 765 states have internal predecessors, (1054), 94 states have call successors, (94), 14 states have call predecessors, (94), 14 states have return successors, (94), 85 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-13 14:20:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1242 transitions. [2024-11-13 14:20:10,747 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1242 transitions. Word has length 144 [2024-11-13 14:20:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:10,748 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1242 transitions. [2024-11-13 14:20:10,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1242 transitions. [2024-11-13 14:20:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 14:20:10,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:10,752 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:10,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 14:20:10,752 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:20:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -154474850, now seen corresponding path program 1 times [2024-11-13 14:20:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:10,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768089832] [2024-11-13 14:20:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:10,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:20:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:20:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:20:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:20:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:20:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:20:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:20:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:20:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:20:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:20:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:20:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:20:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:20:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:20:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:20:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:20:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:20:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:20:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:20:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:20:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:20:11,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:11,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768089832] [2024-11-13 14:20:11,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768089832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:11,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:11,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:20:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271669987] [2024-11-13 14:20:11,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:11,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:20:11,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:11,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:20:11,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:20:11,152 INFO L87 Difference]: Start difference. First operand 865 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:11,579 INFO L93 Difference]: Finished difference Result 1889 states and 2707 transitions. [2024-11-13 14:20:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:20:11,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-13 14:20:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:11,586 INFO L225 Difference]: With dead ends: 1889 [2024-11-13 14:20:11,587 INFO L226 Difference]: Without dead ends: 1393 [2024-11-13 14:20:11,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:20:11,589 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 249 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:11,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 483 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:20:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-13 14:20:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 925. [2024-11-13 14:20:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 816 states have (on average 1.3958333333333333) internal successors, (1139), 825 states have internal predecessors, (1139), 94 states have call successors, (94), 14 states have call predecessors, (94), 14 states have return successors, (94), 85 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-13 14:20:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1327 transitions. [2024-11-13 14:20:11,693 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1327 transitions. Word has length 144 [2024-11-13 14:20:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:11,694 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1327 transitions. [2024-11-13 14:20:11,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1327 transitions. [2024-11-13 14:20:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 14:20:11,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:11,699 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:11,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:20:11,699 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:20:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1328099240, now seen corresponding path program 1 times [2024-11-13 14:20:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:11,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472094262] [2024-11-13 14:20:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:11,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:20:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:20:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:20:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:20:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:20:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:20:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:20:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:20:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:20:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:20:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:20:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:20:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:20:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:20:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:20:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:20:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:20:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:20:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:20:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:20:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:20:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:20:16,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:20:16,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472094262] [2024-11-13 14:20:16,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472094262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:20:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:20:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-13 14:20:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812651260] [2024-11-13 14:20:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:20:16,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 14:20:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:20:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 14:20:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:20:16,924 INFO L87 Difference]: Start difference. First operand 925 states and 1327 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:20:20,137 INFO L93 Difference]: Finished difference Result 1564 states and 2197 transitions. [2024-11-13 14:20:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:20:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-13 14:20:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:20:20,143 INFO L225 Difference]: With dead ends: 1564 [2024-11-13 14:20:20,143 INFO L226 Difference]: Without dead ends: 1083 [2024-11-13 14:20:20,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:20:20,146 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 403 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:20:20,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1128 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 14:20:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-13 14:20:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 957. [2024-11-13 14:20:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 835 states have (on average 1.38562874251497) internal successors, (1157), 844 states have internal predecessors, (1157), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:20:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1361 transitions. [2024-11-13 14:20:20,245 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1361 transitions. Word has length 144 [2024-11-13 14:20:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:20:20,246 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1361 transitions. [2024-11-13 14:20:20,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:20:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1361 transitions. [2024-11-13 14:20:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:20:20,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:20:20,248 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:20:20,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:20:20,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:20:20,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:20:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1663569181, now seen corresponding path program 1 times [2024-11-13 14:20:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:20:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509323191] [2024-11-13 14:20:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:20:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:20:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:21:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:21:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:21:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:21:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:21:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:21:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:21:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:21:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:21:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:21:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:21:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:21:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:21:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:21:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:21:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:21:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:21:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:21:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:21:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:21:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:21:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:21:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509323191] [2024-11-13 14:21:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509323191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:21:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:21:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-13 14:21:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744423241] [2024-11-13 14:21:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:21:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 14:21:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:21:04,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 14:21:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-13 14:21:04,282 INFO L87 Difference]: Start difference. First operand 957 states and 1361 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:21:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:21:23,949 INFO L93 Difference]: Finished difference Result 1300 states and 1815 transitions. [2024-11-13 14:21:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 14:21:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-13 14:21:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:21:23,955 INFO L225 Difference]: With dead ends: 1300 [2024-11-13 14:21:23,955 INFO L226 Difference]: Without dead ends: 1298 [2024-11-13 14:21:23,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2024-11-13 14:21:23,957 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 413 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:21:23,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 839 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2024-11-13 14:21:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-11-13 14:21:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1025. [2024-11-13 14:21:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 903 states have (on average 1.3853820598006645) internal successors, (1251), 912 states have internal predecessors, (1251), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:21:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1455 transitions. [2024-11-13 14:21:24,067 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1455 transitions. Word has length 145 [2024-11-13 14:21:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:21:24,068 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1455 transitions. [2024-11-13 14:21:24,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:21:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1455 transitions. [2024-11-13 14:21:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:21:24,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:21:24,071 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:21:24,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:21:24,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:21:24,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:21:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1405403743, now seen corresponding path program 1 times [2024-11-13 14:21:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:21:24,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301502651] [2024-11-13 14:21:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:21:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:21:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:21:42,754 WARN L286 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 170 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:22:22,041 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 188 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:22:52,942 WARN L286 SmtUtils]: Spent 9.70s on a formula simplification. DAG size of input: 195 DAG size of output: 190 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:23:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:23:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:23:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:23:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:23:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:23:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:23:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:23:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:23:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:23:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:23:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:23:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:23:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:23:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:23:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:23:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:23:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:23:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:23:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:23:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:23:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:23:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:23:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:23:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301502651] [2024-11-13 14:23:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301502651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:23:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:23:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-13 14:23:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616770067] [2024-11-13 14:23:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:23:12,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 14:23:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:23:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 14:23:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:23:12,770 INFO L87 Difference]: Start difference. First operand 1025 states and 1455 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:23:15,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:23:26,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:23:30,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:23:42,864 WARN L286 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 192 DAG size of output: 186 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:23:54,136 WARN L286 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 207 DAG size of output: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:24:12,103 WARN L286 SmtUtils]: Spent 9.95s on a formula simplification. DAG size of input: 187 DAG size of output: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:24:20,250 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 186 DAG size of output: 186 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:24:41,229 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 181 DAG size of output: 181 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:24:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:24:45,687 INFO L93 Difference]: Finished difference Result 1427 states and 1992 transitions. [2024-11-13 14:24:45,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 14:24:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-13 14:24:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:24:45,694 INFO L225 Difference]: With dead ends: 1427 [2024-11-13 14:24:45,694 INFO L226 Difference]: Without dead ends: 1425 [2024-11-13 14:24:45,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 100.6s TimeCoverageRelationStatistics Valid=280, Invalid=776, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:24:45,696 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 462 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:24:45,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 828 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 30.7s Time] [2024-11-13 14:24:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-11-13 14:24:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1063. [2024-11-13 14:24:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 941 states have (on average 1.3868225292242295) internal successors, (1305), 950 states have internal predecessors, (1305), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:24:45,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1509 transitions. [2024-11-13 14:24:45,825 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1509 transitions. Word has length 145 [2024-11-13 14:24:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:24:45,826 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1509 transitions. [2024-11-13 14:24:45,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:24:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1509 transitions. [2024-11-13 14:24:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:24:45,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:24:45,828 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:24:45,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 14:24:45,829 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:24:45,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:24:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1798430753, now seen corresponding path program 1 times [2024-11-13 14:24:45,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:24:45,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365496914] [2024-11-13 14:24:45,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:24:45,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:24:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:25:22,794 WARN L286 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 190 DAG size of output: 186 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:27:00,084 WARN L286 SmtUtils]: Spent 15.43s on a formula simplification. DAG size of input: 180 DAG size of output: 175 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:27:17,547 WARN L286 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 182 DAG size of output: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:27:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:27:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:27:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:27:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:27:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:27:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:27:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:27:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:27:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:27:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:27:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:27:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:27:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:27:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:27:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:27:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:27:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:27:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:27:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:27:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:27:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:27:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:27:29,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:27:29,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365496914] [2024-11-13 14:27:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365496914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:27:29,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:27:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-13 14:27:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529809035] [2024-11-13 14:27:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:27:29,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 14:27:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:27:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 14:27:29,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:27:29,160 INFO L87 Difference]: Start difference. First operand 1063 states and 1509 transitions. Second operand has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:27:36,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:27:48,591 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 186 DAG size of output: 183 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:27:52,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:28:10,195 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 185 DAG size of output: 171 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:28:16,505 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 186 DAG size of output: 141 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:28:30,874 WARN L286 SmtUtils]: Spent 7.66s on a formula simplification. DAG size of input: 172 DAG size of output: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:28:40,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 14:28:50,527 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 170 DAG size of output: 170 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:28:57,750 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 183 DAG size of output: 169 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:29:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:29:17,837 INFO L93 Difference]: Finished difference Result 1590 states and 2227 transitions. [2024-11-13 14:29:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 14:29:17,837 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-13 14:29:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:29:17,844 INFO L225 Difference]: With dead ends: 1590 [2024-11-13 14:29:17,844 INFO L226 Difference]: Without dead ends: 1588 [2024-11-13 14:29:17,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 133.8s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2024-11-13 14:29:17,846 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 294 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:29:17,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1025 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 40.3s Time] [2024-11-13 14:29:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2024-11-13 14:29:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1156. [2024-11-13 14:29:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1034 states have (on average 1.3994197292069632) internal successors, (1447), 1043 states have internal predecessors, (1447), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:29:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1651 transitions. [2024-11-13 14:29:17,973 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1651 transitions. Word has length 145 [2024-11-13 14:29:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:29:17,973 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1651 transitions. [2024-11-13 14:29:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:29:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1651 transitions. [2024-11-13 14:29:17,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:29:17,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:29:17,977 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:29:17,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 14:29:17,977 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:29:17,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:29:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1683454297, now seen corresponding path program 1 times [2024-11-13 14:29:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:29:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527019675] [2024-11-13 14:29:17,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:29:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:29:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:29:43,461 WARN L286 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 177 DAG size of output: 173 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:29:59,520 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 196 DAG size of output: 192 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:30:13,954 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 198 DAG size of output: 194 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:30:48,349 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification. DAG size of input: 217 DAG size of output: 202 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:31:12,195 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification. DAG size of input: 219 DAG size of output: 204 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:31:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:31:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:31:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:31:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:31:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:31:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:31:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:31:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:31:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:31:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:31:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:31:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:31:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:31:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:31:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:31:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:31:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 14:31:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 14:31:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 14:31:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-13 14:31:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:31:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 14:31:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:31:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527019675] [2024-11-13 14:31:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527019675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:31:25,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:31:25,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-13 14:31:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506745767] [2024-11-13 14:31:25,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:31:25,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 14:31:25,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:31:25,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 14:31:25,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-13 14:31:25,041 INFO L87 Difference]: Start difference. First operand 1156 states and 1651 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:31:43,758 WARN L286 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 184 DAG size of output: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:32:03,923 WARN L286 SmtUtils]: Spent 12.68s on a formula simplification. DAG size of input: 246 DAG size of output: 188 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:32:20,298 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification. DAG size of input: 244 DAG size of output: 186 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:32:29,236 WARN L286 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 244 DAG size of output: 186 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:32:39,703 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 192 DAG size of output: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:32:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:32:45,055 INFO L93 Difference]: Finished difference Result 1390 states and 1926 transitions. [2024-11-13 14:32:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 14:32:45,056 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-13 14:32:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:32:45,061 INFO L225 Difference]: With dead ends: 1390 [2024-11-13 14:32:45,061 INFO L226 Difference]: Without dead ends: 1388 [2024-11-13 14:32:45,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 106.4s TimeCoverageRelationStatistics Valid=450, Invalid=1530, Unknown=0, NotChecked=0, Total=1980 [2024-11-13 14:32:45,063 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 767 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:32:45,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1004 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 21.6s Time] [2024-11-13 14:32:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-13 14:32:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1199. [2024-11-13 14:32:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1077 states have (on average 1.3955431754874652) internal successors, (1503), 1086 states have internal predecessors, (1503), 102 states have call successors, (102), 19 states have call predecessors, (102), 19 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-13 14:32:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1707 transitions. [2024-11-13 14:32:45,204 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1707 transitions. Word has length 145 [2024-11-13 14:32:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:32:45,205 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1707 transitions. [2024-11-13 14:32:45,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 14:32:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1707 transitions. [2024-11-13 14:32:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 14:32:45,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:32:45,208 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:32:45,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 14:32:45,208 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:32:45,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:32:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1425288859, now seen corresponding path program 1 times [2024-11-13 14:32:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:32:45,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524150560] [2024-11-13 14:32:45,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:32:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:32:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:33:22,740 WARN L286 SmtUtils]: Spent 9.86s on a formula simplification. DAG size of input: 196 DAG size of output: 192 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)