./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.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_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/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_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/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_a12fbfef-a883-432d-b6ed-4d493da6db80/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 d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:13:02,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:13:02,969 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:13:02,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:13:02,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:13:03,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:13:03,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:13:03,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:13:03,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:13:03,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:13:03,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:13:03,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:13:03,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:13:03,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:13:03,013 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:13:03,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:13:03,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:13:03,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:13:03,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:13:03,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:13:03,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:13:03,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:13:03,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:13:03,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:13:03,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:13:03,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:13:03,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:13:03,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:13:03,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:13:03,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:13:03,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:13:03,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:13:03,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:13:03,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:13:03,016 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_a12fbfef-a883-432d-b6ed-4d493da6db80/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 -> d3f6bd0cc41c3fb11f5cfcc3010a6654288179c0475495df5b9f3093567937e2 [2024-11-13 16:13:03,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:13:03,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:13:03,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:13:03,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:13:03,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:13:03,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i Unable to find full path for "g++" [2024-11-13 16:13:05,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:13:05,534 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:13:05,535 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i [2024-11-13 16:13:05,556 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/data/a23e10f35/19cf2528673c4cf5927eb113207ecda8/FLAGa11620568 [2024-11-13 16:13:05,800 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/data/a23e10f35/19cf2528673c4cf5927eb113207ecda8 [2024-11-13 16:13:05,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:13:05,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:13:05,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:13:05,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:13:05,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:13:05,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:13:05" (1/1) ... [2024-11-13 16:13:05,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@481fa18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:05, skipping insertion in model container [2024-11-13 16:13:05,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:13:05" (1/1) ... [2024-11-13 16:13:05,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:13:05,956 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_a12fbfef-a883-432d-b6ed-4d493da6db80/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i[916,929] [2024-11-13 16:13:06,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:13:06,032 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:13:06,041 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_a12fbfef-a883-432d-b6ed-4d493da6db80/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-66.i[916,929] [2024-11-13 16:13:06,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:13:06,107 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:13:06,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06 WrapperNode [2024-11-13 16:13:06,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:13:06,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:13:06,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:13:06,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:13:06,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,202 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433 [2024-11-13 16:13:06,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:13:06,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:13:06,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:13:06,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:13:06,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,255 INFO L175 MemorySlicer]: Split 123 memory accesses to 6 slices as follows [2, 8, 8, 73, 7, 25]. 59 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 6, 1, 3]. The 16 writes are split as follows [0, 1, 3, 7, 1, 4]. [2024-11-13 16:13:06,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:13:06,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:13:06,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:13:06,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:13:06,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (1/1) ... [2024-11-13 16:13:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:13:06,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:13:06,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:13:06,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:13:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:13:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:13:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 16:13:06,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-13 16:13:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-13 16:13:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:13:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:13:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:13:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:13:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 16:13:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 16:13:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-13 16:13:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-13 16:13:06,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:13:06,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:13:06,575 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:13:06,577 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:13:07,116 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-13 16:13:07,116 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:13:07,127 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:13:07,128 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:13:07,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:13:07 BoogieIcfgContainer [2024-11-13 16:13:07,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:13:07,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:13:07,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:13:07,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:13:07,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:13:05" (1/3) ... [2024-11-13 16:13:07,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592521f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:13:07, skipping insertion in model container [2024-11-13 16:13:07,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:06" (2/3) ... [2024-11-13 16:13:07,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592521f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:13:07, skipping insertion in model container [2024-11-13 16:13:07,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:13:07" (3/3) ... [2024-11-13 16:13:07,138 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-66.i [2024-11-13 16:13:07,154 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:13:07,155 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-66.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:13:07,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:13:07,224 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;@6b357ccc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:13:07,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:13:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:13:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:13:07,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:07,240 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:07,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:07,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:07,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2009342673, now seen corresponding path program 1 times [2024-11-13 16:13:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664079582] [2024-11-13 16:13:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:07,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664079582] [2024-11-13 16:13:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664079582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:07,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:13:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950302886] [2024-11-13 16:13:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:07,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:13:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:07,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:13:07,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:13:07,767 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 70 states have internal predecessors, (97), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:07,801 INFO L93 Difference]: Finished difference Result 165 states and 258 transitions. [2024-11-13 16:13:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:13:07,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2024-11-13 16:13:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:07,813 INFO L225 Difference]: With dead ends: 165 [2024-11-13 16:13:07,813 INFO L226 Difference]: Without dead ends: 82 [2024-11-13 16:13:07,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:13:07,819 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:07,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-13 16:13:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-13 16:13:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:13:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-13 16:13:07,858 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 109 [2024-11-13 16:13:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:07,858 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-13 16:13:07,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-13 16:13:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:13:07,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:07,861 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:13:07,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:07,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1991479789, now seen corresponding path program 1 times [2024-11-13 16:13:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:07,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455129727] [2024-11-13 16:13:07,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:08,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455129727] [2024-11-13 16:13:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455129727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:08,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021891956] [2024-11-13 16:13:08,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:08,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:08,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:08,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:08,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:08,371 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:08,433 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2024-11-13 16:13:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:08,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-13 16:13:08,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:08,437 INFO L225 Difference]: With dead ends: 164 [2024-11-13 16:13:08,438 INFO L226 Difference]: Without dead ends: 85 [2024-11-13 16:13:08,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:08,439 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:08,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-13 16:13:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-11-13 16:13:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:13:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-13 16:13:08,457 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 109 [2024-11-13 16:13:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:08,458 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-13 16:13:08,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-13 16:13:08,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:13:08,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:08,463 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:08,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:13:08,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:08,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash -216472427, now seen corresponding path program 1 times [2024-11-13 16:13:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:08,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732216871] [2024-11-13 16:13:08,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:08,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732216871] [2024-11-13 16:13:08,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732216871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:08,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:08,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873925490] [2024-11-13 16:13:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:08,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:08,848 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:08,899 INFO L93 Difference]: Finished difference Result 168 states and 241 transitions. [2024-11-13 16:13:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-13 16:13:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:08,904 INFO L225 Difference]: With dead ends: 168 [2024-11-13 16:13:08,904 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 16:13:08,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:08,909 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:08,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 16:13:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-13 16:13:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 16:13:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-13 16:13:08,922 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 109 [2024-11-13 16:13:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:08,923 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-13 16:13:08,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:08,923 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-13 16:13:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 16:13:08,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:08,928 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:08,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 16:13:08,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:08,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -214625385, now seen corresponding path program 1 times [2024-11-13 16:13:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342989325] [2024-11-13 16:13:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:09,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:09,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342989325] [2024-11-13 16:13:09,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342989325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:09,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:09,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099747039] [2024-11-13 16:13:09,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:09,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:09,992 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:10,355 INFO L93 Difference]: Finished difference Result 252 states and 360 transitions. [2024-11-13 16:13:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:10,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-11-13 16:13:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:10,358 INFO L225 Difference]: With dead ends: 252 [2024-11-13 16:13:10,361 INFO L226 Difference]: Without dead ends: 169 [2024-11-13 16:13:10,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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 16:13:10,363 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 77 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:10,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 276 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:13:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-13 16:13:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-13 16:13:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-13 16:13:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 229 transitions. [2024-11-13 16:13:10,403 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 229 transitions. Word has length 109 [2024-11-13 16:13:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:10,403 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 229 transitions. [2024-11-13 16:13:10,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2024-11-13 16:13:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 16:13:10,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:10,405 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:10,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:13:10,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:10,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1835131079, now seen corresponding path program 1 times [2024-11-13 16:13:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:10,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399273604] [2024-11-13 16:13:10,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:10,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:13,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:14,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399273604] [2024-11-13 16:13:14,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399273604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:14,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:13:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997173198] [2024-11-13 16:13:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:14,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:13:14,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:13:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:14,010 INFO L87 Difference]: Start difference. First operand 161 states and 229 transitions. Second operand has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-13 16:13:17,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:17,326 INFO L93 Difference]: Finished difference Result 553 states and 785 transitions. [2024-11-13 16:13:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:13:17,328 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 110 [2024-11-13 16:13:17,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:17,331 INFO L225 Difference]: With dead ends: 553 [2024-11-13 16:13:17,331 INFO L226 Difference]: Without dead ends: 395 [2024-11-13 16:13:17,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2024-11-13 16:13:17,333 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 415 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:17,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 895 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-13 16:13:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-13 16:13:17,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 297. [2024-11-13 16:13:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 240 states have (on average 1.325) internal successors, (318), 242 states have internal predecessors, (318), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-13 16:13:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 422 transitions. [2024-11-13 16:13:17,398 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 422 transitions. Word has length 110 [2024-11-13 16:13:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:17,399 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 422 transitions. [2024-11-13 16:13:17,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 5.375) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-13 16:13:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 422 transitions. [2024-11-13 16:13:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 16:13:17,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:17,401 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:17,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:13:17,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1873030203, now seen corresponding path program 1 times [2024-11-13 16:13:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:17,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195450909] [2024-11-13 16:13:17,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195450909] [2024-11-13 16:13:18,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195450909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:18,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:18,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581105120] [2024-11-13 16:13:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:18,012 INFO L87 Difference]: Start difference. First operand 297 states and 422 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:18,612 INFO L93 Difference]: Finished difference Result 649 states and 905 transitions. [2024-11-13 16:13:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:13:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-11-13 16:13:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:18,621 INFO L225 Difference]: With dead ends: 649 [2024-11-13 16:13:18,621 INFO L226 Difference]: Without dead ends: 498 [2024-11-13 16:13:18,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:18,623 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 220 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:18,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 312 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:13:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2024-11-13 16:13:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 360. [2024-11-13 16:13:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 284 states have (on average 1.2992957746478873) internal successors, (369), 287 states have internal predecessors, (369), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-13 16:13:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 501 transitions. [2024-11-13 16:13:18,728 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 501 transitions. Word has length 110 [2024-11-13 16:13:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:18,728 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 501 transitions. [2024-11-13 16:13:18,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 501 transitions. [2024-11-13 16:13:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 16:13:18,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:18,731 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:18,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:13:18,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:18,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:18,732 INFO L85 PathProgramCache]: Analyzing trace with hash 871488315, now seen corresponding path program 1 times [2024-11-13 16:13:18,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:18,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345988613] [2024-11-13 16:13:18,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:19,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345988613] [2024-11-13 16:13:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345988613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:19,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:13:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673377163] [2024-11-13 16:13:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:13:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:13:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:13:19,233 INFO L87 Difference]: Start difference. First operand 360 states and 501 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:19,699 INFO L93 Difference]: Finished difference Result 603 states and 834 transitions. [2024-11-13 16:13:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:19,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-11-13 16:13:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:19,710 INFO L225 Difference]: With dead ends: 603 [2024-11-13 16:13:19,710 INFO L226 Difference]: Without dead ends: 430 [2024-11-13 16:13:19,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:19,711 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 189 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:19,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 437 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:13:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-13 16:13:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 426. [2024-11-13 16:13:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 333 states have (on average 1.2822822822822824) internal successors, (427), 337 states have internal predecessors, (427), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 16:13:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 587 transitions. [2024-11-13 16:13:19,834 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 587 transitions. Word has length 110 [2024-11-13 16:13:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:19,834 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 587 transitions. [2024-11-13 16:13:19,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 587 transitions. [2024-11-13 16:13:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 16:13:19,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:19,836 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:19,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:13:19,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:19,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:19,837 INFO L85 PathProgramCache]: Analyzing trace with hash 449212065, now seen corresponding path program 1 times [2024-11-13 16:13:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742350775] [2024-11-13 16:13:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742350775] [2024-11-13 16:13:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742350775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:20,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167980784] [2024-11-13 16:13:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:20,358 INFO L87 Difference]: Start difference. First operand 426 states and 587 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:20,634 INFO L93 Difference]: Finished difference Result 822 states and 1133 transitions. [2024-11-13 16:13:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-13 16:13:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:20,638 INFO L225 Difference]: With dead ends: 822 [2024-11-13 16:13:20,638 INFO L226 Difference]: Without dead ends: 432 [2024-11-13 16:13:20,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 16:13:20,640 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:20,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 269 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-13 16:13:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2024-11-13 16:13:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 331 states have (on average 1.2749244712990937) internal successors, (422), 335 states have internal predecessors, (422), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 16:13:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 582 transitions. [2024-11-13 16:13:20,753 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 582 transitions. Word has length 111 [2024-11-13 16:13:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:20,754 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 582 transitions. [2024-11-13 16:13:20,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 582 transitions. [2024-11-13 16:13:20,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 16:13:20,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:20,755 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:13:20,756 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:20,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:20,756 INFO L85 PathProgramCache]: Analyzing trace with hash -652925663, now seen corresponding path program 1 times [2024-11-13 16:13:20,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:20,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585420760] [2024-11-13 16:13:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585420760] [2024-11-13 16:13:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585420760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258332442] [2024-11-13 16:13:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:21,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:21,305 INFO L87 Difference]: Start difference. First operand 424 states and 582 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:21,631 INFO L93 Difference]: Finished difference Result 754 states and 1033 transitions. [2024-11-13 16:13:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:21,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-13 16:13:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:21,635 INFO L225 Difference]: With dead ends: 754 [2024-11-13 16:13:21,635 INFO L226 Difference]: Without dead ends: 366 [2024-11-13 16:13:21,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 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 16:13:21,641 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 76 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:21,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 274 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-13 16:13:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2024-11-13 16:13:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 281 states have internal predecessors, (352), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 16:13:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 488 transitions. [2024-11-13 16:13:21,765 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 488 transitions. Word has length 111 [2024-11-13 16:13:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 488 transitions. [2024-11-13 16:13:21,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 488 transitions. [2024-11-13 16:13:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:13:21,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:21,769 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:21,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:13:21,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:21,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1296373628, now seen corresponding path program 1 times [2024-11-13 16:13:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407237039] [2024-11-13 16:13:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:21,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:21,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407237039] [2024-11-13 16:13:21,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407237039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:21,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:21,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:13:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073311582] [2024-11-13 16:13:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:13:21,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:21,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:13:21,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:13:21,904 INFO L87 Difference]: Start difference. First operand 358 states and 488 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:22,024 INFO L93 Difference]: Finished difference Result 684 states and 935 transitions. [2024-11-13 16:13:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:13:22,025 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-13 16:13:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:22,027 INFO L225 Difference]: With dead ends: 684 [2024-11-13 16:13:22,027 INFO L226 Difference]: Without dead ends: 362 [2024-11-13 16:13:22,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 16:13:22,031 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:22,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-13 16:13:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-13 16:13:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 282 states have (on average 1.2624113475177305) internal successors, (356), 285 states have internal predecessors, (356), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 16:13:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 492 transitions. [2024-11-13 16:13:22,137 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 492 transitions. Word has length 113 [2024-11-13 16:13:22,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:22,137 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 492 transitions. [2024-11-13 16:13:22,138 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:22,138 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 492 transitions. [2024-11-13 16:13:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:13:22,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:22,143 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:22,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:13:22,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:22,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:22,143 INFO L85 PathProgramCache]: Analyzing trace with hash 709567614, now seen corresponding path program 1 times [2024-11-13 16:13:22,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:22,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163249680] [2024-11-13 16:13:22,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:22,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:22,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163249680] [2024-11-13 16:13:22,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163249680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:22,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:22,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 16:13:22,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377981994] [2024-11-13 16:13:22,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:22,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:13:22,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:22,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:13:22,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:13:22,349 INFO L87 Difference]: Start difference. First operand 362 states and 492 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:22,451 INFO L93 Difference]: Finished difference Result 700 states and 951 transitions. [2024-11-13 16:13:22,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:13:22,452 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-13 16:13:22,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:22,454 INFO L225 Difference]: With dead ends: 700 [2024-11-13 16:13:22,454 INFO L226 Difference]: Without dead ends: 374 [2024-11-13 16:13:22,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:13:22,458 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:22,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-13 16:13:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-13 16:13:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 294 states have (on average 1.251700680272109) internal successors, (368), 297 states have internal predecessors, (368), 68 states have call successors, (68), 11 states have call predecessors, (68), 11 states have return successors, (68), 65 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-13 16:13:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 504 transitions. [2024-11-13 16:13:22,558 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 504 transitions. Word has length 113 [2024-11-13 16:13:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:22,559 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 504 transitions. [2024-11-13 16:13:22,559 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 504 transitions. [2024-11-13 16:13:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:13:22,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:22,562 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:22,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:13:22,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1523808109, now seen corresponding path program 1 times [2024-11-13 16:13:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050757891] [2024-11-13 16:13:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:24,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:24,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050757891] [2024-11-13 16:13:24,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050757891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:24,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:24,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 16:13:24,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156437214] [2024-11-13 16:13:24,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:24,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 16:13:24,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:24,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 16:13:24,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:13:24,296 INFO L87 Difference]: Start difference. First operand 374 states and 504 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:13:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:27,507 INFO L93 Difference]: Finished difference Result 1110 states and 1508 transitions. [2024-11-13 16:13:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 16:13:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-11-13 16:13:27,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:27,513 INFO L225 Difference]: With dead ends: 1110 [2024-11-13 16:13:27,513 INFO L226 Difference]: Without dead ends: 859 [2024-11-13 16:13:27,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2024-11-13 16:13:27,515 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 600 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:27,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1825 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-13 16:13:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-13 16:13:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 625. [2024-11-13 16:13:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 498 states have (on average 1.2650602409638554) internal successors, (630), 503 states have internal predecessors, (630), 108 states have call successors, (108), 18 states have call predecessors, (108), 18 states have return successors, (108), 103 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-13 16:13:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 846 transitions. [2024-11-13 16:13:27,667 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 846 transitions. Word has length 113 [2024-11-13 16:13:27,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:27,668 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 846 transitions. [2024-11-13 16:13:27,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:13:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 846 transitions. [2024-11-13 16:13:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:13:27,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:27,670 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:27,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 16:13:27,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 522266221, now seen corresponding path program 1 times [2024-11-13 16:13:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603025753] [2024-11-13 16:13:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603025753] [2024-11-13 16:13:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603025753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:28,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:28,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:13:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655045514] [2024-11-13 16:13:28,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:28,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:13:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:28,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:13:28,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:28,164 INFO L87 Difference]: Start difference. First operand 625 states and 846 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:28,945 INFO L93 Difference]: Finished difference Result 1057 states and 1427 transitions. [2024-11-13 16:13:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:13:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-13 16:13:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:28,950 INFO L225 Difference]: With dead ends: 1057 [2024-11-13 16:13:28,951 INFO L226 Difference]: Without dead ends: 647 [2024-11-13 16:13:28,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:13:28,953 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 230 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:28,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 427 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:13:28,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-13 16:13:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 481. [2024-11-13 16:13:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 382 states have (on average 1.2617801047120418) internal successors, (482), 385 states have internal predecessors, (482), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 16:13:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 650 transitions. [2024-11-13 16:13:29,052 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 650 transitions. Word has length 113 [2024-11-13 16:13:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:29,052 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 650 transitions. [2024-11-13 16:13:29,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 650 transitions. [2024-11-13 16:13:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:13:29,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:29,054 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:29,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 16:13:29,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:29,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash -64539793, now seen corresponding path program 1 times [2024-11-13 16:13:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:29,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264434465] [2024-11-13 16:13:29,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:29,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:29,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264434465] [2024-11-13 16:13:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264434465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:29,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:29,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:13:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16968559] [2024-11-13 16:13:29,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:29,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:13:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:29,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:13:29,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:29,815 INFO L87 Difference]: Start difference. First operand 481 states and 650 transitions. Second operand has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:13:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:30,234 INFO L93 Difference]: Finished difference Result 841 states and 1131 transitions. [2024-11-13 16:13:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:13:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-11-13 16:13:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:30,242 INFO L225 Difference]: With dead ends: 841 [2024-11-13 16:13:30,242 INFO L226 Difference]: Without dead ends: 491 [2024-11-13 16:13:30,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:30,245 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 81 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:30,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 950 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:13:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-13 16:13:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 489. [2024-11-13 16:13:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 388 states have (on average 1.2525773195876289) internal successors, (486), 391 states have internal predecessors, (486), 84 states have call successors, (84), 16 states have call predecessors, (84), 16 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 16:13:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 654 transitions. [2024-11-13 16:13:30,340 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 654 transitions. Word has length 113 [2024-11-13 16:13:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:30,341 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 654 transitions. [2024-11-13 16:13:30,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.2) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:13:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 654 transitions. [2024-11-13 16:13:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 16:13:30,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:30,343 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:30,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 16:13:30,343 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:30,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:30,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1101106283, now seen corresponding path program 1 times [2024-11-13 16:13:30,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:30,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955349519] [2024-11-13 16:13:30,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:30,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:31,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:31,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955349519] [2024-11-13 16:13:31,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955349519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:31,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:31,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 16:13:31,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263220811] [2024-11-13 16:13:31,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:31,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 16:13:31,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 16:13:31,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:31,545 INFO L87 Difference]: Start difference. First operand 489 states and 654 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:33,647 INFO L93 Difference]: Finished difference Result 1015 states and 1343 transitions. [2024-11-13 16:13:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:13:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-13 16:13:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:33,653 INFO L225 Difference]: With dead ends: 1015 [2024-11-13 16:13:33,653 INFO L226 Difference]: Without dead ends: 828 [2024-11-13 16:13:33,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-11-13 16:13:33,655 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 567 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:33,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 782 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 16:13:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-11-13 16:13:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 645. [2024-11-13 16:13:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 516 states have (on average 1.255813953488372) internal successors, (648), 521 states have internal predecessors, (648), 106 states have call successors, (106), 22 states have call predecessors, (106), 22 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 860 transitions. [2024-11-13 16:13:33,818 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 860 transitions. Word has length 113 [2024-11-13 16:13:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:33,818 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 860 transitions. [2024-11-13 16:13:33,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 860 transitions. [2024-11-13 16:13:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:33,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:33,822 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:33,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 16:13:33,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:33,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash 557111201, now seen corresponding path program 1 times [2024-11-13 16:13:33,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:33,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920414346] [2024-11-13 16:13:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:33,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:34,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920414346] [2024-11-13 16:13:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920414346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:34,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:34,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:13:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457022489] [2024-11-13 16:13:34,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:34,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:13:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:13:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:13:34,326 INFO L87 Difference]: Start difference. First operand 645 states and 860 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:34,721 INFO L93 Difference]: Finished difference Result 1045 states and 1389 transitions. [2024-11-13 16:13:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:13:34,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-13 16:13:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:34,727 INFO L225 Difference]: With dead ends: 1045 [2024-11-13 16:13:34,727 INFO L226 Difference]: Without dead ends: 706 [2024-11-13 16:13:34,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:34,729 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:34,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 592 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-13 16:13:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 659. [2024-11-13 16:13:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 529 states have (on average 1.2551984877126654) internal successors, (664), 534 states have internal predecessors, (664), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 876 transitions. [2024-11-13 16:13:34,870 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 876 transitions. Word has length 115 [2024-11-13 16:13:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:34,871 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 876 transitions. [2024-11-13 16:13:34,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 876 transitions. [2024-11-13 16:13:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:34,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:34,873 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:34,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 16:13:34,874 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:34,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash -126522699, now seen corresponding path program 1 times [2024-11-13 16:13:34,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:34,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919295503] [2024-11-13 16:13:34,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:35,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:35,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919295503] [2024-11-13 16:13:35,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919295503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:35,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:13:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700784756] [2024-11-13 16:13:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:35,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:13:35,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:13:35,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:13:35,646 INFO L87 Difference]: Start difference. First operand 659 states and 876 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:13:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:36,176 INFO L93 Difference]: Finished difference Result 1304 states and 1746 transitions. [2024-11-13 16:13:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:13:36,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-13 16:13:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:36,183 INFO L225 Difference]: With dead ends: 1304 [2024-11-13 16:13:36,184 INFO L226 Difference]: Without dead ends: 784 [2024-11-13 16:13:36,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:13:36,186 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 58 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:36,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 511 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:13:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-13 16:13:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 686. [2024-11-13 16:13:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 556 states have (on average 1.2661870503597121) internal successors, (704), 561 states have internal predecessors, (704), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 916 transitions. [2024-11-13 16:13:36,388 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 916 transitions. Word has length 115 [2024-11-13 16:13:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:36,388 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 916 transitions. [2024-11-13 16:13:36,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:13:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 916 transitions. [2024-11-13 16:13:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 16:13:36,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:36,391 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:36,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 16:13:36,392 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1621385333, now seen corresponding path program 1 times [2024-11-13 16:13:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723565670] [2024-11-13 16:13:36,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:37,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:37,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723565670] [2024-11-13 16:13:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723565670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:37,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:13:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724772465] [2024-11-13 16:13:37,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:37,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:13:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:37,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:13:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:37,256 INFO L87 Difference]: Start difference. First operand 686 states and 916 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:38,118 INFO L93 Difference]: Finished difference Result 1221 states and 1629 transitions. [2024-11-13 16:13:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:13:38,119 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-13 16:13:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:38,124 INFO L225 Difference]: With dead ends: 1221 [2024-11-13 16:13:38,124 INFO L226 Difference]: Without dead ends: 682 [2024-11-13 16:13:38,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:13:38,126 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 386 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:38,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 370 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:13:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-13 16:13:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 674. [2024-11-13 16:13:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 544 states have (on average 1.2536764705882353) internal successors, (682), 549 states have internal predecessors, (682), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 894 transitions. [2024-11-13 16:13:38,290 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 894 transitions. Word has length 115 [2024-11-13 16:13:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:38,291 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 894 transitions. [2024-11-13 16:13:38,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 894 transitions. [2024-11-13 16:13:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:13:38,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:38,293 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:38,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 16:13:38,294 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:38,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1765418235, now seen corresponding path program 1 times [2024-11-13 16:13:38,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:38,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870234507] [2024-11-13 16:13:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:38,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:38,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870234507] [2024-11-13 16:13:38,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870234507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:38,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:38,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243942877] [2024-11-13 16:13:38,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:38,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:38,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:38,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:38,586 INFO L87 Difference]: Start difference. First operand 674 states and 894 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:38,776 INFO L93 Difference]: Finished difference Result 1399 states and 1860 transitions. [2024-11-13 16:13:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:38,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-13 16:13:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:38,781 INFO L225 Difference]: With dead ends: 1399 [2024-11-13 16:13:38,781 INFO L226 Difference]: Without dead ends: 769 [2024-11-13 16:13:38,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:38,784 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 53 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:38,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 585 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-13 16:13:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 674. [2024-11-13 16:13:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 544 states have (on average 1.244485294117647) internal successors, (677), 549 states have internal predecessors, (677), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 889 transitions. [2024-11-13 16:13:38,921 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 889 transitions. Word has length 116 [2024-11-13 16:13:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:38,921 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 889 transitions. [2024-11-13 16:13:38,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 889 transitions. [2024-11-13 16:13:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:13:38,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:38,923 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:38,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 16:13:38,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:38,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2106847235, now seen corresponding path program 1 times [2024-11-13 16:13:38,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:38,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268909910] [2024-11-13 16:13:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:38,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:39,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:39,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268909910] [2024-11-13 16:13:39,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268909910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:39,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:39,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130709203] [2024-11-13 16:13:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:39,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:39,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:39,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:39,296 INFO L87 Difference]: Start difference. First operand 674 states and 889 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:39,658 INFO L93 Difference]: Finished difference Result 1391 states and 1842 transitions. [2024-11-13 16:13:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-13 16:13:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:39,664 INFO L225 Difference]: With dead ends: 1391 [2024-11-13 16:13:39,664 INFO L226 Difference]: Without dead ends: 761 [2024-11-13 16:13:39,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:39,666 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 43 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:39,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 450 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-13 16:13:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 672. [2024-11-13 16:13:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 542 states have (on average 1.2361623616236161) internal successors, (670), 547 states have internal predecessors, (670), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 882 transitions. [2024-11-13 16:13:39,814 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 882 transitions. Word has length 116 [2024-11-13 16:13:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:39,815 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 882 transitions. [2024-11-13 16:13:39,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 882 transitions. [2024-11-13 16:13:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:13:39,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:39,817 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:39,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 16:13:39,817 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:39,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 908256383, now seen corresponding path program 1 times [2024-11-13 16:13:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710602468] [2024-11-13 16:13:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710602468] [2024-11-13 16:13:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710602468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:40,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:40,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:40,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278623588] [2024-11-13 16:13:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:40,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:40,144 INFO L87 Difference]: Start difference. First operand 672 states and 882 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:40,347 INFO L93 Difference]: Finished difference Result 1332 states and 1748 transitions. [2024-11-13 16:13:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:40,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2024-11-13 16:13:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:40,352 INFO L225 Difference]: With dead ends: 1332 [2024-11-13 16:13:40,352 INFO L226 Difference]: Without dead ends: 704 [2024-11-13 16:13:40,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:40,355 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 64 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:40,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 440 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-13 16:13:40,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 648. [2024-11-13 16:13:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 518 states have (on average 1.218146718146718) internal successors, (631), 523 states have internal predecessors, (631), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 843 transitions. [2024-11-13 16:13:40,500 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 843 transitions. Word has length 116 [2024-11-13 16:13:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:40,501 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 843 transitions. [2024-11-13 16:13:40,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 843 transitions. [2024-11-13 16:13:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 16:13:40,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:40,503 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 16:13:40,503 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1504486161, now seen corresponding path program 1 times [2024-11-13 16:13:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141851528] [2024-11-13 16:13:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:40,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141851528] [2024-11-13 16:13:40,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141851528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:40,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:40,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971183119] [2024-11-13 16:13:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:40,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:40,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:40,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:40,973 INFO L87 Difference]: Start difference. First operand 648 states and 843 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:41,266 INFO L93 Difference]: Finished difference Result 1258 states and 1638 transitions. [2024-11-13 16:13:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:41,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-13 16:13:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:41,271 INFO L225 Difference]: With dead ends: 1258 [2024-11-13 16:13:41,271 INFO L226 Difference]: Without dead ends: 654 [2024-11-13 16:13:41,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 16:13:41,274 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:41,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 277 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-13 16:13:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 648. [2024-11-13 16:13:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 518 states have (on average 1.2162162162162162) internal successors, (630), 523 states have internal predecessors, (630), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 842 transitions. [2024-11-13 16:13:41,406 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 842 transitions. Word has length 116 [2024-11-13 16:13:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 842 transitions. [2024-11-13 16:13:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 842 transitions. [2024-11-13 16:13:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:13:41,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:41,408 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:41,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 16:13:41,408 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:41,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash -608247528, now seen corresponding path program 1 times [2024-11-13 16:13:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:41,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469399467] [2024-11-13 16:13:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:42,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:42,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469399467] [2024-11-13 16:13:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469399467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:13:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32933805] [2024-11-13 16:13:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:42,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:13:42,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:42,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:13:42,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:42,717 INFO L87 Difference]: Start difference. First operand 648 states and 842 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:43,553 INFO L93 Difference]: Finished difference Result 717 states and 927 transitions. [2024-11-13 16:13:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:13:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-13 16:13:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:43,557 INFO L225 Difference]: With dead ends: 717 [2024-11-13 16:13:43,557 INFO L226 Difference]: Without dead ends: 715 [2024-11-13 16:13:43,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:13:43,558 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:43,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 657 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:13:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-13 16:13:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 669. [2024-11-13 16:13:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 539 states have (on average 1.2077922077922079) internal successors, (651), 544 states have internal predecessors, (651), 106 states have call successors, (106), 23 states have call predecessors, (106), 23 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 863 transitions. [2024-11-13 16:13:43,692 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 863 transitions. Word has length 117 [2024-11-13 16:13:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:43,693 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 863 transitions. [2024-11-13 16:13:43,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 863 transitions. [2024-11-13 16:13:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:13:43,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:43,696 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:43,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 16:13:43,696 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash -606400486, now seen corresponding path program 1 times [2024-11-13 16:13:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223335384] [2024-11-13 16:13:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:44,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:44,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223335384] [2024-11-13 16:13:44,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223335384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:44,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:44,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144666806] [2024-11-13 16:13:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:44,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:44,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:44,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:44,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:44,258 INFO L87 Difference]: Start difference. First operand 669 states and 863 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:44,659 INFO L93 Difference]: Finished difference Result 1322 states and 1692 transitions. [2024-11-13 16:13:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:44,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-13 16:13:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:44,664 INFO L225 Difference]: With dead ends: 1322 [2024-11-13 16:13:44,664 INFO L226 Difference]: Without dead ends: 697 [2024-11-13 16:13:44,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:13:44,666 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 71 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:44,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 431 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 16:13:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-11-13 16:13:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2024-11-13 16:13:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 560 states have (on average 1.1875) internal successors, (665), 565 states have internal predecessors, (665), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 877 transitions. [2024-11-13 16:13:44,819 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 877 transitions. Word has length 117 [2024-11-13 16:13:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:44,819 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 877 transitions. [2024-11-13 16:13:44,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 877 transitions. [2024-11-13 16:13:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 16:13:44,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:44,822 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:44,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 16:13:44,822 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:44,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1168606876, now seen corresponding path program 1 times [2024-11-13 16:13:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972983965] [2024-11-13 16:13:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-13 16:13:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972983965] [2024-11-13 16:13:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972983965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:13:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056406753] [2024-11-13 16:13:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:45,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:13:45,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:13:45,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:13:45,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:13:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:45,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 16:13:45,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:13:45,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:13:45,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2024-11-13 16:13:45,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2024-11-13 16:13:45,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-13 16:13:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:46,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:13:46,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056406753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:46,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:13:46,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-13 16:13:46,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345220661] [2024-11-13 16:13:46,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:46,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:13:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:46,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:13:46,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:13:46,029 INFO L87 Difference]: Start difference. First operand 697 states and 877 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:46,555 INFO L93 Difference]: Finished difference Result 1172 states and 1477 transitions. [2024-11-13 16:13:46,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:13:46,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-13 16:13:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:46,564 INFO L225 Difference]: With dead ends: 1172 [2024-11-13 16:13:46,565 INFO L226 Difference]: Without dead ends: 787 [2024-11-13 16:13:46,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:13:46,567 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 201 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:46,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 756 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:13:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-13 16:13:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 726. [2024-11-13 16:13:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 589 states have (on average 1.1901528013582343) internal successors, (701), 594 states have internal predecessors, (701), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 913 transitions. [2024-11-13 16:13:46,805 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 913 transitions. Word has length 117 [2024-11-13 16:13:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:46,805 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 913 transitions. [2024-11-13 16:13:46,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 913 transitions. [2024-11-13 16:13:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:46,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:46,808 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:46,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-13 16:13:47,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a12fbfef-a883-432d-b6ed-4d493da6db80/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 16:13:47,009 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:47,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2076225127, now seen corresponding path program 1 times [2024-11-13 16:13:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603067267] [2024-11-13 16:13:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:47,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603067267] [2024-11-13 16:13:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603067267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:47,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:47,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:13:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185685462] [2024-11-13 16:13:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:47,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:13:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:13:47,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:13:47,932 INFO L87 Difference]: Start difference. First operand 726 states and 913 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:48,665 INFO L93 Difference]: Finished difference Result 1221 states and 1538 transitions. [2024-11-13 16:13:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 16:13:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-13 16:13:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:48,671 INFO L225 Difference]: With dead ends: 1221 [2024-11-13 16:13:48,671 INFO L226 Difference]: Without dead ends: 807 [2024-11-13 16:13:48,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:48,673 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 117 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:48,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 683 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:13:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-13 16:13:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 727. [2024-11-13 16:13:48,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 590 states have (on average 1.188135593220339) internal successors, (701), 595 states have internal predecessors, (701), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 913 transitions. [2024-11-13 16:13:48,835 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 913 transitions. Word has length 118 [2024-11-13 16:13:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:48,836 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 913 transitions. [2024-11-13 16:13:48,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 913 transitions. [2024-11-13 16:13:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:48,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:48,838 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:48,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 16:13:48,839 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 796361449, now seen corresponding path program 1 times [2024-11-13 16:13:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266872451] [2024-11-13 16:13:48,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:49,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:49,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266872451] [2024-11-13 16:13:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266872451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:49,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:49,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:13:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786468870] [2024-11-13 16:13:49,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:49,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:13:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:13:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:49,413 INFO L87 Difference]: Start difference. First operand 727 states and 913 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:50,339 INFO L93 Difference]: Finished difference Result 1666 states and 2096 transitions. [2024-11-13 16:13:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:13:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-13 16:13:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:50,344 INFO L225 Difference]: With dead ends: 1666 [2024-11-13 16:13:50,345 INFO L226 Difference]: Without dead ends: 1083 [2024-11-13 16:13:50,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:13:50,347 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 215 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:50,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 602 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:13:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-13 16:13:50,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 784. [2024-11-13 16:13:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 647 states have (on average 1.1978361669242659) internal successors, (775), 652 states have internal predecessors, (775), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 987 transitions. [2024-11-13 16:13:50,515 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 987 transitions. Word has length 118 [2024-11-13 16:13:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:50,515 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 987 transitions. [2024-11-13 16:13:50,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 987 transitions. [2024-11-13 16:13:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:50,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:50,517 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:50,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 16:13:50,517 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1197783257, now seen corresponding path program 1 times [2024-11-13 16:13:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122736354] [2024-11-13 16:13:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122736354] [2024-11-13 16:13:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122736354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:51,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:13:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767718748] [2024-11-13 16:13:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:51,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:13:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:13:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:51,135 INFO L87 Difference]: Start difference. First operand 784 states and 987 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:52,000 INFO L93 Difference]: Finished difference Result 1374 states and 1731 transitions. [2024-11-13 16:13:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:13:52,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-13 16:13:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:52,005 INFO L225 Difference]: With dead ends: 1374 [2024-11-13 16:13:52,005 INFO L226 Difference]: Without dead ends: 959 [2024-11-13 16:13:52,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-13 16:13:52,007 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 225 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:52,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 667 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:13:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-13 16:13:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 784. [2024-11-13 16:13:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 647 states have (on average 1.1947449768160743) internal successors, (773), 652 states have internal predecessors, (773), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 985 transitions. [2024-11-13 16:13:52,164 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 985 transitions. Word has length 118 [2024-11-13 16:13:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:52,164 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 985 transitions. [2024-11-13 16:13:52,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 985 transitions. [2024-11-13 16:13:52,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:52,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:52,166 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:52,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 16:13:52,166 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1034029781, now seen corresponding path program 1 times [2024-11-13 16:13:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861826506] [2024-11-13 16:13:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:52,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:52,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861826506] [2024-11-13 16:13:52,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861826506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:52,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:52,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 16:13:52,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370596057] [2024-11-13 16:13:52,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:52,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 16:13:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:52,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 16:13:52,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:13:52,722 INFO L87 Difference]: Start difference. First operand 784 states and 985 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:53,523 INFO L93 Difference]: Finished difference Result 1537 states and 1927 transitions. [2024-11-13 16:13:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 16:13:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-13 16:13:53,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:53,527 INFO L225 Difference]: With dead ends: 1537 [2024-11-13 16:13:53,527 INFO L226 Difference]: Without dead ends: 951 [2024-11-13 16:13:53,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:13:53,531 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 277 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:53,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 588 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:13:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-13 16:13:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 776. [2024-11-13 16:13:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 639 states have (on average 1.1909233176838812) internal successors, (761), 644 states have internal predecessors, (761), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:53,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 973 transitions. [2024-11-13 16:13:53,694 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 973 transitions. Word has length 118 [2024-11-13 16:13:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:53,694 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 973 transitions. [2024-11-13 16:13:53,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:13:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 973 transitions. [2024-11-13 16:13:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-13 16:13:53,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:53,696 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:53,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 16:13:53,696 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:53,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:53,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1981073837, now seen corresponding path program 1 times [2024-11-13 16:13:53,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:53,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52562904] [2024-11-13 16:13:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:53,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52562904] [2024-11-13 16:13:54,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52562904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:54,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:54,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:13:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249435289] [2024-11-13 16:13:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:54,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:13:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:13:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:54,168 INFO L87 Difference]: Start difference. First operand 776 states and 973 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:54,766 INFO L93 Difference]: Finished difference Result 1529 states and 1915 transitions. [2024-11-13 16:13:54,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:13:54,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-13 16:13:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:54,771 INFO L225 Difference]: With dead ends: 1529 [2024-11-13 16:13:54,771 INFO L226 Difference]: Without dead ends: 951 [2024-11-13 16:13:54,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:54,773 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 280 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:54,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 429 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:13:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-13 16:13:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 782. [2024-11-13 16:13:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 645 states have (on average 1.1875968992248063) internal successors, (766), 650 states have internal predecessors, (766), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 978 transitions. [2024-11-13 16:13:55,015 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 978 transitions. Word has length 118 [2024-11-13 16:13:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:55,016 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 978 transitions. [2024-11-13 16:13:55,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 978 transitions. [2024-11-13 16:13:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:55,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:55,017 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:55,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 16:13:55,018 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:55,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1341321354, now seen corresponding path program 1 times [2024-11-13 16:13:55,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:55,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143496009] [2024-11-13 16:13:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143496009] [2024-11-13 16:13:55,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143496009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:55,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:55,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:13:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966125155] [2024-11-13 16:13:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:13:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:55,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:13:55,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:13:55,898 INFO L87 Difference]: Start difference. First operand 782 states and 978 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:56,480 INFO L93 Difference]: Finished difference Result 1619 states and 2021 transitions. [2024-11-13 16:13:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:13:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-13 16:13:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:56,486 INFO L225 Difference]: With dead ends: 1619 [2024-11-13 16:13:56,486 INFO L226 Difference]: Without dead ends: 881 [2024-11-13 16:13:56,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:56,488 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 134 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:56,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 792 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:13:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-13 16:13:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 798. [2024-11-13 16:13:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 661 states have (on average 1.1860816944024206) internal successors, (784), 666 states have internal predecessors, (784), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 996 transitions. [2024-11-13 16:13:56,660 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 996 transitions. Word has length 119 [2024-11-13 16:13:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:56,661 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 996 transitions. [2024-11-13 16:13:56,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 996 transitions. [2024-11-13 16:13:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:56,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:56,663 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:56,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 16:13:56,663 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:56,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2042385932, now seen corresponding path program 1 times [2024-11-13 16:13:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:56,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168305043] [2024-11-13 16:13:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:56,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:56,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168305043] [2024-11-13 16:13:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168305043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:56,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:13:56,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797392698] [2024-11-13 16:13:56,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:56,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:13:56,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:56,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:13:56,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:13:56,950 INFO L87 Difference]: Start difference. First operand 798 states and 996 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:57,198 INFO L93 Difference]: Finished difference Result 1841 states and 2297 transitions. [2024-11-13 16:13:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:13:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-13 16:13:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:57,203 INFO L225 Difference]: With dead ends: 1841 [2024-11-13 16:13:57,203 INFO L226 Difference]: Without dead ends: 1087 [2024-11-13 16:13:57,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:13:57,206 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 35 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:57,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 617 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-11-13 16:13:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 966. [2024-11-13 16:13:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 829 states have (on average 1.203860072376357) internal successors, (998), 834 states have internal predecessors, (998), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1210 transitions. [2024-11-13 16:13:57,438 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1210 transitions. Word has length 119 [2024-11-13 16:13:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:57,439 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1210 transitions. [2024-11-13 16:13:57,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1210 transitions. [2024-11-13 16:13:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:57,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:57,442 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:57,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-13 16:13:57,442 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:57,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:57,442 INFO L85 PathProgramCache]: Analyzing trace with hash -464116980, now seen corresponding path program 1 times [2024-11-13 16:13:57,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:57,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630329365] [2024-11-13 16:13:57,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:57,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:57,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630329365] [2024-11-13 16:13:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630329365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:57,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 16:13:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049745023] [2024-11-13 16:13:57,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:57,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 16:13:57,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:57,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:13:57,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:13:57,952 INFO L87 Difference]: Start difference. First operand 966 states and 1210 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:58,379 INFO L93 Difference]: Finished difference Result 1933 states and 2435 transitions. [2024-11-13 16:13:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:13:58,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-13 16:13:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:58,383 INFO L225 Difference]: With dead ends: 1933 [2024-11-13 16:13:58,383 INFO L226 Difference]: Without dead ends: 1011 [2024-11-13 16:13:58,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:13:58,385 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 113 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:58,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 528 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 16:13:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-11-13 16:13:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2024-11-13 16:13:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 874 states have (on average 1.2116704805491991) internal successors, (1059), 878 states have internal predecessors, (1059), 106 states have call successors, (106), 30 states have call predecessors, (106), 30 states have return successors, (106), 102 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:13:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1271 transitions. [2024-11-13 16:13:58,509 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1271 transitions. Word has length 119 [2024-11-13 16:13:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:58,510 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1271 transitions. [2024-11-13 16:13:58,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 16:13:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1271 transitions. [2024-11-13 16:13:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 16:13:58,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:58,511 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:13:58,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 16:13:58,512 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:58,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 110874644, now seen corresponding path program 1 times [2024-11-13 16:13:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671783668] [2024-11-13 16:13:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:13:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:13:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:13:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:13:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:13:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:13:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:13:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:13:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:13:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:13:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:13:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:13:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:13:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:13:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:13:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671783668] [2024-11-13 16:13:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671783668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 16:13:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516833296] [2024-11-13 16:13:59,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:59,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:13:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:13:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:13:59,857 INFO L87 Difference]: Start difference. First operand 1011 states and 1271 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:14:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:01,177 INFO L93 Difference]: Finished difference Result 1931 states and 2416 transitions. [2024-11-13 16:14:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:14:01,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-13 16:14:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:01,185 INFO L225 Difference]: With dead ends: 1931 [2024-11-13 16:14:01,185 INFO L226 Difference]: Without dead ends: 1233 [2024-11-13 16:14:01,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:14:01,187 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 277 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:01,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 591 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 16:14:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2024-11-13 16:14:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1042. [2024-11-13 16:14:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 903 states have (on average 1.196013289036545) internal successors, (1080), 907 states have internal predecessors, (1080), 106 states have call successors, (106), 32 states have call predecessors, (106), 32 states have return successors, (106), 102 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-13 16:14:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1292 transitions. [2024-11-13 16:14:01,382 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1292 transitions. Word has length 119 [2024-11-13 16:14:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:01,382 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1292 transitions. [2024-11-13 16:14:01,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:14:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1292 transitions. [2024-11-13 16:14:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 16:14:01,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:01,384 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:01,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 16:14:01,384 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash -657252061, now seen corresponding path program 1 times [2024-11-13 16:14:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:01,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887248450] [2024-11-13 16:14:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:14:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:14:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:14:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:14:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:14:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:14:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:14:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:14:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:14:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:14:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:14:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:14:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:14:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:14:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:14:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:14:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887248450] [2024-11-13 16:14:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887248450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:01,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:01,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 16:14:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962748725] [2024-11-13 16:14:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:01,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 16:14:01,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:14:01,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:14:01,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:14:01,997 INFO L87 Difference]: Start difference. First operand 1042 states and 1292 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:14:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:02,560 INFO L93 Difference]: Finished difference Result 1671 states and 2076 transitions. [2024-11-13 16:14:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:14:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-11-13 16:14:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:02,566 INFO L225 Difference]: With dead ends: 1671 [2024-11-13 16:14:02,566 INFO L226 Difference]: Without dead ends: 1138 [2024-11-13 16:14:02,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:14:02,567 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:02,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 511 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 16:14:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-11-13 16:14:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 871. [2024-11-13 16:14:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 760 states have (on average 1.188157894736842) internal successors, (903), 762 states have internal predecessors, (903), 84 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 16:14:02,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1071 transitions. [2024-11-13 16:14:02,713 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1071 transitions. Word has length 120 [2024-11-13 16:14:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:02,713 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1071 transitions. [2024-11-13 16:14:02,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:14:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1071 transitions. [2024-11-13 16:14:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:14:02,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:02,714 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:02,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 16:14:02,715 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:02,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1955131611, now seen corresponding path program 1 times [2024-11-13 16:14:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409539814] [2024-11-13 16:14:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:02,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:14:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:14:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:14:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:14:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:14:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:14:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:14:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:14:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:14:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:14:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:14:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:14:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:14:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:14:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:14:03,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:14:03,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409539814] [2024-11-13 16:14:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409539814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:03,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:03,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 16:14:03,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168287120] [2024-11-13 16:14:03,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:03,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:14:03,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:14:03,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:14:03,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:14:03,909 INFO L87 Difference]: Start difference. First operand 871 states and 1071 transitions. Second operand has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:14:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:04,931 INFO L93 Difference]: Finished difference Result 1666 states and 2057 transitions. [2024-11-13 16:14:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:14:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-13 16:14:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:04,936 INFO L225 Difference]: With dead ends: 1666 [2024-11-13 16:14:04,936 INFO L226 Difference]: Without dead ends: 1101 [2024-11-13 16:14:04,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-13 16:14:04,938 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 217 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:04,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 851 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 16:14:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2024-11-13 16:14:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 905. [2024-11-13 16:14:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 794 states have (on average 1.185138539042821) internal successors, (941), 796 states have internal predecessors, (941), 84 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-13 16:14:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1109 transitions. [2024-11-13 16:14:05,087 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1109 transitions. Word has length 121 [2024-11-13 16:14:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:05,088 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1109 transitions. [2024-11-13 16:14:05,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:14:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1109 transitions. [2024-11-13 16:14:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 16:14:05,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:05,090 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:05,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 16:14:05,091 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:05,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 675267933, now seen corresponding path program 1 times [2024-11-13 16:14:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:05,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358374915] [2024-11-13 16:14:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:14:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:14:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:14:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:14:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:14:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:14:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:14:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:14:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:14:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:14:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:14:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:14:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:14:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:14:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:14:06,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:14:06,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358374915] [2024-11-13 16:14:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358374915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:06,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:06,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 16:14:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522331554] [2024-11-13 16:14:06,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 16:14:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:14:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 16:14:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-13 16:14:06,247 INFO L87 Difference]: Start difference. First operand 905 states and 1109 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:14:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:07,061 INFO L93 Difference]: Finished difference Result 1892 states and 2327 transitions. [2024-11-13 16:14:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:14:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-13 16:14:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:07,067 INFO L225 Difference]: With dead ends: 1892 [2024-11-13 16:14:07,068 INFO L226 Difference]: Without dead ends: 1343 [2024-11-13 16:14:07,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:14:07,069 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:07,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1368 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 16:14:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2024-11-13 16:14:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1329. [2024-11-13 16:14:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1200 states have (on average 1.1991666666666667) internal successors, (1439), 1205 states have internal predecessors, (1439), 96 states have call successors, (96), 32 states have call predecessors, (96), 32 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 16:14:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1631 transitions. [2024-11-13 16:14:07,255 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1631 transitions. Word has length 121 [2024-11-13 16:14:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:07,256 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1631 transitions. [2024-11-13 16:14:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-13 16:14:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1631 transitions. [2024-11-13 16:14:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:14:07,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:07,258 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:07,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-13 16:14:07,259 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:07,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 616875179, now seen corresponding path program 1 times [2024-11-13 16:14:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055043819] [2024-11-13 16:14:07,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:14:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 16:14:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 16:14:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 16:14:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 16:14:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 16:14:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 16:14:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-13 16:14:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-13 16:14:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-13 16:14:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:14:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 16:14:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 16:14:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 16:14:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:14:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 16:14:07,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:14:07,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055043819] [2024-11-13 16:14:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055043819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:14:07,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:14:07,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:14:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415565386] [2024-11-13 16:14:07,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:14:07,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:14:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:14:07,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:14:07,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:14:07,588 INFO L87 Difference]: Start difference. First operand 1329 states and 1631 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:14:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:14:07,781 INFO L93 Difference]: Finished difference Result 2449 states and 2990 transitions. [2024-11-13 16:14:07,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:14:07,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 122 [2024-11-13 16:14:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:14:07,786 INFO L225 Difference]: With dead ends: 2449 [2024-11-13 16:14:07,787 INFO L226 Difference]: Without dead ends: 1645 [2024-11-13 16:14:07,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:14:07,788 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 31 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:14:07,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 638 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:14:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-13 16:14:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1515. [2024-11-13 16:14:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1386 states have (on average 1.1955266955266954) internal successors, (1657), 1391 states have internal predecessors, (1657), 96 states have call successors, (96), 32 states have call predecessors, (96), 32 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-13 16:14:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1849 transitions. [2024-11-13 16:14:07,944 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1849 transitions. Word has length 122 [2024-11-13 16:14:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:14:07,945 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1849 transitions. [2024-11-13 16:14:07,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 16:14:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1849 transitions. [2024-11-13 16:14:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 16:14:07,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:14:07,947 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:14:07,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-13 16:14:07,947 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:14:07,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:14:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash 358709741, now seen corresponding path program 1 times [2024-11-13 16:14:07,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:14:07,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163161260] [2024-11-13 16:14:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:14:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:14:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:24,115 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:16:32,293 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:16:40,988 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:16:50,703 WARN L286 SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:16:59,117 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:05,952 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:12,853 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:21,293 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:32,865 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:44,794 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:51,660 WARN L286 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:17:58,685 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:10,272 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:18,087 WARN L286 SmtUtils]: Spent 7.43s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:31,409 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:39,548 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:49,806 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:18:55,264 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:07,385 WARN L286 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:12,891 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:20,798 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:29,099 WARN L286 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:39,157 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:46,379 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:19:54,685 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:03,073 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:10,921 WARN L286 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:19,300 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:24,596 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:33,351 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:38,822 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:48,013 WARN L286 SmtUtils]: Spent 7.38s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:20:56,278 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:02,786 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:12,382 WARN L286 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:20,744 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:29,468 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:37,571 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:45,174 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:21:54,880 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:03,373 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:13,161 WARN L286 SmtUtils]: Spent 9.59s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:33,251 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:40,491 WARN L286 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 13 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:49,609 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:22:55,336 WARN L286 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:01,616 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:14,971 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:23,518 WARN L286 SmtUtils]: Spent 7.56s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:31,682 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:39,880 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:46,349 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:51,878 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:23:59,934 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:08,453 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:17,839 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:26,258 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:32,544 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:38,889 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:47,298 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:52,598 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:24:57,727 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:25:04,338 WARN L286 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:25:13,777 WARN L286 SmtUtils]: Spent 9.43s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:25:25,215 WARN L286 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:25:31,435 WARN L286 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:25:39,154 WARN L286 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:25:47,754 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:25:55,901 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:26:08,757 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:26:22,298 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:26:31,582 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:26:38,298 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:26:45,461 WARN L286 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:26:51,784 WARN L286 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:27:08,511 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:27:16,554 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:27:25,122 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:27:31,192 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 16:27:37,774 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)