./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_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_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/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_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/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_9c4d0118-5434-4c2b-baef-9983f7671796/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 61bc671f3649b1d9d6fbe9f0597d430b8b23b87e2a7d2106b41de545f5b7b012 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:41:04,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:41:04,343 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-19 07:41:04,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:41:04,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:41:04,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:41:04,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:41:04,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:41:04,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:41:04,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:41:04,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:41:04,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:41:04,410 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:41:04,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:41:04,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:41:04,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:41:04,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:41:04,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:41:04,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:41:04,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:41:04,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:41:04,434 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:41:04,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:41:04,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:41:04,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:41:04,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:04,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:41:04,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:41:04,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:41:04,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:41:04,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:41:04,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:41:04,440 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:41:04,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:41:04,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:41:04,440 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:41:04,441 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_9c4d0118-5434-4c2b-baef-9983f7671796/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_9c4d0118-5434-4c2b-baef-9983f7671796/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 -> 61bc671f3649b1d9d6fbe9f0597d430b8b23b87e2a7d2106b41de545f5b7b012 [2023-11-19 07:41:04,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:41:04,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:41:04,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:41:04,797 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:41:04,810 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:41:04,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2023-11-19 07:41:07,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:41:08,271 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:41:08,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2023-11-19 07:41:08,314 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/data/1d5dd1b59/b3d2b0d5df2045f9be7a655ce0284ac1/FLAG0f56ce946 [2023-11-19 07:41:08,329 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/data/1d5dd1b59/b3d2b0d5df2045f9be7a655ce0284ac1 [2023-11-19 07:41:08,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:41:08,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:41:08,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:08,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:41:08,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:41:08,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:08" (1/1) ... [2023-11-19 07:41:08,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294d2c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:08, skipping insertion in model container [2023-11-19 07:41:08,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:08" (1/1) ... [2023-11-19 07:41:08,444 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:41:08,640 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_9c4d0118-5434-4c2b-baef-9983f7671796/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2023-11-19 07:41:09,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:09,036 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:41:09,050 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_9c4d0118-5434-4c2b-baef-9983f7671796/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c[1280,1293] [2023-11-19 07:41:09,234 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:41:09,250 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:41:09,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09 WrapperNode [2023-11-19 07:41:09,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:41:09,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:09,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:41:09,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:41:09,261 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:41:09" (1/1) ... [2023-11-19 07:41:09,330 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:41:09" (1/1) ... [2023-11-19 07:41:09,670 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3591 [2023-11-19 07:41:09,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:41:09,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:41:09,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:41:09,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:41:09,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:09,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:09,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:09,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:09,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:09,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:09,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:09,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:10,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:41:10,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:41:10,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:41:10,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:41:10,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (1/1) ... [2023-11-19 07:41:10,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:41:10,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:41:10,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/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:41:10,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9c4d0118-5434-4c2b-baef-9983f7671796/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:41:10,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:41:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:41:10,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:41:10,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:41:10,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:41:10,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:41:10,720 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:41:10,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:41:14,020 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:41:14,040 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:41:14,040 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:41:14,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:14 BoogieIcfgContainer [2023-11-19 07:41:14,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:41:14,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:41:14,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:41:14,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:41:14,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:08" (1/3) ... [2023-11-19 07:41:14,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34526e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:14, skipping insertion in model container [2023-11-19 07:41:14,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:09" (2/3) ... [2023-11-19 07:41:14,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34526e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:14, skipping insertion in model container [2023-11-19 07:41:14,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:14" (3/3) ... [2023-11-19 07:41:14,062 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d32_e0.c [2023-11-19 07:41:14,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:41:14,084 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:41:14,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:41:14,168 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;@5fd7a035, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:41:14,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:41:14,176 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:41:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-19 07:41:14,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:14,200 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:41:14,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:14,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash 865587800, now seen corresponding path program 1 times [2023-11-19 07:41:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511500140] [2023-11-19 07:41:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:14,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:15,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:15,043 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:41:15,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:15,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511500140] [2023-11-19 07:41:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511500140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:15,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:15,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:41:15,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63764654] [2023-11-19 07:41:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:15,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:41:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:15,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:41:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:41:15,101 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:41:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:15,192 INFO L93 Difference]: Finished difference Result 1191 states and 1975 transitions. [2023-11-19 07:41:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:41:15,195 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:41:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:15,217 INFO L225 Difference]: With dead ends: 1191 [2023-11-19 07:41:15,217 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:15,226 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:41:15,233 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:41:15,236 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:41:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:15,377 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:41:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1084 transitions. [2023-11-19 07:41:15,387 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1084 transitions. Word has length 213 [2023-11-19 07:41:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:15,392 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1084 transitions. [2023-11-19 07:41:15,392 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:41:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1084 transitions. [2023-11-19 07:41:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-11-19 07:41:15,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:15,401 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:41:15,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:41:15,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:15,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1825663378, now seen corresponding path program 1 times [2023-11-19 07:41:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571395071] [2023-11-19 07:41:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:16,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:16,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:16,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:16,930 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:41:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571395071] [2023-11-19 07:41:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571395071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:16,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:16,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574242000] [2023-11-19 07:41:16,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:16,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:16,938 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:41:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:17,124 INFO L93 Difference]: Finished difference Result 1187 states and 1961 transitions. [2023-11-19 07:41:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:17,125 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:41:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:17,140 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:17,140 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:17,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:17,148 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 942 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2102 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:41:17,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 2102 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:17,189 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:41:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1083 transitions. [2023-11-19 07:41:17,195 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1083 transitions. Word has length 213 [2023-11-19 07:41:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:17,197 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1083 transitions. [2023-11-19 07:41:17,198 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:41:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1083 transitions. [2023-11-19 07:41:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-11-19 07:41:17,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:17,204 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:41:17,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:41:17,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:17,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash -393369334, now seen corresponding path program 1 times [2023-11-19 07:41:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:17,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456872406] [2023-11-19 07:41:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:17,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:18,041 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:41:18,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:18,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456872406] [2023-11-19 07:41:18,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456872406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:18,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598747118] [2023-11-19 07:41:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:18,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:18,051 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:41:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:18,215 INFO L93 Difference]: Finished difference Result 1191 states and 1964 transitions. [2023-11-19 07:41:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:18,217 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:41:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:18,224 INFO L225 Difference]: With dead ends: 1191 [2023-11-19 07:41:18,224 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:18,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:41:18,238 INFO L413 NwaCegarLoop]: 1076 mSDtfsCounter, 950 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:18,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 3206 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:18,259 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:41:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1082 transitions. [2023-11-19 07:41:18,264 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1082 transitions. Word has length 214 [2023-11-19 07:41:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:18,265 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1082 transitions. [2023-11-19 07:41:18,266 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:41:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1082 transitions. [2023-11-19 07:41:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-11-19 07:41:18,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:18,269 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:41:18,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:41:18,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:18,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2050156870, now seen corresponding path program 1 times [2023-11-19 07:41:18,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:18,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340922672] [2023-11-19 07:41:18,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:19,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:41:19,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:19,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340922672] [2023-11-19 07:41:19,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340922672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:19,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:19,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:19,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5772448] [2023-11-19 07:41:19,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:19,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:19,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:19,118 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:41:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:19,277 INFO L93 Difference]: Finished difference Result 1187 states and 1957 transitions. [2023-11-19 07:41:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:19,278 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:41:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:19,283 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:19,284 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:19,285 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:41:19,293 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 1071 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 2109 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:41:19,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 2109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:19,319 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:41:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1081 transitions. [2023-11-19 07:41:19,324 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1081 transitions. Word has length 215 [2023-11-19 07:41:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:19,325 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1081 transitions. [2023-11-19 07:41:19,325 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:41:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1081 transitions. [2023-11-19 07:41:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-11-19 07:41:19,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:19,331 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:41:19,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:41:19,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:19,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash -351623312, now seen corresponding path program 1 times [2023-11-19 07:41:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:19,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211633960] [2023-11-19 07:41:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:20,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:20,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:20,131 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:41:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211633960] [2023-11-19 07:41:20,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211633960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:20,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:20,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917795884] [2023-11-19 07:41:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:20,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:20,135 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:41:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:20,268 INFO L93 Difference]: Finished difference Result 1187 states and 1955 transitions. [2023-11-19 07:41:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:20,269 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:41:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:20,274 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:20,274 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:20,275 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:41:20,276 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 1064 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 2109 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:41:20,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 2109 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:20,331 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:41:20,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1080 transitions. [2023-11-19 07:41:20,335 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1080 transitions. Word has length 216 [2023-11-19 07:41:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:20,336 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1080 transitions. [2023-11-19 07:41:20,336 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:41:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1080 transitions. [2023-11-19 07:41:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-11-19 07:41:20,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:20,340 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:41:20,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:41:20,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:20,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1572206662, now seen corresponding path program 1 times [2023-11-19 07:41:20,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158791236] [2023-11-19 07:41:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:21,356 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:41:21,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:21,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158791236] [2023-11-19 07:41:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158791236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:21,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536271514] [2023-11-19 07:41:21,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:21,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:21,360 INFO L87 Difference]: Start difference. First operand 656 states and 1080 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 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:41:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:21,711 INFO L93 Difference]: Finished difference Result 1187 states and 1953 transitions. [2023-11-19 07:41:21,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:21,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 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:41:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:21,717 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:21,718 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:21,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:41:21,720 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 910 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1902 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:41:21,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1902 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:21,739 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:41:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1079 transitions. [2023-11-19 07:41:21,743 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1079 transitions. Word has length 217 [2023-11-19 07:41:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:21,744 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1079 transitions. [2023-11-19 07:41:21,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 4 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:41:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1079 transitions. [2023-11-19 07:41:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-11-19 07:41:21,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:21,748 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:41:21,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:41:21,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:21,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1929183730, now seen corresponding path program 1 times [2023-11-19 07:41:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580828712] [2023-11-19 07:41:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:21,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:22,415 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:41:22,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:22,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580828712] [2023-11-19 07:41:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580828712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:22,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:22,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622615703] [2023-11-19 07:41:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:22,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:22,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:22,420 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:41:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:22,727 INFO L93 Difference]: Finished difference Result 1191 states and 1956 transitions. [2023-11-19 07:41:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:22,728 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:41:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:22,732 INFO L225 Difference]: With dead ends: 1191 [2023-11-19 07:41:22,733 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:22,734 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:41:22,735 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 918 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 3098 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:22,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 3098 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:22,755 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:41:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1078 transitions. [2023-11-19 07:41:22,761 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1078 transitions. Word has length 218 [2023-11-19 07:41:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:22,761 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1078 transitions. [2023-11-19 07:41:22,762 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:41:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1078 transitions. [2023-11-19 07:41:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-19 07:41:22,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:22,766 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:41:22,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:41:22,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:22,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1883365894, now seen corresponding path program 1 times [2023-11-19 07:41:22,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:22,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298048458] [2023-11-19 07:41:22,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:22,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:23,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:23,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:23,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:23,449 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:41:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298048458] [2023-11-19 07:41:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298048458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333619527] [2023-11-19 07:41:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:23,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:23,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:23,453 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:41:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:23,804 INFO L93 Difference]: Finished difference Result 1187 states and 1949 transitions. [2023-11-19 07:41:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:23,805 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:41:23,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:23,810 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:23,810 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:23,812 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:41:23,813 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1067 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1909 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:41:23,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 1909 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:23,832 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:41:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1077 transitions. [2023-11-19 07:41:23,837 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1077 transitions. Word has length 219 [2023-11-19 07:41:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:23,838 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1077 transitions. [2023-11-19 07:41:23,838 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:41:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1077 transitions. [2023-11-19 07:41:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-19 07:41:23,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:23,842 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:41:23,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:41:23,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:23,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash -676412300, now seen corresponding path program 1 times [2023-11-19 07:41:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340431266] [2023-11-19 07:41:23,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:24,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:24,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:24,550 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:41:24,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:24,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340431266] [2023-11-19 07:41:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340431266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154554813] [2023-11-19 07:41:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:24,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:24,558 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:41:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:24,894 INFO L93 Difference]: Finished difference Result 1187 states and 1947 transitions. [2023-11-19 07:41:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:24,895 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:41:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:24,900 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:24,900 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:24,901 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:41:24,902 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1060 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1909 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:41:24,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1909 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:24,921 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:41:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1076 transitions. [2023-11-19 07:41:24,925 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1076 transitions. Word has length 220 [2023-11-19 07:41:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:24,926 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1076 transitions. [2023-11-19 07:41:24,926 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:41:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1076 transitions. [2023-11-19 07:41:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-11-19 07:41:24,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:24,930 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:41:24,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:41:24,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:24,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash -319850758, now seen corresponding path program 1 times [2023-11-19 07:41:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:24,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348848440] [2023-11-19 07:41:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:25,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:25,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:25,669 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:41:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:25,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348848440] [2023-11-19 07:41:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348848440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634717119] [2023-11-19 07:41:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:25,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:25,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:25,673 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:41:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:26,014 INFO L93 Difference]: Finished difference Result 1187 states and 1945 transitions. [2023-11-19 07:41:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:26,015 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:41:26,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:26,020 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:26,020 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:26,021 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:41:26,022 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1056 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1909 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:41:26,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1909 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:26,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:26,043 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:41:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1075 transitions. [2023-11-19 07:41:26,047 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1075 transitions. Word has length 221 [2023-11-19 07:41:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:26,048 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1075 transitions. [2023-11-19 07:41:26,048 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:41:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1075 transitions. [2023-11-19 07:41:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-11-19 07:41:26,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:26,052 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:41:26,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:41:26,053 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:26,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1565319950, now seen corresponding path program 1 times [2023-11-19 07:41:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:26,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222003699] [2023-11-19 07:41:26,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:26,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:26,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:26,675 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:41:26,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:26,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222003699] [2023-11-19 07:41:26,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222003699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:26,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:26,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:26,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017092223] [2023-11-19 07:41:26,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:26,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:26,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:26,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:26,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:26,680 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:41:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:27,028 INFO L93 Difference]: Finished difference Result 1187 states and 1943 transitions. [2023-11-19 07:41:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:27,029 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:41:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:27,034 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:27,034 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:27,035 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:41:27,036 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1052 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1909 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:41:27,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1909 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:27,056 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:41:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1074 transitions. [2023-11-19 07:41:27,060 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1074 transitions. Word has length 222 [2023-11-19 07:41:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:27,061 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1074 transitions. [2023-11-19 07:41:27,062 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:41:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1074 transitions. [2023-11-19 07:41:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2023-11-19 07:41:27,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:27,066 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:41:27,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:41:27,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:27,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1033008596, now seen corresponding path program 1 times [2023-11-19 07:41:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864911001] [2023-11-19 07:41:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:27,656 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:41:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864911001] [2023-11-19 07:41:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864911001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931342776] [2023-11-19 07:41:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:27,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:27,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:27,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:27,660 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:41:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:27,993 INFO L93 Difference]: Finished difference Result 1187 states and 1941 transitions. [2023-11-19 07:41:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:27,995 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:41:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:27,999 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:27,999 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:28,001 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:41:28,002 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1935 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 1902 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:41:28,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 1902 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:28,021 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:41:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1073 transitions. [2023-11-19 07:41:28,025 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1073 transitions. Word has length 223 [2023-11-19 07:41:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:28,026 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1073 transitions. [2023-11-19 07:41:28,027 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:41:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1073 transitions. [2023-11-19 07:41:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-11-19 07:41:28,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:28,030 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:41:28,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:41:28,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:28,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash -151255384, now seen corresponding path program 1 times [2023-11-19 07:41:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:28,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189592059] [2023-11-19 07:41:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:28,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:28,671 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:41:28,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:28,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189592059] [2023-11-19 07:41:28,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189592059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:28,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:28,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:28,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381400453] [2023-11-19 07:41:28,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:28,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:28,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:28,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:28,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:28,675 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:41:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:28,991 INFO L93 Difference]: Finished difference Result 1187 states and 1939 transitions. [2023-11-19 07:41:28,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:28,992 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:41:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:28,996 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:28,997 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:28,998 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:41:28,999 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1927 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 1902 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:41:28,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 1902 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:29,018 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:41:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1072 transitions. [2023-11-19 07:41:29,022 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1072 transitions. Word has length 224 [2023-11-19 07:41:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:29,023 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1072 transitions. [2023-11-19 07:41:29,023 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:41:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1072 transitions. [2023-11-19 07:41:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-11-19 07:41:29,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:29,027 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:41:29,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:41:29,028 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:29,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash -968210002, now seen corresponding path program 1 times [2023-11-19 07:41:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934997800] [2023-11-19 07:41:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:29,666 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:41:29,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:29,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934997800] [2023-11-19 07:41:29,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934997800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:29,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:29,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:29,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016447746] [2023-11-19 07:41:29,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:29,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:29,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:29,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:29,669 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:41:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:29,974 INFO L93 Difference]: Finished difference Result 1187 states and 1937 transitions. [2023-11-19 07:41:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:29,975 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:41:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:29,980 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:29,980 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:29,981 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:41:29,982 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1040 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1909 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:41:29,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1909 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:30,001 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:41:30,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1071 transitions. [2023-11-19 07:41:30,005 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1071 transitions. Word has length 225 [2023-11-19 07:41:30,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:30,006 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1071 transitions. [2023-11-19 07:41:30,006 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:41:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1071 transitions. [2023-11-19 07:41:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2023-11-19 07:41:30,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:30,010 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:41:30,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:41:30,010 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:30,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2034020162, now seen corresponding path program 1 times [2023-11-19 07:41:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828347474] [2023-11-19 07:41:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:30,655 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:41:30,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828347474] [2023-11-19 07:41:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828347474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:30,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:30,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550815542] [2023-11-19 07:41:30,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:30,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:30,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:30,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:30,659 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:41:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:30,975 INFO L93 Difference]: Finished difference Result 1187 states and 1935 transitions. [2023-11-19 07:41:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:30,976 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:41:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:30,981 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:30,981 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:30,984 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:41:30,985 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1036 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1909 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:41:30,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1909 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:31,004 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:41:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1070 transitions. [2023-11-19 07:41:31,008 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1070 transitions. Word has length 226 [2023-11-19 07:41:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:31,009 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1070 transitions. [2023-11-19 07:41:31,009 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:41:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1070 transitions. [2023-11-19 07:41:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-19 07:41:31,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:31,014 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:41:31,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:41:31,014 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:31,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:31,015 INFO L85 PathProgramCache]: Analyzing trace with hash 978547336, now seen corresponding path program 1 times [2023-11-19 07:41:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:31,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702092351] [2023-11-19 07:41:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:31,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:31,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:31,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:31,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:31,667 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:41:31,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702092351] [2023-11-19 07:41:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702092351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:31,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:31,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112532777] [2023-11-19 07:41:31,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:31,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:31,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:31,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:31,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:31,673 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:41:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:31,992 INFO L93 Difference]: Finished difference Result 1187 states and 1933 transitions. [2023-11-19 07:41:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:31,993 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:41:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:31,998 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:31,998 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:31,999 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:41:32,000 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1032 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1909 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:41:32,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1909 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:32,020 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:41:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1069 transitions. [2023-11-19 07:41:32,024 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1069 transitions. Word has length 227 [2023-11-19 07:41:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:32,024 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1069 transitions. [2023-11-19 07:41:32,025 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:41:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1069 transitions. [2023-11-19 07:41:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-19 07:41:32,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:32,029 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:41:32,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:41:32,029 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:32,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1756406564, now seen corresponding path program 1 times [2023-11-19 07:41:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580861514] [2023-11-19 07:41:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:32,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:32,691 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:41:32,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580861514] [2023-11-19 07:41:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580861514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:32,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494859008] [2023-11-19 07:41:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:32,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:32,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:32,695 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:41:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:33,018 INFO L93 Difference]: Finished difference Result 1187 states and 1931 transitions. [2023-11-19 07:41:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:33,019 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:41:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:33,023 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:33,023 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:33,025 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:41:33,025 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1895 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 1902 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:41:33,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 1902 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:33,045 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:41:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1068 transitions. [2023-11-19 07:41:33,048 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1068 transitions. Word has length 228 [2023-11-19 07:41:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:33,049 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1068 transitions. [2023-11-19 07:41:33,049 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:41:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1068 transitions. [2023-11-19 07:41:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-11-19 07:41:33,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:33,052 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:41:33,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 07:41:33,052 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:33,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 615149666, now seen corresponding path program 1 times [2023-11-19 07:41:33,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382477350] [2023-11-19 07:41:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:33,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:33,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:33,603 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:41:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382477350] [2023-11-19 07:41:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382477350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:33,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948652746] [2023-11-19 07:41:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:33,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:33,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:33,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:33,608 INFO L87 Difference]: Start difference. First operand 656 states and 1068 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 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:41:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:33,909 INFO L93 Difference]: Finished difference Result 1187 states and 1929 transitions. [2023-11-19 07:41:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:33,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 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:41:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:33,915 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:33,915 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:33,916 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:41:33,917 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1887 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1890 SdHoareTripleChecker+Valid, 1902 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.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:33,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1890 Valid, 1902 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 651 states have (on average 1.629800307219662) internal successors, (1061), 651 states have internal predecessors, (1061), 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:41:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1067 transitions. [2023-11-19 07:41:33,938 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1067 transitions. Word has length 229 [2023-11-19 07:41:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:33,939 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1067 transitions. [2023-11-19 07:41:33,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 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:41:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1067 transitions. [2023-11-19 07:41:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-11-19 07:41:33,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:33,942 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:41:33,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 07:41:33,943 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:33,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1556836490, now seen corresponding path program 1 times [2023-11-19 07:41:33,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:33,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137266369] [2023-11-19 07:41:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:34,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:34,544 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:41:34,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137266369] [2023-11-19 07:41:34,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137266369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:34,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609880157] [2023-11-19 07:41:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:34,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:34,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:34,550 INFO L87 Difference]: Start difference. First operand 656 states and 1067 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:41:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:34,848 INFO L93 Difference]: Finished difference Result 1187 states and 1927 transitions. [2023-11-19 07:41:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:34,848 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:41:34,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:34,853 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:34,853 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:34,854 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:41:34,855 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1879 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 1902 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:41:34,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 1902 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:34,874 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:41:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1066 transitions. [2023-11-19 07:41:34,877 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1066 transitions. Word has length 230 [2023-11-19 07:41:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:34,877 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1066 transitions. [2023-11-19 07:41:34,878 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:41:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1066 transitions. [2023-11-19 07:41:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-11-19 07:41:34,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:34,880 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:41:34,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:41:34,881 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:34,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:34,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1745601340, now seen corresponding path program 1 times [2023-11-19 07:41:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562936026] [2023-11-19 07:41:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:35,430 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:41:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562936026] [2023-11-19 07:41:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562936026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:35,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:35,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164908079] [2023-11-19 07:41:35,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:35,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:35,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:35,434 INFO L87 Difference]: Start difference. First operand 656 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 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:41:35,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:35,707 INFO L93 Difference]: Finished difference Result 1187 states and 1925 transitions. [2023-11-19 07:41:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:35,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 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:41:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:35,712 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:35,712 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:35,713 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:41:35,714 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1016 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1909 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.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:35,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1909 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:41:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:35,737 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:41:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1065 transitions. [2023-11-19 07:41:35,739 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1065 transitions. Word has length 231 [2023-11-19 07:41:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:35,740 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1065 transitions. [2023-11-19 07:41:35,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 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:41:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1065 transitions. [2023-11-19 07:41:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-11-19 07:41:35,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:35,742 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:41:35,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-19 07:41:35,743 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:35,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1303168784, now seen corresponding path program 1 times [2023-11-19 07:41:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373970528] [2023-11-19 07:41:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:36,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:36,360 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:41:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:36,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373970528] [2023-11-19 07:41:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373970528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:36,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664916585] [2023-11-19 07:41:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:36,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:36,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:36,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:36,365 INFO L87 Difference]: Start difference. First operand 656 states and 1065 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:41:36,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:36,657 INFO L93 Difference]: Finished difference Result 1187 states and 1923 transitions. [2023-11-19 07:41:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:36,658 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:41:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:36,663 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:36,663 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:36,665 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:41:36,665 INFO L413 NwaCegarLoop]: 950 mSDtfsCounter, 1863 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 1902 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:41:36,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 1902 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:41:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:36,685 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:41:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1064 transitions. [2023-11-19 07:41:36,688 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1064 transitions. Word has length 232 [2023-11-19 07:41:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:36,688 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1064 transitions. [2023-11-19 07:41:36,689 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:41:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1064 transitions. [2023-11-19 07:41:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-11-19 07:41:36,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:36,692 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:41:36,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:41:36,692 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:36,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1091310826, now seen corresponding path program 1 times [2023-11-19 07:41:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:36,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314207479] [2023-11-19 07:41:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:37,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:37,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:37,477 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:41:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314207479] [2023-11-19 07:41:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314207479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:37,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:37,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750890164] [2023-11-19 07:41:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:37,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:37,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:37,480 INFO L87 Difference]: Start difference. First operand 656 states and 1064 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 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:41:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:37,663 INFO L93 Difference]: Finished difference Result 1187 states and 1921 transitions. [2023-11-19 07:41:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 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:41:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:37,668 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:37,669 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:37,670 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:41:37,670 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 912 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1998 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:37,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1998 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:37,689 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:41:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1063 transitions. [2023-11-19 07:41:37,692 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1063 transitions. Word has length 233 [2023-11-19 07:41:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:37,692 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1063 transitions. [2023-11-19 07:41:37,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 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:41:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1063 transitions. [2023-11-19 07:41:37,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-19 07:41:37,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:37,695 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:41:37,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 07:41:37,695 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:37,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2126096180, now seen corresponding path program 1 times [2023-11-19 07:41:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:37,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20520855] [2023-11-19 07:41:37,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:38,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:38,327 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:41:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20520855] [2023-11-19 07:41:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20520855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:38,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:38,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001844530] [2023-11-19 07:41:38,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:38,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:38,330 INFO L87 Difference]: Start difference. First operand 656 states and 1063 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:41:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:38,489 INFO L93 Difference]: Finished difference Result 1189 states and 1921 transitions. [2023-11-19 07:41:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:41:38,489 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:41:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:38,494 INFO L225 Difference]: With dead ends: 1189 [2023-11-19 07:41:38,494 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:38,495 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:41:38,496 INFO L413 NwaCegarLoop]: 1057 mSDtfsCounter, 916 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 3116 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:38,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 3116 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:38,515 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:41:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1062 transitions. [2023-11-19 07:41:38,518 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1062 transitions. Word has length 234 [2023-11-19 07:41:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:38,518 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1062 transitions. [2023-11-19 07:41:38,519 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:41:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1062 transitions. [2023-11-19 07:41:38,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-11-19 07:41:38,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:38,521 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:41:38,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-19 07:41:38,522 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:38,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash 95469040, now seen corresponding path program 1 times [2023-11-19 07:41:38,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:38,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529766564] [2023-11-19 07:41:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,046 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:41:39,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:39,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529766564] [2023-11-19 07:41:39,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529766564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:39,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:39,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:39,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521550103] [2023-11-19 07:41:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:39,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:39,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:39,052 INFO L87 Difference]: Start difference. First operand 656 states and 1062 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:41:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:39,245 INFO L93 Difference]: Finished difference Result 1187 states and 1917 transitions. [2023-11-19 07:41:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:39,246 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:41:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:39,251 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:39,251 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:39,252 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:41:39,253 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1048 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 2005 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:39,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 2005 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:39,282 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:41:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1061 transitions. [2023-11-19 07:41:39,292 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1061 transitions. Word has length 235 [2023-11-19 07:41:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:39,293 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1061 transitions. [2023-11-19 07:41:39,294 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:41:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1061 transitions. [2023-11-19 07:41:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-11-19 07:41:39,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:39,297 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:41:39,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-19 07:41:39,297 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:39,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash 384211060, now seen corresponding path program 1 times [2023-11-19 07:41:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:39,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956275467] [2023-11-19 07:41:39,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:39,870 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:41:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:39,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956275467] [2023-11-19 07:41:39,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956275467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:39,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:39,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538191254] [2023-11-19 07:41:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:39,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:39,874 INFO L87 Difference]: Start difference. First operand 656 states and 1061 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:41:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:40,071 INFO L93 Difference]: Finished difference Result 1187 states and 1915 transitions. [2023-11-19 07:41:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:40,072 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:41:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:40,076 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:40,077 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:40,078 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:41:40,079 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1943 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 1998 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:40,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 1998 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:40,100 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:41:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1060 transitions. [2023-11-19 07:41:40,102 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1060 transitions. Word has length 236 [2023-11-19 07:41:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:40,103 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1060 transitions. [2023-11-19 07:41:40,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:41:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1060 transitions. [2023-11-19 07:41:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-11-19 07:41:40,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:40,106 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:41:40,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-19 07:41:40,107 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:40,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash 240379338, now seen corresponding path program 1 times [2023-11-19 07:41:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:40,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932570551] [2023-11-19 07:41:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:40,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:40,829 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:41:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932570551] [2023-11-19 07:41:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932570551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245486179] [2023-11-19 07:41:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:40,838 INFO L87 Difference]: Start difference. First operand 656 states and 1060 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:41:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:41,027 INFO L93 Difference]: Finished difference Result 1187 states and 1913 transitions. [2023-11-19 07:41:41,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:41,027 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:41:41,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:41,031 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:41,032 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:41,033 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:41:41,033 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1040 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 2005 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:41:41,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 2005 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:41,051 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:41:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1059 transitions. [2023-11-19 07:41:41,053 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1059 transitions. Word has length 237 [2023-11-19 07:41:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:41,054 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1059 transitions. [2023-11-19 07:41:41,054 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:41:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1059 transitions. [2023-11-19 07:41:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-11-19 07:41:41,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:41,056 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:41:41,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-19 07:41:41,057 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:41,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash -245749490, now seen corresponding path program 1 times [2023-11-19 07:41:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:41,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217868802] [2023-11-19 07:41:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:41,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:41,634 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:41:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217868802] [2023-11-19 07:41:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217868802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971543037] [2023-11-19 07:41:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:41,637 INFO L87 Difference]: Start difference. First operand 656 states and 1059 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:41:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:41,816 INFO L93 Difference]: Finished difference Result 1187 states and 1911 transitions. [2023-11-19 07:41:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:41,817 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:41:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:41,821 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:41,821 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:41,822 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:41:41,823 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1927 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 1998 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:41:41,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 1998 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:41,842 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:41:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1058 transitions. [2023-11-19 07:41:41,845 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1058 transitions. Word has length 238 [2023-11-19 07:41:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:41,845 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1058 transitions. [2023-11-19 07:41:41,845 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:41:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1058 transitions. [2023-11-19 07:41:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-11-19 07:41:41,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:41,848 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:41:41,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-19 07:41:41,848 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:41,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1559880356, now seen corresponding path program 1 times [2023-11-19 07:41:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:41,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620847642] [2023-11-19 07:41:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:41,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:42,413 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:41:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:42,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620847642] [2023-11-19 07:41:42,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620847642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:42,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:42,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057121080] [2023-11-19 07:41:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:42,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:42,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:42,417 INFO L87 Difference]: Start difference. First operand 656 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 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:41:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:42,591 INFO L93 Difference]: Finished difference Result 1187 states and 1909 transitions. [2023-11-19 07:41:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 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:41:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:42,596 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:42,596 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:42,597 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:41:42,598 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1032 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2005 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:41:42,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2005 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:42,617 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:41:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1057 transitions. [2023-11-19 07:41:42,619 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1057 transitions. Word has length 239 [2023-11-19 07:41:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:42,620 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1057 transitions. [2023-11-19 07:41:42,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 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:41:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1057 transitions. [2023-11-19 07:41:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-11-19 07:41:42,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:42,622 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:41:42,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-19 07:41:42,623 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:42,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:42,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1784430248, now seen corresponding path program 1 times [2023-11-19 07:41:42,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794289413] [2023-11-19 07:41:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:42,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:43,159 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:41:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794289413] [2023-11-19 07:41:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794289413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574961643] [2023-11-19 07:41:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:43,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:43,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:43,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:43,162 INFO L87 Difference]: Start difference. First operand 656 states and 1057 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:41:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:43,337 INFO L93 Difference]: Finished difference Result 1187 states and 1907 transitions. [2023-11-19 07:41:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:43,338 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:41:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:43,342 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:43,342 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:43,343 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:41:43,344 INFO L413 NwaCegarLoop]: 998 mSDtfsCounter, 1911 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 1998 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:41:43,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 1998 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:41:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:43,361 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:41:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1056 transitions. [2023-11-19 07:41:43,363 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1056 transitions. Word has length 240 [2023-11-19 07:41:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:43,363 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1056 transitions. [2023-11-19 07:41:43,364 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:41:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1056 transitions. [2023-11-19 07:41:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-11-19 07:41:43,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:43,366 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:41:43,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-19 07:41:43,366 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:43,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 897528958, now seen corresponding path program 1 times [2023-11-19 07:41:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177645726] [2023-11-19 07:41:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,149 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:41:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:44,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177645726] [2023-11-19 07:41:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177645726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:44,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:44,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404929743] [2023-11-19 07:41:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:44,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:44,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:44,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:44,152 INFO L87 Difference]: Start difference. First operand 656 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 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:41:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:44,221 INFO L93 Difference]: Finished difference Result 1187 states and 1905 transitions. [2023-11-19 07:41:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:44,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 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:41:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:44,226 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:44,226 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:44,227 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:41:44,228 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 920 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 2078 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:41:44,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 2078 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:41:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:44,246 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:41:44,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1054 transitions. [2023-11-19 07:41:44,248 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1054 transitions. Word has length 241 [2023-11-19 07:41:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:44,249 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1054 transitions. [2023-11-19 07:41:44,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 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:41:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1054 transitions. [2023-11-19 07:41:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-11-19 07:41:44,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:44,252 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:41:44,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-19 07:41:44,252 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:44,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -623927348, now seen corresponding path program 1 times [2023-11-19 07:41:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565950310] [2023-11-19 07:41:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:44,970 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:41:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565950310] [2023-11-19 07:41:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565950310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:44,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:41:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373022753] [2023-11-19 07:41:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:41:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:44,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:41:44,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:41:44,973 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:41:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:45,046 INFO L93 Difference]: Finished difference Result 1187 states and 1901 transitions. [2023-11-19 07:41:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:45,047 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:41:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:45,051 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:45,051 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:45,052 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:41:45,053 INFO L413 NwaCegarLoop]: 1038 mSDtfsCounter, 1957 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:41:45,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 2078 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:41:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:45,069 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:41:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1053 transitions. [2023-11-19 07:41:45,071 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1053 transitions. Word has length 242 [2023-11-19 07:41:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:45,072 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1053 transitions. [2023-11-19 07:41:45,072 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:41:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1053 transitions. [2023-11-19 07:41:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-11-19 07:41:45,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:45,074 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:41:45,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-19 07:41:45,075 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:45,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2121026982, now seen corresponding path program 1 times [2023-11-19 07:41:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958458584] [2023-11-19 07:41:45,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-19 07:41:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-19 07:41:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:45,826 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:41:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958458584] [2023-11-19 07:41:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958458584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:45,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:45,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979639908] [2023-11-19 07:41:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:45,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:45,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:45,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:45,830 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:41:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:45,894 INFO L93 Difference]: Finished difference Result 1187 states and 1899 transitions. [2023-11-19 07:41:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:45,894 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:41:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:45,898 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:45,898 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:45,900 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:41:45,901 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:41:45,901 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:41:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:45,919 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:41:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1052 transitions. [2023-11-19 07:41:45,922 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1052 transitions. Word has length 243 [2023-11-19 07:41:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:45,922 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1052 transitions. [2023-11-19 07:41:45,922 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:41:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1052 transitions. [2023-11-19 07:41:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-19 07:41:45,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:45,924 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:41:45,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-19 07:41:45,925 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:45,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:45,925 INFO L85 PathProgramCache]: Analyzing trace with hash -864680608, now seen corresponding path program 1 times [2023-11-19 07:41:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:45,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458084911] [2023-11-19 07:41:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-19 07:41:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-19 07:41:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-19 07:41:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:41:46,636 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:41:46,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:41:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458084911] [2023-11-19 07:41:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458084911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:41:46,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:41:46,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:41:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034411720] [2023-11-19 07:41:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:41:46,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:41:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:41:46,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:41:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:41:46,639 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:41:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:41:47,085 INFO L93 Difference]: Finished difference Result 1187 states and 1897 transitions. [2023-11-19 07:41:47,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:41:47,085 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:41:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:41:47,089 INFO L225 Difference]: With dead ends: 1187 [2023-11-19 07:41:47,089 INFO L226 Difference]: Without dead ends: 656 [2023-11-19 07:41:47,090 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:41:47,091 INFO L413 NwaCegarLoop]: 828 mSDtfsCounter, 917 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:41:47,091 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:41:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-19 07:41:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2023-11-19 07:41:47,110 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:41:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1050 transitions. [2023-11-19 07:41:47,112 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1050 transitions. Word has length 244 [2023-11-19 07:41:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:41:47,113 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1050 transitions. [2023-11-19 07:41:47,113 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:41:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1050 transitions. [2023-11-19 07:41:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-11-19 07:41:47,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:41:47,115 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:41:47,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-19 07:41:47,116 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:41:47,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:41:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1038016566, now seen corresponding path program 1 times [2023-11-19 07:41:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:41:47,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399815440] [2023-11-19 07:41:47,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:41:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:41:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat