./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu --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 64bit --witnessprinter.graph.data.programhash 096bd3f2a021fa47b1c02d78a0aae6264c2c575942ed4c9ecbbbcad808039ae8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:47:00,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:47:00,140 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-19 07:47:00,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:47:00,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:47:00,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:47:00,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:47:00,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:47:00,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:47:00,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:47:00,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:47:00,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:47:00,206 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:47:00,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:47:00,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:47:00,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:47:00,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:47:00,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:47:00,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:47:00,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:47:00,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:47:00,211 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:47:00,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:47:00,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:47:00,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:47:00,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:00,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:47:00,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:47:00,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:47:00,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:47:00,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:47:00,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:47:00,216 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:47:00,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:47:00,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:47:00,217 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:47:00,217 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 096bd3f2a021fa47b1c02d78a0aae6264c2c575942ed4c9ecbbbcad808039ae8 [2023-11-19 07:47:00,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:47:00,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:47:00,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:47:00,521 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:47:00,522 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:47:00,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2023-11-19 07:47:03,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:47:04,056 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:47:04,059 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2023-11-19 07:47:04,085 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/data/8b9a4271f/cf31dd79a98b400887d1450eaefb2203/FLAG2a18e3733 [2023-11-19 07:47:04,098 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/data/8b9a4271f/cf31dd79a98b400887d1450eaefb2203 [2023-11-19 07:47:04,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:47:04,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:47:04,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:04,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:47:04,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:47:04,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:04" (1/1) ... [2023-11-19 07:47:04,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67da23f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:04, skipping insertion in model container [2023-11-19 07:47:04,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:04" (1/1) ... [2023-11-19 07:47:04,194 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:47:04,380 WARN L240 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_e096d5b5-8b67-4054-a59a-acbb9122124c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c[1280,1293] [2023-11-19 07:47:04,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:04,853 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:47:04,866 WARN L240 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_e096d5b5-8b67-4054-a59a-acbb9122124c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c[1280,1293] [2023-11-19 07:47:05,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:05,041 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:47:05,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05 WrapperNode [2023-11-19 07:47:05,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:05,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:05,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:47:05,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:47:05,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,491 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3483 [2023-11-19 07:47:05,492 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:05,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:47:05,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:47:05,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:47:05,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:47:05,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:47:05,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:47:05,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:47:05,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (1/1) ... [2023-11-19 07:47:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:05,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:05,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:47:06,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e096d5b5-8b67-4054-a59a-acbb9122124c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:47:06,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:47:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:47:06,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:47:06,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:47:06,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:47:06,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:47:06,369 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:47:06,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:47:09,239 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:47:09,256 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:47:09,257 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:47:09,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:09 BoogieIcfgContainer [2023-11-19 07:47:09,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:47:09,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:47:09,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:47:09,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:47:09,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:47:04" (1/3) ... [2023-11-19 07:47:09,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e257885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:09, skipping insertion in model container [2023-11-19 07:47:09,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:05" (2/3) ... [2023-11-19 07:47:09,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e257885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:09, skipping insertion in model container [2023-11-19 07:47:09,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:09" (3/3) ... [2023-11-19 07:47:09,277 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d32_e0.c [2023-11-19 07:47:09,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:47:09,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:47:09,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:09,374 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e2c088b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:09,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:47:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 660 states, 654 states have (on average 1.6590214067278288) internal successors, (1085), 655 states have internal predecessors, (1085), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-19 07:47:09,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:09,405 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:09,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:09,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 865587800, now seen corresponding path program 1 times [2023-11-19 07:47:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:09,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913465847] [2023-11-19 07:47:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:10,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:10,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:10,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913465847] [2023-11-19 07:47:10,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913465847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:10,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:10,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:47:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189992573] [2023-11-19 07:47:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:47:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:10,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:47:10,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:47:10,211 INFO L87 Difference]: Start difference. First operand has 660 states, 654 states have (on average 1.6590214067278288) internal successors, (1085), 655 states have internal predecessors, (1085), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:47:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:10,295 INFO L93 Difference]: Finished difference Result 1191 states and 1975 transitions. [2023-11-19 07:47:10,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:47:10,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 213 [2023-11-19 07:47:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:10,321 INFO L225 Difference]: With dead ends: 1191 [2023-11-19 07:47:10,321 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:10,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:47:10,335 INFO L413 NwaCegarLoop]: 1084 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, 1084 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 [2023-11-19 07:47:10,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6559139784946237) internal successors, (1078), 651 states have internal predecessors, (1078), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1084 transitions. [2023-11-19 07:47:10,435 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1084 transitions. Word has length 213 [2023-11-19 07:47:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:10,436 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1084 transitions. [2023-11-19 07:47:10,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:47:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1084 transitions. [2023-11-19 07:47:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-19 07:47:10,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:10,443 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:10,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:47:10,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:10,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1825663378, now seen corresponding path program 1 times [2023-11-19 07:47:10,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:10,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95695122] [2023-11-19 07:47:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:10,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:12,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:12,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:12,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95695122] [2023-11-19 07:47:12,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95695122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:12,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:12,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827730715] [2023-11-19 07:47:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:12,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:12,289 INFO L87 Difference]: Start difference. First operand 656 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:12,710 INFO L93 Difference]: Finished difference Result 1187 states and 1961 transitions. [2023-11-19 07:47:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:12,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 213 [2023-11-19 07:47:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:12,717 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:12,717 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:12,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:12,721 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 896 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:12,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 1910 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6543778801843319) internal successors, (1077), 651 states have internal predecessors, (1077), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1083 transitions. [2023-11-19 07:47:12,773 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1083 transitions. Word has length 213 [2023-11-19 07:47:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:12,776 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1083 transitions. [2023-11-19 07:47:12,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1083 transitions. [2023-11-19 07:47:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-19 07:47:12,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:12,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:12,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:47:12,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:12,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash -771085152, now seen corresponding path program 1 times [2023-11-19 07:47:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:12,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726484691] [2023-11-19 07:47:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:13,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:13,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726484691] [2023-11-19 07:47:13,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726484691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838666924] [2023-11-19 07:47:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:13,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:13,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:13,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:13,701 INFO L87 Difference]: Start difference. First operand 656 states and 1083 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:14,053 INFO L93 Difference]: Finished difference Result 1213 states and 1997 transitions. [2023-11-19 07:47:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:47:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 214 [2023-11-19 07:47:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:14,059 INFO L225 Difference]: With dead ends: 1213 [2023-11-19 07:47:14,059 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:14,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:14,062 INFO L413 NwaCegarLoop]: 1065 mSDtfsCounter, 948 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:14,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 3088 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.65284178187404) internal successors, (1076), 651 states have internal predecessors, (1076), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1082 transitions. [2023-11-19 07:47:14,086 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1082 transitions. Word has length 214 [2023-11-19 07:47:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:14,087 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1082 transitions. [2023-11-19 07:47:14,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1082 transitions. [2023-11-19 07:47:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-11-19 07:47:14,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:14,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:14,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:47:14,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:14,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1233722716, now seen corresponding path program 1 times [2023-11-19 07:47:14,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:14,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029152459] [2023-11-19 07:47:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:14,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:14,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:14,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:14,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:14,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029152459] [2023-11-19 07:47:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029152459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:14,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:14,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322977304] [2023-11-19 07:47:14,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:14,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:14,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:14,988 INFO L87 Difference]: Start difference. First operand 656 states and 1082 transitions. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:15,349 INFO L93 Difference]: Finished difference Result 1187 states and 1957 transitions. [2023-11-19 07:47:15,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:15,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 215 [2023-11-19 07:47:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:15,355 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:15,355 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:15,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:15,367 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1985 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:15,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 1910 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.651305683563748) internal successors, (1075), 651 states have internal predecessors, (1075), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1081 transitions. [2023-11-19 07:47:15,390 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1081 transitions. Word has length 215 [2023-11-19 07:47:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:15,390 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1081 transitions. [2023-11-19 07:47:15,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:15,391 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1081 transitions. [2023-11-19 07:47:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-11-19 07:47:15,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:15,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:15,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:47:15,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:15,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1390982662, now seen corresponding path program 1 times [2023-11-19 07:47:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:15,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474272382] [2023-11-19 07:47:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:15,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:16,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:16,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474272382] [2023-11-19 07:47:16,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474272382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:16,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:16,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096639451] [2023-11-19 07:47:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:16,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:16,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:16,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:16,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:16,103 INFO L87 Difference]: Start difference. First operand 656 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:16,433 INFO L93 Difference]: Finished difference Result 1187 states and 1955 transitions. [2023-11-19 07:47:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:16,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 216 [2023-11-19 07:47:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:16,439 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:16,439 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:16,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:16,441 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1977 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:16,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1910 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6497695852534562) internal successors, (1074), 651 states have internal predecessors, (1074), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1080 transitions. [2023-11-19 07:47:16,465 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1080 transitions. Word has length 216 [2023-11-19 07:47:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:16,466 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1080 transitions. [2023-11-19 07:47:16,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1080 transitions. [2023-11-19 07:47:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-11-19 07:47:16,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:16,470 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:16,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:47:16,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:16,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 151132490, now seen corresponding path program 1 times [2023-11-19 07:47:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835609427] [2023-11-19 07:47:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:16,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:17,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:17,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835609427] [2023-11-19 07:47:17,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835609427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:17,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:17,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21722798] [2023-11-19 07:47:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:17,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:17,146 INFO L87 Difference]: Start difference. First operand 656 states and 1080 transitions. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:17,545 INFO L93 Difference]: Finished difference Result 1187 states and 1953 transitions. [2023-11-19 07:47:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 217 [2023-11-19 07:47:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:17,551 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:17,551 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:17,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:17,554 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1969 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1972 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:17,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1972 Valid, 1910 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6482334869431643) internal successors, (1073), 651 states have internal predecessors, (1073), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1079 transitions. [2023-11-19 07:47:17,581 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1079 transitions. Word has length 217 [2023-11-19 07:47:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:17,582 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1079 transitions. [2023-11-19 07:47:17,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1079 transitions. [2023-11-19 07:47:17,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-11-19 07:47:17,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:17,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:17,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:47:17,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:17,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -725530004, now seen corresponding path program 1 times [2023-11-19 07:47:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:17,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584066024] [2023-11-19 07:47:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:18,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:18,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584066024] [2023-11-19 07:47:18,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584066024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:18,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:18,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:18,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142871710] [2023-11-19 07:47:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:18,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:18,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:18,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:18,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:18,246 INFO L87 Difference]: Start difference. First operand 656 states and 1079 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:18,577 INFO L93 Difference]: Finished difference Result 1187 states and 1951 transitions. [2023-11-19 07:47:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:18,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 218 [2023-11-19 07:47:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:18,582 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:18,582 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:18,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:18,585 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1059 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:18,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1917 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6466973886328724) internal successors, (1072), 651 states have internal predecessors, (1072), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1078 transitions. [2023-11-19 07:47:18,611 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1078 transitions. Word has length 218 [2023-11-19 07:47:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:18,612 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1078 transitions. [2023-11-19 07:47:18,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1078 transitions. [2023-11-19 07:47:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-19 07:47:18,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:18,616 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:18,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:47:18,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:18,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1415195376, now seen corresponding path program 1 times [2023-11-19 07:47:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829088265] [2023-11-19 07:47:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829088265] [2023-11-19 07:47:19,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829088265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:19,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:19,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932325584] [2023-11-19 07:47:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:19,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:19,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:19,277 INFO L87 Difference]: Start difference. First operand 656 states and 1078 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:19,606 INFO L93 Difference]: Finished difference Result 1187 states and 1949 transitions. [2023-11-19 07:47:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:19,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 219 [2023-11-19 07:47:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:19,612 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:19,612 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:19,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:19,614 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1055 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:19,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1917 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6451612903225807) internal successors, (1071), 651 states have internal predecessors, (1071), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1077 transitions. [2023-11-19 07:47:19,639 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1077 transitions. Word has length 219 [2023-11-19 07:47:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:19,640 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1077 transitions. [2023-11-19 07:47:19,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1077 transitions. [2023-11-19 07:47:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-19 07:47:19,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:19,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:19,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:47:19,644 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:19,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:19,645 INFO L85 PathProgramCache]: Analyzing trace with hash 563571154, now seen corresponding path program 1 times [2023-11-19 07:47:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:19,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871948452] [2023-11-19 07:47:19,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:20,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:20,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871948452] [2023-11-19 07:47:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871948452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388157488] [2023-11-19 07:47:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:20,320 INFO L87 Difference]: Start difference. First operand 656 states and 1077 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:20,707 INFO L93 Difference]: Finished difference Result 1187 states and 1947 transitions. [2023-11-19 07:47:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:20,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 220 [2023-11-19 07:47:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:20,714 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:20,714 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:20,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:20,718 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1945 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:20,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1948 Valid, 1910 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6436251920122888) internal successors, (1070), 651 states have internal predecessors, (1070), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1076 transitions. [2023-11-19 07:47:20,749 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1076 transitions. Word has length 220 [2023-11-19 07:47:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:20,750 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1076 transitions. [2023-11-19 07:47:20,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1076 transitions. [2023-11-19 07:47:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-11-19 07:47:20,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:20,755 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:20,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:47:20,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:20,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1969317994, now seen corresponding path program 1 times [2023-11-19 07:47:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69875225] [2023-11-19 07:47:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69875225] [2023-11-19 07:47:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69875225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423294204] [2023-11-19 07:47:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:21,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:21,503 INFO L87 Difference]: Start difference. First operand 656 states and 1076 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:21,874 INFO L93 Difference]: Finished difference Result 1187 states and 1945 transitions. [2023-11-19 07:47:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:21,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 221 [2023-11-19 07:47:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:21,881 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:21,881 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:21,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:21,886 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1047 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:21,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1917 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.642089093701997) internal successors, (1069), 651 states have internal predecessors, (1069), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1075 transitions. [2023-11-19 07:47:21,915 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1075 transitions. Word has length 221 [2023-11-19 07:47:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:21,916 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1075 transitions. [2023-11-19 07:47:21,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1075 transitions. [2023-11-19 07:47:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-11-19 07:47:21,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:21,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:21,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:47:21,922 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:21,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:21,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1471059000, now seen corresponding path program 1 times [2023-11-19 07:47:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:21,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286686896] [2023-11-19 07:47:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:22,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:22,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286686896] [2023-11-19 07:47:22,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286686896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:22,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:22,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:22,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542558880] [2023-11-19 07:47:22,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:22,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:22,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:22,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:22,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:22,605 INFO L87 Difference]: Start difference. First operand 656 states and 1075 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:22,999 INFO L93 Difference]: Finished difference Result 1187 states and 1943 transitions. [2023-11-19 07:47:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:23,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 222 [2023-11-19 07:47:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:23,006 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:23,007 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:23,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:23,009 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1043 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:23,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1917 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.640552995391705) internal successors, (1068), 651 states have internal predecessors, (1068), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1074 transitions. [2023-11-19 07:47:23,038 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1074 transitions. Word has length 222 [2023-11-19 07:47:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:23,039 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1074 transitions. [2023-11-19 07:47:23,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1074 transitions. [2023-11-19 07:47:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-11-19 07:47:23,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:23,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:23,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:47:23,044 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:23,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:23,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1557209284, now seen corresponding path program 1 times [2023-11-19 07:47:23,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:23,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784781623] [2023-11-19 07:47:23,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:23,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:23,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:23,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784781623] [2023-11-19 07:47:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784781623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:23,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484283211] [2023-11-19 07:47:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:23,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:23,679 INFO L87 Difference]: Start difference. First operand 656 states and 1074 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:24,029 INFO L93 Difference]: Finished difference Result 1187 states and 1941 transitions. [2023-11-19 07:47:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:24,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 223 [2023-11-19 07:47:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:24,035 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:24,035 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:24,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:24,037 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1921 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:24,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1924 Valid, 1910 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6390168970814132) internal successors, (1067), 651 states have internal predecessors, (1067), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1073 transitions. [2023-11-19 07:47:24,062 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1073 transitions. Word has length 223 [2023-11-19 07:47:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:24,063 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1073 transitions. [2023-11-19 07:47:24,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1073 transitions. [2023-11-19 07:47:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-11-19 07:47:24,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:24,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:24,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:47:24,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:24,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1770670494, now seen corresponding path program 1 times [2023-11-19 07:47:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909524921] [2023-11-19 07:47:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:24,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:24,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909524921] [2023-11-19 07:47:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909524921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:24,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452487341] [2023-11-19 07:47:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:24,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:24,667 INFO L87 Difference]: Start difference. First operand 656 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:24,976 INFO L93 Difference]: Finished difference Result 1187 states and 1939 transitions. [2023-11-19 07:47:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:24,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 224 [2023-11-19 07:47:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:24,982 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:24,982 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:24,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:24,985 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1035 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:24,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1917 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6374807987711213) internal successors, (1066), 651 states have internal predecessors, (1066), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1072 transitions. [2023-11-19 07:47:25,007 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1072 transitions. Word has length 224 [2023-11-19 07:47:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:25,008 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1072 transitions. [2023-11-19 07:47:25,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1072 transitions. [2023-11-19 07:47:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-11-19 07:47:25,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:25,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:25,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:47:25,012 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:25,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -626359838, now seen corresponding path program 1 times [2023-11-19 07:47:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:25,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462583799] [2023-11-19 07:47:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:25,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:25,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462583799] [2023-11-19 07:47:25,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462583799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:25,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:25,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:25,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532486172] [2023-11-19 07:47:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:25,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:25,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:25,605 INFO L87 Difference]: Start difference. First operand 656 states and 1072 transitions. Second operand has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:25,899 INFO L93 Difference]: Finished difference Result 1187 states and 1937 transitions. [2023-11-19 07:47:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 225 [2023-11-19 07:47:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:25,904 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:25,904 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:25,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:25,906 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1905 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:25,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 1910 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6359447004608294) internal successors, (1065), 651 states have internal predecessors, (1065), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1071 transitions. [2023-11-19 07:47:25,930 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1071 transitions. Word has length 225 [2023-11-19 07:47:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:25,931 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1071 transitions. [2023-11-19 07:47:25,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.6) internal successors, (213), 5 states have internal predecessors, (213), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1071 transitions. [2023-11-19 07:47:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-11-19 07:47:25,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:25,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:25,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:47:25,936 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:25,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:25,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1645344252, now seen corresponding path program 1 times [2023-11-19 07:47:25,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:25,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429831053] [2023-11-19 07:47:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:25,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:26,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:26,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:26,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:26,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429831053] [2023-11-19 07:47:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429831053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857177390] [2023-11-19 07:47:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:26,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:26,501 INFO L87 Difference]: Start difference. First operand 656 states and 1071 transitions. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:26,811 INFO L93 Difference]: Finished difference Result 1187 states and 1935 transitions. [2023-11-19 07:47:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:26,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 226 [2023-11-19 07:47:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:26,817 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:26,817 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:26,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:26,820 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1897 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:26,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 1910 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6344086021505377) internal successors, (1064), 651 states have internal predecessors, (1064), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1070 transitions. [2023-11-19 07:47:26,843 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1070 transitions. Word has length 226 [2023-11-19 07:47:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:26,844 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1070 transitions. [2023-11-19 07:47:26,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1070 transitions. [2023-11-19 07:47:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-19 07:47:26,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:26,849 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:26,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:47:26,850 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:26,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash -219086968, now seen corresponding path program 1 times [2023-11-19 07:47:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:26,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936143108] [2023-11-19 07:47:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:27,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936143108] [2023-11-19 07:47:27,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936143108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:27,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:27,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321136545] [2023-11-19 07:47:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:27,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:27,579 INFO L87 Difference]: Start difference. First operand 656 states and 1070 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:27,895 INFO L93 Difference]: Finished difference Result 1187 states and 1933 transitions. [2023-11-19 07:47:27,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:27,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 227 [2023-11-19 07:47:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:27,900 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:27,901 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:27,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:27,903 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1883 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:27,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 1910 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:27,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6328725038402458) internal successors, (1063), 651 states have internal predecessors, (1063), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1069 transitions. [2023-11-19 07:47:27,967 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1069 transitions. Word has length 227 [2023-11-19 07:47:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:27,968 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1069 transitions. [2023-11-19 07:47:27,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1069 transitions. [2023-11-19 07:47:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-19 07:47:27,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:27,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:27,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:47:27,972 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:27,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash 527373380, now seen corresponding path program 1 times [2023-11-19 07:47:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:27,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309261284] [2023-11-19 07:47:27,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:28,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:28,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:28,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:28,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309261284] [2023-11-19 07:47:28,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309261284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:28,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:28,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:28,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739312317] [2023-11-19 07:47:28,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:28,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:28,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:28,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:28,635 INFO L87 Difference]: Start difference. First operand 656 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:28,959 INFO L93 Difference]: Finished difference Result 1187 states and 1931 transitions. [2023-11-19 07:47:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 228 [2023-11-19 07:47:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:28,965 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:28,965 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:28,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:28,967 INFO L413 NwaCegarLoop]: 954 mSDtfsCounter, 1875 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:28,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 1910 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:47:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.631336405529954) internal successors, (1062), 651 states have internal predecessors, (1062), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1068 transitions. [2023-11-19 07:47:28,991 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1068 transitions. Word has length 228 [2023-11-19 07:47:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:28,991 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1068 transitions. [2023-11-19 07:47:28,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1068 transitions. [2023-11-19 07:47:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-19 07:47:28,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:28,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:28,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:47:28,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:28,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 628835426, now seen corresponding path program 1 times [2023-11-19 07:47:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:28,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837462939] [2023-11-19 07:47:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:29,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837462939] [2023-11-19 07:47:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837462939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:29,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:29,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756453066] [2023-11-19 07:47:29,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:29,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:29,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:29,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:29,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:29,782 INFO L87 Difference]: Start difference. First operand 656 states and 1068 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:29,863 INFO L93 Difference]: Finished difference Result 1187 states and 1929 transitions. [2023-11-19 07:47:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:29,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 229 [2023-11-19 07:47:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:29,868 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:29,869 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:29,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:29,870 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 930 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:29,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 2102 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6282642089093702) internal successors, (1060), 651 states have internal predecessors, (1060), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1066 transitions. [2023-11-19 07:47:29,895 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1066 transitions. Word has length 229 [2023-11-19 07:47:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:29,895 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1066 transitions. [2023-11-19 07:47:29,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1066 transitions. [2023-11-19 07:47:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-11-19 07:47:29,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:29,898 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:29,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:47:29,899 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:29,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash -338226484, now seen corresponding path program 1 times [2023-11-19 07:47:29,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:29,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429081357] [2023-11-19 07:47:29,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:30,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:30,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429081357] [2023-11-19 07:47:30,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429081357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:30,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:30,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130158301] [2023-11-19 07:47:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:30,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:30,511 INFO L87 Difference]: Start difference. First operand 656 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:30,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:30,606 INFO L93 Difference]: Finished difference Result 1189 states and 1927 transitions. [2023-11-19 07:47:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:47:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 230 [2023-11-19 07:47:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:30,612 INFO L225 Difference]: With dead ends: 1189 [2023-11-19 07:47:30,612 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:30,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:30,614 INFO L413 NwaCegarLoop]: 1060 mSDtfsCounter, 935 mSDsluCounter, 2114 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:30,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 3174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6267281105990783) internal successors, (1059), 651 states have internal predecessors, (1059), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1065 transitions. [2023-11-19 07:47:30,637 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1065 transitions. Word has length 230 [2023-11-19 07:47:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:30,638 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1065 transitions. [2023-11-19 07:47:30,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1065 transitions. [2023-11-19 07:47:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-11-19 07:47:30,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:30,640 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:30,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:47:30,641 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:30,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash 130714044, now seen corresponding path program 1 times [2023-11-19 07:47:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544063745] [2023-11-19 07:47:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544063745] [2023-11-19 07:47:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544063745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:31,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637232046] [2023-11-19 07:47:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:31,498 INFO L87 Difference]: Start difference. First operand 656 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:31,698 INFO L93 Difference]: Finished difference Result 1187 states and 1923 transitions. [2023-11-19 07:47:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2023-11-19 07:47:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:31,704 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:31,704 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:31,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:31,707 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 917 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:31,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2000 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6251920122887864) internal successors, (1058), 651 states have internal predecessors, (1058), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1064 transitions. [2023-11-19 07:47:31,733 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1064 transitions. Word has length 231 [2023-11-19 07:47:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:31,734 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1064 transitions. [2023-11-19 07:47:31,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1064 transitions. [2023-11-19 07:47:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-11-19 07:47:31,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:31,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:31,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:47:31,737 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:31,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash -543276300, now seen corresponding path program 1 times [2023-11-19 07:47:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:31,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413602035] [2023-11-19 07:47:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:32,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413602035] [2023-11-19 07:47:32,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413602035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:32,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623421977] [2023-11-19 07:47:32,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:32,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:32,368 INFO L87 Difference]: Start difference. First operand 656 states and 1064 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:32,599 INFO L93 Difference]: Finished difference Result 1187 states and 1921 transitions. [2023-11-19 07:47:32,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:32,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 232 [2023-11-19 07:47:32,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:32,605 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:32,605 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:32,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:32,608 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1053 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:32,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 2007 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6236559139784945) internal successors, (1057), 651 states have internal predecessors, (1057), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1063 transitions. [2023-11-19 07:47:32,636 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1063 transitions. Word has length 232 [2023-11-19 07:47:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:32,637 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1063 transitions. [2023-11-19 07:47:32,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1063 transitions. [2023-11-19 07:47:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-11-19 07:47:32,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:32,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:32,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:47:32,642 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:32,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1935297302, now seen corresponding path program 1 times [2023-11-19 07:47:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:32,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202301202] [2023-11-19 07:47:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:33,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202301202] [2023-11-19 07:47:33,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202301202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:33,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406687736] [2023-11-19 07:47:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:33,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:33,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:33,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:33,268 INFO L87 Difference]: Start difference. First operand 656 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:33,474 INFO L93 Difference]: Finished difference Result 1187 states and 1919 transitions. [2023-11-19 07:47:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:33,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 233 [2023-11-19 07:47:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:33,479 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:33,480 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:33,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:33,482 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1955 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1958 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:33,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1958 Valid, 2000 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6221198156682028) internal successors, (1056), 651 states have internal predecessors, (1056), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1062 transitions. [2023-11-19 07:47:33,504 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1062 transitions. Word has length 233 [2023-11-19 07:47:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:33,505 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1062 transitions. [2023-11-19 07:47:33,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1062 transitions. [2023-11-19 07:47:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-19 07:47:33,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:33,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:33,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 07:47:33,508 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:33,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:33,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1584312334, now seen corresponding path program 1 times [2023-11-19 07:47:33,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:33,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399943024] [2023-11-19 07:47:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:33,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:34,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399943024] [2023-11-19 07:47:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399943024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:34,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256682065] [2023-11-19 07:47:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:34,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:34,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:34,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:34,119 INFO L87 Difference]: Start difference. First operand 656 states and 1062 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:34,334 INFO L93 Difference]: Finished difference Result 1187 states and 1917 transitions. [2023-11-19 07:47:34,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:34,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234 [2023-11-19 07:47:34,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:34,340 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:34,340 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:34,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:34,342 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1947 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1950 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:34,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1950 Valid, 2000 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:47:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.620583717357911) internal successors, (1055), 651 states have internal predecessors, (1055), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1061 transitions. [2023-11-19 07:47:34,366 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1061 transitions. Word has length 234 [2023-11-19 07:47:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:34,367 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1061 transitions. [2023-11-19 07:47:34,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1061 transitions. [2023-11-19 07:47:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-11-19 07:47:34,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:34,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:34,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-19 07:47:34,372 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:34,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1211186832, now seen corresponding path program 1 times [2023-11-19 07:47:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:34,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197532698] [2023-11-19 07:47:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:34,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:35,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197532698] [2023-11-19 07:47:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197532698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157425749] [2023-11-19 07:47:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:35,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:35,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:35,079 INFO L87 Difference]: Start difference. First operand 656 states and 1061 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:35,265 INFO L93 Difference]: Finished difference Result 1187 states and 1915 transitions. [2023-11-19 07:47:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 235 [2023-11-19 07:47:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:35,271 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:35,271 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:35,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:35,273 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1041 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:35,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 2007 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.619047619047619) internal successors, (1054), 651 states have internal predecessors, (1054), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1060 transitions. [2023-11-19 07:47:35,299 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1060 transitions. Word has length 235 [2023-11-19 07:47:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:35,300 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1060 transitions. [2023-11-19 07:47:35,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1060 transitions. [2023-11-19 07:47:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-11-19 07:47:35,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:35,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:35,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-19 07:47:35,304 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:35,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:35,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2000339496, now seen corresponding path program 1 times [2023-11-19 07:47:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:35,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105945280] [2023-11-19 07:47:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:35,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:35,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:35,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105945280] [2023-11-19 07:47:35,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105945280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:35,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:35,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440978698] [2023-11-19 07:47:35,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:35,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:35,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:35,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:35,914 INFO L87 Difference]: Start difference. First operand 656 states and 1060 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:36,076 INFO L93 Difference]: Finished difference Result 1187 states and 1913 transitions. [2023-11-19 07:47:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 236 [2023-11-19 07:47:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:36,081 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:36,081 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:36,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:36,083 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1037 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:36,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 2007 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6175115207373272) internal successors, (1053), 651 states have internal predecessors, (1053), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1059 transitions. [2023-11-19 07:47:36,102 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1059 transitions. Word has length 236 [2023-11-19 07:47:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:36,102 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1059 transitions. [2023-11-19 07:47:36,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 5 states have internal predecessors, (224), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1059 transitions. [2023-11-19 07:47:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-11-19 07:47:36,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:36,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:36,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-19 07:47:36,105 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:36,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1825805110, now seen corresponding path program 1 times [2023-11-19 07:47:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:36,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602380115] [2023-11-19 07:47:36,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:36,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602380115] [2023-11-19 07:47:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602380115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:36,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:36,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528300421] [2023-11-19 07:47:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:36,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:36,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:36,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:36,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:36,628 INFO L87 Difference]: Start difference. First operand 656 states and 1059 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:36,799 INFO L93 Difference]: Finished difference Result 1187 states and 1911 transitions. [2023-11-19 07:47:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:36,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 237 [2023-11-19 07:47:36,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:36,805 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:36,805 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:36,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:36,807 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1923 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:36,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 2000 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6159754224270353) internal successors, (1052), 651 states have internal predecessors, (1052), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1058 transitions. [2023-11-19 07:47:36,826 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1058 transitions. Word has length 237 [2023-11-19 07:47:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:36,827 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1058 transitions. [2023-11-19 07:47:36,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:36,827 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1058 transitions. [2023-11-19 07:47:36,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-11-19 07:47:36,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:36,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:36,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-19 07:47:36,830 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:36,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash -92604094, now seen corresponding path program 1 times [2023-11-19 07:47:36,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:36,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858897607] [2023-11-19 07:47:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:37,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:37,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858897607] [2023-11-19 07:47:37,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858897607] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:37,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:37,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106173416] [2023-11-19 07:47:37,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:37,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:37,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:37,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:37,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:37,383 INFO L87 Difference]: Start difference. First operand 656 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:37,565 INFO L93 Difference]: Finished difference Result 1187 states and 1909 transitions. [2023-11-19 07:47:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:37,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 238 [2023-11-19 07:47:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:37,571 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:37,571 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:37,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:37,573 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1029 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:37,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 2007 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6144393241167434) internal successors, (1051), 651 states have internal predecessors, (1051), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1057 transitions. [2023-11-19 07:47:37,595 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1057 transitions. Word has length 238 [2023-11-19 07:47:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:37,595 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1057 transitions. [2023-11-19 07:47:37,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1057 transitions. [2023-11-19 07:47:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-11-19 07:47:37,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:37,598 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:37,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-19 07:47:37,599 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:37,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1455960796, now seen corresponding path program 1 times [2023-11-19 07:47:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549241382] [2023-11-19 07:47:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:37,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549241382] [2023-11-19 07:47:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549241382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973737787] [2023-11-19 07:47:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:38,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:38,426 INFO L87 Difference]: Start difference. First operand 656 states and 1057 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:38,567 INFO L93 Difference]: Finished difference Result 1187 states and 1907 transitions. [2023-11-19 07:47:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:38,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 239 [2023-11-19 07:47:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:38,573 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:38,573 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:38,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:38,576 INFO L413 NwaCegarLoop]: 1023 mSDtfsCounter, 915 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:38,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 2048 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6129032258064515) internal successors, (1050), 651 states have internal predecessors, (1050), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1056 transitions. [2023-11-19 07:47:38,600 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1056 transitions. Word has length 239 [2023-11-19 07:47:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:38,600 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1056 transitions. [2023-11-19 07:47:38,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1056 transitions. [2023-11-19 07:47:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-11-19 07:47:38,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:38,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:38,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-19 07:47:38,604 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:38,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1929673650, now seen corresponding path program 1 times [2023-11-19 07:47:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:38,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418869668] [2023-11-19 07:47:38,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418869668] [2023-11-19 07:47:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418869668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:39,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:39,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:39,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766408019] [2023-11-19 07:47:39,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:39,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:39,204 INFO L87 Difference]: Start difference. First operand 656 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:39,340 INFO L93 Difference]: Finished difference Result 1189 states and 1907 transitions. [2023-11-19 07:47:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:47:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 240 [2023-11-19 07:47:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:39,345 INFO L225 Difference]: With dead ends: 1189 [2023-11-19 07:47:39,345 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:39,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:39,348 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 919 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:39,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 3127 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6113671274961598) internal successors, (1049), 651 states have internal predecessors, (1049), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1055 transitions. [2023-11-19 07:47:39,374 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1055 transitions. Word has length 240 [2023-11-19 07:47:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:39,375 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1055 transitions. [2023-11-19 07:47:39,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1055 transitions. [2023-11-19 07:47:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-11-19 07:47:39,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:39,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:39,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-19 07:47:39,379 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:39,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1651936638, now seen corresponding path program 1 times [2023-11-19 07:47:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406931568] [2023-11-19 07:47:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:39,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406931568] [2023-11-19 07:47:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406931568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:39,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452999931] [2023-11-19 07:47:39,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:39,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:39,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:39,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:39,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:39,964 INFO L87 Difference]: Start difference. First operand 656 states and 1055 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:40,081 INFO L93 Difference]: Finished difference Result 1187 states and 1903 transitions. [2023-11-19 07:47:40,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:40,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 241 [2023-11-19 07:47:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:40,086 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:40,086 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:40,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:40,087 INFO L413 NwaCegarLoop]: 1023 mSDtfsCounter, 1041 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:40,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 2055 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:40,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.609831029185868) internal successors, (1048), 651 states have internal predecessors, (1048), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1054 transitions. [2023-11-19 07:47:40,109 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1054 transitions. Word has length 241 [2023-11-19 07:47:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:40,110 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1054 transitions. [2023-11-19 07:47:40,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1054 transitions. [2023-11-19 07:47:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-11-19 07:47:40,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:40,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:40,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-19 07:47:40,113 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:40,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 935019534, now seen corresponding path program 1 times [2023-11-19 07:47:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:40,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271913395] [2023-11-19 07:47:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:40,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271913395] [2023-11-19 07:47:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271913395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:40,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:40,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:47:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829026450] [2023-11-19 07:47:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:40,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:47:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:47:40,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:40,666 INFO L87 Difference]: Start difference. First operand 656 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:40,782 INFO L93 Difference]: Finished difference Result 1187 states and 1901 transitions. [2023-11-19 07:47:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:40,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 242 [2023-11-19 07:47:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:40,787 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:40,787 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:40,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:47:40,789 INFO L413 NwaCegarLoop]: 1023 mSDtfsCounter, 1037 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:40,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 2055 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:47:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.608294930875576) internal successors, (1047), 651 states have internal predecessors, (1047), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1053 transitions. [2023-11-19 07:47:40,825 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1053 transitions. Word has length 242 [2023-11-19 07:47:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:40,826 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1053 transitions. [2023-11-19 07:47:40,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1053 transitions. [2023-11-19 07:47:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-11-19 07:47:40,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:40,828 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:40,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-19 07:47:40,829 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:40,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1142899416, now seen corresponding path program 1 times [2023-11-19 07:47:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:40,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529691982] [2023-11-19 07:47:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:47:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:47:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:41,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:41,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529691982] [2023-11-19 07:47:41,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529691982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:41,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:41,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:41,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065895055] [2023-11-19 07:47:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:41,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:41,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:41,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:41,544 INFO L87 Difference]: Start difference. First operand 656 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:47:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:41,622 INFO L93 Difference]: Finished difference Result 1187 states and 1899 transitions. [2023-11-19 07:47:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:41,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 243 [2023-11-19 07:47:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:41,627 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:41,628 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:41,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:41,630 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 955 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:41,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 2082 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:47:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6067588325652842) internal successors, (1046), 651 states have internal predecessors, (1046), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1052 transitions. [2023-11-19 07:47:41,654 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1052 transitions. Word has length 243 [2023-11-19 07:47:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:41,655 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1052 transitions. [2023-11-19 07:47:41,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:47:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1052 transitions. [2023-11-19 07:47:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-19 07:47:41,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:41,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:41,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-19 07:47:41,658 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:41,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1895721506, now seen corresponding path program 1 times [2023-11-19 07:47:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812049248] [2023-11-19 07:47:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:47:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-19 07:47:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-19 07:47:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:47:42,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:42,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812049248] [2023-11-19 07:47:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812049248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:42,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:42,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:47:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746380769] [2023-11-19 07:47:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:42,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:47:42,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:47:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:47:42,684 INFO L87 Difference]: Start difference. First operand 656 states and 1052 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:43,165 INFO L93 Difference]: Finished difference Result 1187 states and 1897 transitions. [2023-11-19 07:47:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:47:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 244 [2023-11-19 07:47:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:43,170 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:47:43,170 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:47:43,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:47:43,172 INFO L413 NwaCegarLoop]: 828 mSDtfsCounter, 917 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:43,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1658 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:47:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:47:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:47:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.6036866359447004) internal successors, (1044), 651 states have internal predecessors, (1044), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:47:43,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1050 transitions. [2023-11-19 07:47:43,194 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1050 transitions. Word has length 244 [2023-11-19 07:47:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:43,195 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1050 transitions. [2023-11-19 07:47:43,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:47:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1050 transitions. [2023-11-19 07:47:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-11-19 07:47:43,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:43,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:43,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-19 07:47:43,198 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:43,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2069057464, now seen corresponding path program 1 times [2023-11-19 07:47:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273254906] [2023-11-19 07:47:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms