./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.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_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/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_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/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_bad75bcf-1e2f-4ec0-afd0-5a900717e058/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 d1b834b0c672fe89129f134ed175bc47986b842eb441fdde200e666204d40818 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:23:40,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:23:40,424 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:23:40,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:23:40,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:23:40,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:23:40,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:23:40,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:23:40,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:23:40,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:23:40,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:23:40,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:23:40,483 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:23:40,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:23:40,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:23:40,488 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:23:40,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:23:40,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:23:40,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:23:40,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:23:40,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:23:40,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:23:40,496 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:23:40,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:23:40,497 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:23:40,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:23:40,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:23:40,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:23:40,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:23:40,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:23:40,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:23:40,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:23:40,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:23:40,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:23:40,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:23:40,502 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:23:40,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:23:40,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:23:40,502 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:23:40,503 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_bad75bcf-1e2f-4ec0-afd0-5a900717e058/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_bad75bcf-1e2f-4ec0-afd0-5a900717e058/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 -> d1b834b0c672fe89129f134ed175bc47986b842eb441fdde200e666204d40818 [2023-11-12 02:23:40,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:23:40,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:23:40,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:23:40,844 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:23:40,845 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:23:40,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i [2023-11-12 02:23:44,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:23:44,375 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:23:44,377 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i [2023-11-12 02:23:44,389 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/data/f4313007f/101db998e5644cd48a26197585645c1f/FLAG69d9dd6e7 [2023-11-12 02:23:44,407 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/data/f4313007f/101db998e5644cd48a26197585645c1f [2023-11-12 02:23:44,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:23:44,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:23:44,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:23:44,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:23:44,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:23:44,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b070d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44, skipping insertion in model container [2023-11-12 02:23:44,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,456 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:23:44,599 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_bad75bcf-1e2f-4ec0-afd0-5a900717e058/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i[916,929] [2023-11-12 02:23:44,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:23:44,670 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:23:44,684 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_bad75bcf-1e2f-4ec0-afd0-5a900717e058/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-23.i[916,929] [2023-11-12 02:23:44,746 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:23:44,780 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:23:44,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44 WrapperNode [2023-11-12 02:23:44,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:23:44,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:23:44,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:23:44,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:23:44,790 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:23:44" (1/1) ... [2023-11-12 02:23:44,814 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:23:44" (1/1) ... [2023-11-12 02:23:44,899 INFO L138 Inliner]: procedures = 29, calls = 194, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 531 [2023-11-12 02:23:44,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:23:44,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:23:44,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:23:44,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:23:44,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:44,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:23:45,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:23:45,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:23:45,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:23:45,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (1/1) ... [2023-11-12 02:23:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:23:45,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:23:45,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/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:23:45,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bad75bcf-1e2f-4ec0-afd0-5a900717e058/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:23:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:23:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:23:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:23:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:23:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:23:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:23:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:23:45,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:23:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:23:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:23:45,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:23:45,278 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:23:45,280 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:23:45,919 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:23:45,928 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:23:45,928 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:23:45,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:23:45 BoogieIcfgContainer [2023-11-12 02:23:45,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:23:45,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:23:45,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:23:45,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:23:45,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:23:44" (1/3) ... [2023-11-12 02:23:45,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4090395f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:23:45, skipping insertion in model container [2023-11-12 02:23:45,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:23:44" (2/3) ... [2023-11-12 02:23:45,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4090395f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:23:45, skipping insertion in model container [2023-11-12 02:23:45,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:23:45" (3/3) ... [2023-11-12 02:23:45,941 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-23.i [2023-11-12 02:23:45,959 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:23:45,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:23:46,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:23:46,020 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;@1722dbc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:23:46,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:23:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 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:23:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-12 02:23:46,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:46,045 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:46,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:46,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1279411170, now seen corresponding path program 1 times [2023-11-12 02:23:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:46,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278575715] [2023-11-12 02:23:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:46,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:23:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:23:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:23:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:23:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:23:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:23:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:23:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:23:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:23:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:23:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:46,621 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:23:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278575715] [2023-11-12 02:23:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278575715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:46,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:23:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314260327] [2023-11-12 02:23:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:46,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:23:46,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:23:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:23:46,667 INFO L87 Difference]: Start difference. First operand has 124 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 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 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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:23:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:46,707 INFO L93 Difference]: Finished difference Result 241 states and 380 transitions. [2023-11-12 02:23:46,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:23:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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 165 [2023-11-12 02:23:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:46,719 INFO L225 Difference]: With dead ends: 241 [2023-11-12 02:23:46,720 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 02:23:46,724 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:23:46,728 INFO L413 NwaCegarLoop]: 176 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, 176 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:23:46,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 02:23:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-12 02:23:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 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:23:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2023-11-12 02:23:46,785 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2023-11-12 02:23:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:46,786 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2023-11-12 02:23:46,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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:23:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2023-11-12 02:23:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-12 02:23:46,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:46,792 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:46,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:23:46,793 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:46,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1334114070, now seen corresponding path program 1 times [2023-11-12 02:23:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:46,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513416132] [2023-11-12 02:23:46,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:46,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:23:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:23:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:23:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:23:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:23:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:23:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:23:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:23:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:23:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:23:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:47,421 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:23:47,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:47,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513416132] [2023-11-12 02:23:47,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513416132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:47,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:47,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:23:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668706940] [2023-11-12 02:23:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:47,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:23:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:47,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:23:47,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:23:47,429 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:23:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:47,546 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2023-11-12 02:23:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:23:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 165 [2023-11-12 02:23:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:47,554 INFO L225 Difference]: With dead ends: 243 [2023-11-12 02:23:47,555 INFO L226 Difference]: Without dead ends: 126 [2023-11-12 02:23:47,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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:23:47,560 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 10 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:47,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 516 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:23:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-12 02:23:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-11-12 02:23:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 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:23:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2023-11-12 02:23:47,592 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2023-11-12 02:23:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:47,595 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2023-11-12 02:23:47,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:23:47,595 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2023-11-12 02:23:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-12 02:23:47,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:47,608 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:47,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:23:47,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:47,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 699279976, now seen corresponding path program 1 times [2023-11-12 02:23:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:47,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463791104] [2023-11-12 02:23:47,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:23:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:23:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:50,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:23:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:23:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:23:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:23:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:23:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:23:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:23:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:23:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:51,147 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:23:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463791104] [2023-11-12 02:23:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463791104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:51,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:51,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:23:51,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708709458] [2023-11-12 02:23:51,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:51,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:23:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:23:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:23:51,155 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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:23:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:52,367 INFO L93 Difference]: Finished difference Result 311 states and 456 transitions. [2023-11-12 02:23:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:23:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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 165 [2023-11-12 02:23:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:52,371 INFO L225 Difference]: With dead ends: 311 [2023-11-12 02:23:52,371 INFO L226 Difference]: Without dead ends: 192 [2023-11-12 02:23:52,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2023-11-12 02:23:52,374 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 351 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:52,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1034 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 02:23:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-12 02:23:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2023-11-12 02:23:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.4) internal successors, (161), 115 states have internal predecessors, (161), 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:23:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2023-11-12 02:23:52,398 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 165 [2023-11-12 02:23:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:52,399 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2023-11-12 02:23:52,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 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:23:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2023-11-12 02:23:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-12 02:23:52,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:52,408 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:52,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:23:52,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:52,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash 112473962, now seen corresponding path program 1 times [2023-11-12 02:23:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:52,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274239708] [2023-11-12 02:23:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:52,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:23:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:23:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:23:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:23:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:23:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:23:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:23:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:23:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:23:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:23:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:55,156 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:23:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274239708] [2023-11-12 02:23:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274239708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:55,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:23:55,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107025925] [2023-11-12 02:23:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:55,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:23:55,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:55,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:23:55,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:23:55,160 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:23:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:56,149 INFO L93 Difference]: Finished difference Result 326 states and 478 transitions. [2023-11-12 02:23:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:23:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 165 [2023-11-12 02:23:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:56,155 INFO L225 Difference]: With dead ends: 326 [2023-11-12 02:23:56,156 INFO L226 Difference]: Without dead ends: 192 [2023-11-12 02:23:56,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:23:56,162 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 341 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:56,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 565 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:23:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-12 02:23:56,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2023-11-12 02:23:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 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:23:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2023-11-12 02:23:56,203 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 165 [2023-11-12 02:23:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:56,205 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2023-11-12 02:23:56,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:23:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2023-11-12 02:23:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-12 02:23:56,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:56,208 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:56,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:23:56,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:56,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash 565266470, now seen corresponding path program 1 times [2023-11-12 02:23:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:56,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87143310] [2023-11-12 02:23:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:23:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:23:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:23:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:23:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:23:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:23:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:23:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:23:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:23:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:23:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:23:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:23:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:23:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:23:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:23:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:23:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:23:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:23:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:23:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:23:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:23:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:23:58,876 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:23:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:23:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87143310] [2023-11-12 02:23:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87143310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:23:58,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:23:58,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:23:58,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782435473] [2023-11-12 02:23:58,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:23:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:23:58,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:23:58,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:23:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:23:58,880 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:23:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:23:59,799 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2023-11-12 02:23:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:23:59,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 165 [2023-11-12 02:23:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:23:59,803 INFO L225 Difference]: With dead ends: 315 [2023-11-12 02:23:59,803 INFO L226 Difference]: Without dead ends: 181 [2023-11-12 02:23:59,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:23:59,807 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 408 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:23:59,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 519 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:23:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-12 02:23:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2023-11-12 02:23:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 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:23:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2023-11-12 02:23:59,842 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2023-11-12 02:23:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:23:59,842 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2023-11-12 02:23:59,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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:23:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2023-11-12 02:23:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-11-12 02:23:59,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:23:59,847 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, 1, 1, 1, 1, 1, 1] [2023-11-12 02:23:59,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:23:59,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:23:59,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:23:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash -21539544, now seen corresponding path program 1 times [2023-11-12 02:23:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:23:59,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949759615] [2023-11-12 02:23:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:23:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:01,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:24:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:24:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:24:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:24:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:24:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:24:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:24:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:02,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:24:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949759615] [2023-11-12 02:24:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949759615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:02,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:02,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:24:02,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83133127] [2023-11-12 02:24:02,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:02,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:24:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:24:02,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:24:02,136 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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:24:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:03,071 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2023-11-12 02:24:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:24:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 165 [2023-11-12 02:24:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:03,075 INFO L225 Difference]: With dead ends: 326 [2023-11-12 02:24:03,075 INFO L226 Difference]: Without dead ends: 181 [2023-11-12 02:24:03,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-11-12 02:24:03,077 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 299 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:03,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1008 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:24:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-12 02:24:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2023-11-12 02:24:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 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:24:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2023-11-12 02:24:03,106 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2023-11-12 02:24:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:03,107 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2023-11-12 02:24:03,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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:24:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2023-11-12 02:24:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-12 02:24:03,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:03,112 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:03,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:24:03,113 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:03,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -575774022, now seen corresponding path program 1 times [2023-11-12 02:24:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419654403] [2023-11-12 02:24:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:24:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:24:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:24:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:24:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:24:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:24:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:24:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:03,480 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:24:03,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:03,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419654403] [2023-11-12 02:24:03,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419654403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:03,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:03,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:24:03,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733322696] [2023-11-12 02:24:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:03,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:24:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:24:03,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:24:03,484 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:24:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:03,551 INFO L93 Difference]: Finished difference Result 312 states and 459 transitions. [2023-11-12 02:24:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:24:03,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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 167 [2023-11-12 02:24:03,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:03,555 INFO L225 Difference]: With dead ends: 312 [2023-11-12 02:24:03,555 INFO L226 Difference]: Without dead ends: 167 [2023-11-12 02:24:03,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:24:03,558 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 61 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:03,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 711 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:24:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-12 02:24:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2023-11-12 02:24:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 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:24:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2023-11-12 02:24:03,582 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2023-11-12 02:24:03,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:03,583 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2023-11-12 02:24:03,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:24:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2023-11-12 02:24:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-12 02:24:03,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:03,586 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:03,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:24:03,586 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:03,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1938987293, now seen corresponding path program 1 times [2023-11-12 02:24:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:03,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737129383] [2023-11-12 02:24:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:05,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:05,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:05,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:24:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:24:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:24:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:24:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:24:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:24:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:24:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:06,121 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:24:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737129383] [2023-11-12 02:24:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737129383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:06,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-12 02:24:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706853827] [2023-11-12 02:24:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:06,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 02:24:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:06,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:24:06,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:24:06,125 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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:24:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:07,016 INFO L93 Difference]: Finished difference Result 366 states and 530 transitions. [2023-11-12 02:24:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:24:07,017 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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 167 [2023-11-12 02:24:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:07,019 INFO L225 Difference]: With dead ends: 366 [2023-11-12 02:24:07,019 INFO L226 Difference]: Without dead ends: 218 [2023-11-12 02:24:07,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:24:07,020 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 414 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:07,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 866 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:24:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-12 02:24:07,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2023-11-12 02:24:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 131 states have internal predecessors, (183), 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:24:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2023-11-12 02:24:07,042 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 167 [2023-11-12 02:24:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:07,043 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2023-11-12 02:24:07,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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:24:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2023-11-12 02:24:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-12 02:24:07,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:07,046 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:07,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:24:07,047 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:07,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:07,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1352181279, now seen corresponding path program 1 times [2023-11-12 02:24:07,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:07,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94578715] [2023-11-12 02:24:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:24:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:24:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:24:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:24:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:24:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:24:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:24:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:10,136 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:24:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94578715] [2023-11-12 02:24:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94578715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:10,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:10,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:24:10,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086910676] [2023-11-12 02:24:10,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:10,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:24:10,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:24:10,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:24:10,141 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:24:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:11,048 INFO L93 Difference]: Finished difference Result 366 states and 530 transitions. [2023-11-12 02:24:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:24:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 167 [2023-11-12 02:24:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:11,052 INFO L225 Difference]: With dead ends: 366 [2023-11-12 02:24:11,052 INFO L226 Difference]: Without dead ends: 216 [2023-11-12 02:24:11,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:24:11,054 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 336 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:11,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 580 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:24:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-11-12 02:24:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 151. [2023-11-12 02:24:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 129 states have internal predecessors, (180), 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:24:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2023-11-12 02:24:11,076 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 167 [2023-11-12 02:24:11,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:11,077 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2023-11-12 02:24:11,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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:24:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2023-11-12 02:24:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-12 02:24:11,080 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:11,080 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:11,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:24:11,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:11,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1389290381, now seen corresponding path program 1 times [2023-11-12 02:24:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800770156] [2023-11-12 02:24:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:24:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:24:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:24:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:24:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:24:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:24:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:24:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:13,646 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:24:13,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800770156] [2023-11-12 02:24:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800770156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:13,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:13,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-12 02:24:13,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395330822] [2023-11-12 02:24:13,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 02:24:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:24:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:24:13,649 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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:24:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:14,763 INFO L93 Difference]: Finished difference Result 377 states and 547 transitions. [2023-11-12 02:24:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:24:14,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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 167 [2023-11-12 02:24:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:14,766 INFO L225 Difference]: With dead ends: 377 [2023-11-12 02:24:14,766 INFO L226 Difference]: Without dead ends: 229 [2023-11-12 02:24:14,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2023-11-12 02:24:14,768 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 422 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:14,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 999 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:24:14,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-12 02:24:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 164. [2023-11-12 02:24:14,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.4154929577464788) internal successors, (201), 142 states have internal predecessors, (201), 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:24:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 241 transitions. [2023-11-12 02:24:14,789 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 241 transitions. Word has length 167 [2023-11-12 02:24:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:14,790 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 241 transitions. [2023-11-12 02:24:14,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 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:24:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 241 transitions. [2023-11-12 02:24:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-12 02:24:14,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:14,794 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:14,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:24:14,794 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:14,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 802484367, now seen corresponding path program 1 times [2023-11-12 02:24:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272001245] [2023-11-12 02:24:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:24:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:24:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:24:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:24:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:24:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:24:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:24:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:17,786 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:24:17,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:17,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272001245] [2023-11-12 02:24:17,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272001245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:17,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:17,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:24:17,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110098571] [2023-11-12 02:24:17,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:17,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:24:17,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:17,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:24:17,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:24:17,789 INFO L87 Difference]: Start difference. First operand 164 states and 241 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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:24:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:18,572 INFO L93 Difference]: Finished difference Result 390 states and 567 transitions. [2023-11-12 02:24:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:24:18,573 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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 167 [2023-11-12 02:24:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:18,576 INFO L225 Difference]: With dead ends: 390 [2023-11-12 02:24:18,576 INFO L226 Difference]: Without dead ends: 229 [2023-11-12 02:24:18,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:24:18,577 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 304 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:18,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 498 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:24:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-12 02:24:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 162. [2023-11-12 02:24:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.4142857142857144) internal successors, (198), 140 states have internal predecessors, (198), 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:24:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2023-11-12 02:24:18,600 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 167 [2023-11-12 02:24:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:18,601 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2023-11-12 02:24:18,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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:24:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2023-11-12 02:24:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-12 02:24:18,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:18,604 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:18,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:24:18,605 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:18,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2001026907, now seen corresponding path program 1 times [2023-11-12 02:24:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:18,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104203718] [2023-11-12 02:24:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:18,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:24:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:24:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:24:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:24:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:24:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:24:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:24:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:24:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:24:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-12 02:24:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-12 02:24:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-12 02:24:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-12 02:24:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-12 02:24:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-12 02:24:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-12 02:24:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-12 02:24:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-12 02:24:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-12 02:24:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-12 02:24:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:24:21,375 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:24:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:24:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104203718] [2023-11-12 02:24:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104203718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:24:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:24:21,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:24:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236531496] [2023-11-12 02:24:21,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:24:21,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:24:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:24:21,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:24:21,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:24:21,379 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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:24:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:24:22,306 INFO L93 Difference]: Finished difference Result 359 states and 524 transitions. [2023-11-12 02:24:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:24:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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 167 [2023-11-12 02:24:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:24:22,310 INFO L225 Difference]: With dead ends: 359 [2023-11-12 02:24:22,310 INFO L226 Difference]: Without dead ends: 200 [2023-11-12 02:24:22,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:24:22,311 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 403 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:24:22,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 547 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:24:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-12 02:24:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2023-11-12 02:24:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.408450704225352) internal successors, (200), 142 states have internal predecessors, (200), 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:24:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2023-11-12 02:24:22,331 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 240 transitions. Word has length 167 [2023-11-12 02:24:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:24:22,332 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 240 transitions. [2023-11-12 02:24:22,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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:24:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 240 transitions. [2023-11-12 02:24:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-11-12 02:24:22,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:24:22,336 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:24:22,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:24:22,336 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:24:22,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:24:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1414220893, now seen corresponding path program 1 times [2023-11-12 02:24:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:24:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124998035] [2023-11-12 02:24:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:24:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:24:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat