./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e77bebacf9cc027e4e188a98d7f434947d60e1a94e9441a91471f1ac89fe261 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:15:33,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:15:33,196 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:15:33,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:15:33,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:15:33,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:15:33,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:15:33,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:15:33,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:15:33,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:15:33,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:15:33,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:15:33,253 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:15:33,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:15:33,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:15:33,255 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:15:33,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:15:33,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:15:33,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:15:33,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:15:33,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:15:33,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:15:33,259 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:15:33,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:15:33,260 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:15:33,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:15:33,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:15:33,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:15:33,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:15:33,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:15:33,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:15:33,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:15:33,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:15:33,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:15:33,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:15:33,265 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:15:33,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:15:33,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:15:33,266 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:15:33,266 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_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/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_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e77bebacf9cc027e4e188a98d7f434947d60e1a94e9441a91471f1ac89fe261 [2023-11-12 02:15:33,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:15:33,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:15:33,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:15:33,628 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:15:33,632 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:15:33,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i [2023-11-12 02:15:36,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:15:36,968 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:15:36,968 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i [2023-11-12 02:15:36,977 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/data/f9d65bc91/a90b6e41dbd4442a93ac81ee87d24e20/FLAGc9f5479b8 [2023-11-12 02:15:36,992 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/data/f9d65bc91/a90b6e41dbd4442a93ac81ee87d24e20 [2023-11-12 02:15:36,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:15:36,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:15:36,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:15:36,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:15:37,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:15:37,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:36" (1/1) ... [2023-11-12 02:15:37,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e5adf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37, skipping insertion in model container [2023-11-12 02:15:37,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:15:36" (1/1) ... [2023-11-12 02:15:37,047 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:15:37,187 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_0dee5919-e0ad-44b1-8df8-05a755cc7204/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i[916,929] [2023-11-12 02:15:37,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:15:37,254 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:15:37,268 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_0dee5919-e0ad-44b1-8df8-05a755cc7204/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i[916,929] [2023-11-12 02:15:37,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:15:37,348 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:15:37,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37 WrapperNode [2023-11-12 02:15:37,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:15:37,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:15:37,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:15:37,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:15:37,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,425 INFO L138 Inliner]: procedures = 26, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2023-11-12 02:15:37,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:15:37,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:15:37,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:15:37,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:15:37,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:15:37,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:15:37,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:15:37,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:15:37,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (1/1) ... [2023-11-12 02:15:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:15:37,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:15:37,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:15:37,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:15:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:15:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:15:37,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:15:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:15:37,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:15:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:15:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:15:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:15:37,789 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:15:37,792 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:15:38,372 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:15:38,380 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:15:38,380 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:15:38,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:38 BoogieIcfgContainer [2023-11-12 02:15:38,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:15:38,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:15:38,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:15:38,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:15:38,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:15:36" (1/3) ... [2023-11-12 02:15:38,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e9239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:38, skipping insertion in model container [2023-11-12 02:15:38,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:15:37" (2/3) ... [2023-11-12 02:15:38,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e9239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:15:38, skipping insertion in model container [2023-11-12 02:15:38,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:15:38" (3/3) ... [2023-11-12 02:15:38,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-90.i [2023-11-12 02:15:38,414 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:15:38,414 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:15:38,489 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:15:38,497 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;@259413f7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:15:38,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:15:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:15:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-12 02:15:38,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:38,525 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:38,525 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:38,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash -28564899, now seen corresponding path program 1 times [2023-11-12 02:15:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561457410] [2023-11-12 02:15:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:39,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561457410] [2023-11-12 02:15:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561457410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:39,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:39,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:15:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134127236] [2023-11-12 02:15:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:39,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:15:39,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:15:39,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:15:39,142 INFO L87 Difference]: Start difference. First operand has 111 states, 88 states have (on average 1.375) internal successors, (121), 89 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:15:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:39,198 INFO L93 Difference]: Finished difference Result 215 states and 336 transitions. [2023-11-12 02:15:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:15:39,200 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 153 [2023-11-12 02:15:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:39,211 INFO L225 Difference]: With dead ends: 215 [2023-11-12 02:15:39,211 INFO L226 Difference]: Without dead ends: 107 [2023-11-12 02:15:39,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-12 02:15:39,221 INFO L413 NwaCegarLoop]: 154 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, 154 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-12 02:15:39,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:15:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-12 02:15:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-12 02:15:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:15:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2023-11-12 02:15:39,298 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 153 [2023-11-12 02:15:39,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:39,299 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2023-11-12 02:15:39,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:15:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2023-11-12 02:15:39,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-12 02:15:39,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:39,303 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:39,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:15:39,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:39,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:39,304 INFO L85 PathProgramCache]: Analyzing trace with hash 856508981, now seen corresponding path program 1 times [2023-11-12 02:15:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010303915] [2023-11-12 02:15:39,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:39,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010303915] [2023-11-12 02:15:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010303915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:39,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:15:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105668403] [2023-11-12 02:15:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:39,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:39,981 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:40,097 INFO L93 Difference]: Finished difference Result 239 states and 347 transitions. [2023-11-12 02:15:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:15:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-12 02:15:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:40,103 INFO L225 Difference]: With dead ends: 239 [2023-11-12 02:15:40,104 INFO L226 Difference]: Without dead ends: 135 [2023-11-12 02:15:40,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:15:40,110 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 61 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:40,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 490 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:15:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-12 02:15:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 109. [2023-11-12 02:15:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:15:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2023-11-12 02:15:40,133 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2023-11-12 02:15:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:40,137 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2023-11-12 02:15:40,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2023-11-12 02:15:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-12 02:15:40,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:40,149 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:40,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:15:40,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:40,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1758725136, now seen corresponding path program 1 times [2023-11-12 02:15:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942467306] [2023-11-12 02:15:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942467306] [2023-11-12 02:15:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942467306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:15:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842809182] [2023-11-12 02:15:40,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:40,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:15:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:15:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:15:40,887 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:41,329 INFO L93 Difference]: Finished difference Result 323 states and 464 transitions. [2023-11-12 02:15:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:15:41,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-11-12 02:15:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:41,332 INFO L225 Difference]: With dead ends: 323 [2023-11-12 02:15:41,333 INFO L226 Difference]: Without dead ends: 217 [2023-11-12 02:15:41,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:15:41,335 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 129 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:41,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 753 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:15:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-12 02:15:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 114. [2023-11-12 02:15:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:15:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2023-11-12 02:15:41,351 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 155 [2023-11-12 02:15:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:41,352 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2023-11-12 02:15:41,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2023-11-12 02:15:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-12 02:15:41,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:41,355 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:41,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:15:41,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:41,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1539870418, now seen corresponding path program 1 times [2023-11-12 02:15:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:41,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95305482] [2023-11-12 02:15:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:42,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:42,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95305482] [2023-11-12 02:15:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95305482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:42,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:42,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:15:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892003730] [2023-11-12 02:15:42,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:42,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:15:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:15:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:15:42,135 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:42,752 INFO L93 Difference]: Finished difference Result 322 states and 460 transitions. [2023-11-12 02:15:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:15:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-11-12 02:15:42,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:42,755 INFO L225 Difference]: With dead ends: 322 [2023-11-12 02:15:42,756 INFO L226 Difference]: Without dead ends: 211 [2023-11-12 02:15:42,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:15:42,758 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 292 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:42,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 247 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:15:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-12 02:15:42,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 116. [2023-11-12 02:15:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:15:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2023-11-12 02:15:42,776 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 155 [2023-11-12 02:15:42,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:42,777 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2023-11-12 02:15:42,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2023-11-12 02:15:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-12 02:15:42,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:42,780 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:42,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:15:42,780 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:42,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1839204390, now seen corresponding path program 1 times [2023-11-12 02:15:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:42,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547124896] [2023-11-12 02:15:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:44,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547124896] [2023-11-12 02:15:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547124896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:15:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019081007] [2023-11-12 02:15:44,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:44,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:15:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:15:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:15:44,454 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:45,002 INFO L93 Difference]: Finished difference Result 364 states and 518 transitions. [2023-11-12 02:15:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:15:45,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2023-11-12 02:15:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:45,005 INFO L225 Difference]: With dead ends: 364 [2023-11-12 02:15:45,005 INFO L226 Difference]: Without dead ends: 251 [2023-11-12 02:15:45,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:15:45,007 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 175 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:45,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 601 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 02:15:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-12 02:15:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 150. [2023-11-12 02:15:45,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.34375) internal successors, (172), 128 states have internal predecessors, (172), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:15:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 212 transitions. [2023-11-12 02:15:45,025 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 212 transitions. Word has length 156 [2023-11-12 02:15:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:45,026 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 212 transitions. [2023-11-12 02:15:45,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 212 transitions. [2023-11-12 02:15:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-12 02:15:45,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:45,030 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:45,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:15:45,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:45,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1868956892, now seen corresponding path program 1 times [2023-11-12 02:15:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:45,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807035122] [2023-11-12 02:15:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:46,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:46,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807035122] [2023-11-12 02:15:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807035122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:46,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:15:46,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32148522] [2023-11-12 02:15:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:46,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:15:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:46,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:15:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:15:46,762 INFO L87 Difference]: Start difference. First operand 150 states and 212 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:15:47,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:47,147 INFO L93 Difference]: Finished difference Result 321 states and 453 transitions. [2023-11-12 02:15:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:15:47,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2023-11-12 02:15:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:47,150 INFO L225 Difference]: With dead ends: 321 [2023-11-12 02:15:47,150 INFO L226 Difference]: Without dead ends: 174 [2023-11-12 02:15:47,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:15:47,152 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 181 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:47,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 487 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:15:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-12 02:15:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2023-11-12 02:15:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.328358208955224) internal successors, (178), 134 states have internal predecessors, (178), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-12 02:15:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 218 transitions. [2023-11-12 02:15:47,168 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 218 transitions. Word has length 156 [2023-11-12 02:15:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:47,168 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 218 transitions. [2023-11-12 02:15:47,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:15:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 218 transitions. [2023-11-12 02:15:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-12 02:15:47,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:47,171 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:47,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:15:47,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:47,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:47,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1149188459, now seen corresponding path program 1 times [2023-11-12 02:15:47,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983422905] [2023-11-12 02:15:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983422905] [2023-11-12 02:15:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983422905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:51,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:51,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-12 02:15:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831979545] [2023-11-12 02:15:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:51,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 02:15:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:51,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 02:15:51,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:15:51,644 INFO L87 Difference]: Start difference. First operand 157 states and 218 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:15:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:55,436 INFO L93 Difference]: Finished difference Result 764 states and 1061 transitions. [2023-11-12 02:15:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-12 02:15:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2023-11-12 02:15:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:55,444 INFO L225 Difference]: With dead ends: 764 [2023-11-12 02:15:55,444 INFO L226 Difference]: Without dead ends: 610 [2023-11-12 02:15:55,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2023-11-12 02:15:55,447 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1281 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:55,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1561 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-12 02:15:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2023-11-12 02:15:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 292. [2023-11-12 02:15:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 244 states have internal predecessors, (317), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:15:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 401 transitions. [2023-11-12 02:15:55,490 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 401 transitions. Word has length 157 [2023-11-12 02:15:55,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:55,491 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 401 transitions. [2023-11-12 02:15:55,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:15:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 401 transitions. [2023-11-12 02:15:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-12 02:15:55,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:55,495 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:55,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:15:55,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:55,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash 138071209, now seen corresponding path program 1 times [2023-11-12 02:15:55,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:55,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22677673] [2023-11-12 02:15:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:57,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:57,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22677673] [2023-11-12 02:15:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22677673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:57,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:57,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:15:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686879417] [2023-11-12 02:15:57,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:57,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:15:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:57,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:15:57,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:15:57,423 INFO L87 Difference]: Start difference. First operand 292 states and 401 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:15:57,894 INFO L93 Difference]: Finished difference Result 732 states and 1011 transitions. [2023-11-12 02:15:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:15:57,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-12 02:15:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:15:57,902 INFO L225 Difference]: With dead ends: 732 [2023-11-12 02:15:57,902 INFO L226 Difference]: Without dead ends: 533 [2023-11-12 02:15:57,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:15:57,904 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 151 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:15:57,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 685 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:15:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2023-11-12 02:15:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 306. [2023-11-12 02:15:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 257 states have (on average 1.2996108949416343) internal successors, (334), 258 states have internal predecessors, (334), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:15:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 418 transitions. [2023-11-12 02:15:57,952 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 418 transitions. Word has length 157 [2023-11-12 02:15:57,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:15:57,958 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 418 transitions. [2023-11-12 02:15:57,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:15:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 418 transitions. [2023-11-12 02:15:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-12 02:15:57,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:15:57,961 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:57,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:15:57,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:15:57,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:57,962 INFO L85 PathProgramCache]: Analyzing trace with hash -844956247, now seen corresponding path program 1 times [2023-11-12 02:15:57,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:57,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142241797] [2023-11-12 02:15:57,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:57,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:15:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:15:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:15:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:15:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:15:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:15:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:15:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:15:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:15:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:15:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:15:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:15:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:15:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:15:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:15:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:15:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:15:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:15:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:15:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:15:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:15:59,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142241797] [2023-11-12 02:15:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142241797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:59,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:15:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523210969] [2023-11-12 02:15:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:59,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:15:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:15:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:15:59,664 INFO L87 Difference]: Start difference. First operand 306 states and 418 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:00,136 INFO L93 Difference]: Finished difference Result 679 states and 930 transitions. [2023-11-12 02:16:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-12 02:16:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:00,141 INFO L225 Difference]: With dead ends: 679 [2023-11-12 02:16:00,142 INFO L226 Difference]: Without dead ends: 464 [2023-11-12 02:16:00,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:16:00,144 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 135 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:00,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 632 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:16:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-11-12 02:16:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 296. [2023-11-12 02:16:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 247 states have (on average 1.2874493927125505) internal successors, (318), 248 states have internal predecessors, (318), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-12 02:16:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 402 transitions. [2023-11-12 02:16:00,196 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 402 transitions. Word has length 157 [2023-11-12 02:16:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:00,196 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 402 transitions. [2023-11-12 02:16:00,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 402 transitions. [2023-11-12 02:16:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-12 02:16:00,199 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:00,199 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:00,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:16:00,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:00,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1856073497, now seen corresponding path program 1 times [2023-11-12 02:16:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663764788] [2023-11-12 02:16:00,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:00,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:16:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:16:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:16:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:16:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:16:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:16:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:16:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:16:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:16:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:16:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:16:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:16:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:16:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:16:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:16:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:16:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:16:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:16:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:16:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:16:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-11-12 02:16:01,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:01,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663764788] [2023-11-12 02:16:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663764788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720529089] [2023-11-12 02:16:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:01,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:16:01,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:16:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:02,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 02:16:02,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:02,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2023-11-12 02:16:02,424 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:16:02,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 32 [2023-11-12 02:16:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-12 02:16:02,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:16:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:16:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720529089] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:02,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:16:02,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 19 [2023-11-12 02:16:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473272459] [2023-11-12 02:16:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:02,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:16:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:16:02,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:16:02,958 INFO L87 Difference]: Start difference. First operand 296 states and 402 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:04,197 INFO L93 Difference]: Finished difference Result 637 states and 868 transitions. [2023-11-12 02:16:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:16:04,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-12 02:16:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:04,202 INFO L225 Difference]: With dead ends: 637 [2023-11-12 02:16:04,202 INFO L226 Difference]: Without dead ends: 428 [2023-11-12 02:16:04,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 349 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:16:04,204 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 213 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:04,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1156 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:16:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-11-12 02:16:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 357. [2023-11-12 02:16:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 300 states have (on average 1.2866666666666666) internal successors, (386), 302 states have internal predecessors, (386), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-12 02:16:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 482 transitions. [2023-11-12 02:16:04,254 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 482 transitions. Word has length 157 [2023-11-12 02:16:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:04,254 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 482 transitions. [2023-11-12 02:16:04,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 482 transitions. [2023-11-12 02:16:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-12 02:16:04,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:04,258 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:04,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:16:04,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:04,465 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:04,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1850788333, now seen corresponding path program 1 times [2023-11-12 02:16:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785980893] [2023-11-12 02:16:04,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:04,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:16:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:16:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:16:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:16:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:16:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:16:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:16:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:16:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:16:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:16:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:16:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:16:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:16:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:16:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:16:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:16:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:16:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:16:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:16:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:16:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-12 02:16:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785980893] [2023-11-12 02:16:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785980893] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076830063] [2023-11-12 02:16:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:07,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:07,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:16:07,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:16:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:08,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-12 02:16:08,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:08,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-12 02:16:08,580 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:16:08,581 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2023-11-12 02:16:08,711 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:16:08,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 45 [2023-11-12 02:16:08,794 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:16:08,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 48 [2023-11-12 02:16:08,918 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:16:08,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 140 treesize of output 107 [2023-11-12 02:16:09,294 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:16:09,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 149 treesize of output 53 [2023-11-12 02:16:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-12 02:16:09,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:16:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:16:09,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076830063] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-12 02:16:09,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:16:09,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20, 16] total 35 [2023-11-12 02:16:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525771930] [2023-11-12 02:16:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:09,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:16:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:16:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1095, Unknown=0, NotChecked=0, Total=1190 [2023-11-12 02:16:09,891 INFO L87 Difference]: Start difference. First operand 357 states and 482 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:11,033 INFO L93 Difference]: Finished difference Result 742 states and 1005 transitions. [2023-11-12 02:16:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:16:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-12 02:16:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:11,038 INFO L225 Difference]: With dead ends: 742 [2023-11-12 02:16:11,038 INFO L226 Difference]: Without dead ends: 472 [2023-11-12 02:16:11,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=143, Invalid=1579, Unknown=0, NotChecked=0, Total=1722 [2023-11-12 02:16:11,041 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 203 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:11,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1027 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:16:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-11-12 02:16:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 342. [2023-11-12 02:16:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 285 states have (on average 1.2842105263157895) internal successors, (366), 287 states have internal predecessors, (366), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-12 02:16:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 462 transitions. [2023-11-12 02:16:11,084 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 462 transitions. Word has length 157 [2023-11-12 02:16:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:11,085 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 462 transitions. [2023-11-12 02:16:11,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 462 transitions. [2023-11-12 02:16:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:16:11,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:11,088 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:11,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:16:11,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dee5919-e0ad-44b1-8df8-05a755cc7204/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:16:11,295 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:11,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash 594254388, now seen corresponding path program 1 times [2023-11-12 02:16:11,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:11,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024896436] [2023-11-12 02:16:11,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:16:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:16:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:16:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:16:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:16:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:16:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:16:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:16:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:16:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:16:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:16:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:16:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:16:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:16:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:16:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:16:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:16:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:16:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:16:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:16:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:16:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:12,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024896436] [2023-11-12 02:16:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024896436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:16:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267938152] [2023-11-12 02:16:12,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:12,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:16:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:12,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:16:12,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:16:12,292 INFO L87 Difference]: Start difference. First operand 342 states and 462 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:12,648 INFO L93 Difference]: Finished difference Result 855 states and 1162 transitions. [2023-11-12 02:16:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-12 02:16:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:12,653 INFO L225 Difference]: With dead ends: 855 [2023-11-12 02:16:12,653 INFO L226 Difference]: Without dead ends: 589 [2023-11-12 02:16:12,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:16:12,655 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 146 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:12,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 399 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:16:12,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2023-11-12 02:16:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 294. [2023-11-12 02:16:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 248 states have (on average 1.2862903225806452) internal successors, (319), 251 states have internal predecessors, (319), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-12 02:16:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 395 transitions. [2023-11-12 02:16:12,695 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 395 transitions. Word has length 158 [2023-11-12 02:16:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:12,695 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 395 transitions. [2023-11-12 02:16:12,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 395 transitions. [2023-11-12 02:16:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:16:12,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:12,698 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:12,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:16:12,699 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:12,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1874118066, now seen corresponding path program 1 times [2023-11-12 02:16:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081883694] [2023-11-12 02:16:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:16:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:16:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:16:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:16:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:16:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:16:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:16:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:16:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:16:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:16:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:16:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:16:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:16:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:16:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:16:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:16:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:16:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:16:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:16:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:16:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:16:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:13,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081883694] [2023-11-12 02:16:13,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081883694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:13,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:13,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:16:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402763322] [2023-11-12 02:16:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:13,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:16:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:16:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:16:13,141 INFO L87 Difference]: Start difference. First operand 294 states and 395 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:13,510 INFO L93 Difference]: Finished difference Result 696 states and 944 transitions. [2023-11-12 02:16:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:16:13,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-12 02:16:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:13,514 INFO L225 Difference]: With dead ends: 696 [2023-11-12 02:16:13,515 INFO L226 Difference]: Without dead ends: 434 [2023-11-12 02:16:13,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:16:13,516 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 142 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:13,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 540 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:16:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-12 02:16:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 333. [2023-11-12 02:16:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 287 states have (on average 1.2857142857142858) internal successors, (369), 290 states have internal predecessors, (369), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-12 02:16:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 445 transitions. [2023-11-12 02:16:13,551 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 445 transitions. Word has length 158 [2023-11-12 02:16:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:13,551 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 445 transitions. [2023-11-12 02:16:13,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 445 transitions. [2023-11-12 02:16:13,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:16:13,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:13,554 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:13,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:16:13,554 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:13,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 869014002, now seen corresponding path program 1 times [2023-11-12 02:16:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:13,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898520192] [2023-11-12 02:16:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:16:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:16:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:16:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:16:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:16:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:16:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:16:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:16:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:16:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:16:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:16:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:16:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:16:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:16:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:16:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:16:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:16:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:16:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:16:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:16:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:16:13,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898520192] [2023-11-12 02:16:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898520192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:16:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718311455] [2023-11-12 02:16:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:13,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:16:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:16:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:16:13,916 INFO L87 Difference]: Start difference. First operand 333 states and 445 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:14,363 INFO L93 Difference]: Finished difference Result 877 states and 1196 transitions. [2023-11-12 02:16:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:16:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 158 [2023-11-12 02:16:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:14,368 INFO L225 Difference]: With dead ends: 877 [2023-11-12 02:16:14,368 INFO L226 Difference]: Without dead ends: 576 [2023-11-12 02:16:14,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:16:14,370 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 136 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:14,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 648 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:16:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2023-11-12 02:16:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 374. [2023-11-12 02:16:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 328 states have (on average 1.2926829268292683) internal successors, (424), 331 states have internal predecessors, (424), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-12 02:16:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 500 transitions. [2023-11-12 02:16:14,408 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 500 transitions. Word has length 158 [2023-11-12 02:16:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:14,409 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 500 transitions. [2023-11-12 02:16:14,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-12 02:16:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 500 transitions. [2023-11-12 02:16:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:16:14,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:14,412 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:14,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:16:14,412 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:14,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2146089616, now seen corresponding path program 1 times [2023-11-12 02:16:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316152404] [2023-11-12 02:16:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:16:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:16:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:16:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:16:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:16:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:16:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:16:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:16:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:16:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:16:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:16:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:16:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:16:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:16:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:16:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:16:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:16:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:16:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:16:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:16:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:16:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316152404] [2023-11-12 02:16:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316152404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:16:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991843377] [2023-11-12 02:16:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:15,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:16:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:16:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:16:15,585 INFO L87 Difference]: Start difference. First operand 374 states and 500 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:16:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:16,054 INFO L93 Difference]: Finished difference Result 806 states and 1076 transitions. [2023-11-12 02:16:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:16:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 158 [2023-11-12 02:16:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:16:16,059 INFO L225 Difference]: With dead ends: 806 [2023-11-12 02:16:16,059 INFO L226 Difference]: Without dead ends: 464 [2023-11-12 02:16:16,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:16:16,063 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 108 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:16:16,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 680 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:16:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-11-12 02:16:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 302. [2023-11-12 02:16:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 270 states have (on average 1.2851851851851852) internal successors, (347), 271 states have internal predecessors, (347), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-12 02:16:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2023-11-12 02:16:16,098 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 158 [2023-11-12 02:16:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:16:16,098 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2023-11-12 02:16:16,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-12 02:16:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2023-11-12 02:16:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-12 02:16:16,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:16:16,101 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:16,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:16:16,102 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:16:16,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1604632436, now seen corresponding path program 1 times [2023-11-12 02:16:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:16,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168507326] [2023-11-12 02:16:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:16,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:16:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:16:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:16:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:16:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:16:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:16:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:16:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:16:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:16:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:16:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:16:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:16:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:16:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:16:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:16:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:16:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:16:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:16:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:16:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:16:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-12 02:16:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168507326] [2023-11-12 02:16:17,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168507326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:17,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:17,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:16:17,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075581364] [2023-11-12 02:16:17,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:17,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:16:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:17,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:16:17,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:16:17,190 INFO L87 Difference]: Start difference. First operand 302 states and 399 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20)