./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/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_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/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_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:06:35,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:06:35,596 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:06:35,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:06:35,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:06:35,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:06:35,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:06:35,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:06:35,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:06:35,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:06:35,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:06:35,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:06:35,657 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:06:35,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:06:35,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:06:35,660 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:06:35,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:06:35,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:06:35,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:06:35,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:06:35,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:06:35,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:06:35,664 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:06:35,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:06:35,665 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:06:35,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:06:35,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:06:35,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:06:35,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:35,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:06:35,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:06:35,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:06:35,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:06:35,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:06:35,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:06:35,671 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:06:35,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:06:35,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:06:35,672 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:06:35,672 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_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/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_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2023-11-12 02:06:35,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:06:35,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:06:35,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:06:35,995 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:06:35,995 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:06:35,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2023-11-12 02:06:39,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:06:39,381 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:06:39,381 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2023-11-12 02:06:39,392 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/data/8a26a53c5/661684d5e57541e89e4d6a5c6fafc1aa/FLAGc6a055154 [2023-11-12 02:06:39,408 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/data/8a26a53c5/661684d5e57541e89e4d6a5c6fafc1aa [2023-11-12 02:06:39,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:06:39,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:06:39,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:39,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:06:39,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:06:39,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac91979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39, skipping insertion in model container [2023-11-12 02:06:39,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,473 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:06:39,627 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_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i[917,930] [2023-11-12 02:06:39,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:39,723 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:06:39,736 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_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i[917,930] [2023-11-12 02:06:39,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:06:39,818 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:06:39,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39 WrapperNode [2023-11-12 02:06:39,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:06:39,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:39,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:06:39,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:06:39,828 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:06:39" (1/1) ... [2023-11-12 02:06:39,864 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:06:39" (1/1) ... [2023-11-12 02:06:39,921 INFO L138 Inliner]: procedures = 29, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 601 [2023-11-12 02:06:39,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:06:39,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:06:39,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:06:39,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:06:39,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:39,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:40,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:06:40,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:06:40,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:06:40,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:06:40,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (1/1) ... [2023-11-12 02:06:40,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:06:40,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:40,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/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:06:40,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/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:06:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:06:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:06:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:06:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:06:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:06:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:06:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:06:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:06:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:06:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:06:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:06:40,346 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:06:40,348 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:06:41,114 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:06:41,124 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:06:41,124 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:06:41,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:41 BoogieIcfgContainer [2023-11-12 02:06:41,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:06:41,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:06:41,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:06:41,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:06:41,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:06:39" (1/3) ... [2023-11-12 02:06:41,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e63998e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:41, skipping insertion in model container [2023-11-12 02:06:41,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:06:39" (2/3) ... [2023-11-12 02:06:41,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e63998e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:06:41, skipping insertion in model container [2023-11-12 02:06:41,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:06:41" (3/3) ... [2023-11-12 02:06:41,141 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2023-11-12 02:06:41,167 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:06:41,167 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:06:41,253 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:06:41,262 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;@22051c7b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:06:41,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:06:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-12 02:06:41,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:41,296 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:41,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:41,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash 79458764, now seen corresponding path program 1 times [2023-11-12 02:06:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:41,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240177695] [2023-11-12 02:06:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:41,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:06:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240177695] [2023-11-12 02:06:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240177695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:06:41,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045840216] [2023-11-12 02:06:41,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:41,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:06:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:06:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:06:41,954 INFO L87 Difference]: Start difference. First operand has 139 states, 118 states have (on average 1.4322033898305084) internal successors, (169), 119 states have internal predecessors, (169), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:06:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:41,995 INFO L93 Difference]: Finished difference Result 271 states and 422 transitions. [2023-11-12 02:06:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:06:41,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2023-11-12 02:06:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:42,007 INFO L225 Difference]: With dead ends: 271 [2023-11-12 02:06:42,007 INFO L226 Difference]: Without dead ends: 135 [2023-11-12 02:06:42,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:06:42,015 INFO L413 NwaCegarLoop]: 198 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, 198 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:06:42,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:42,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-12 02:06:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-11-12 02:06:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2023-11-12 02:06:42,073 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2023-11-12 02:06:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:42,073 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2023-11-12 02:06:42,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:06:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2023-11-12 02:06:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-12 02:06:42,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:42,079 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:42,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:06:42,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:42,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 509231968, now seen corresponding path program 1 times [2023-11-12 02:06:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022145982] [2023-11-12 02:06:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:42,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:06:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022145982] [2023-11-12 02:06:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022145982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524532424] [2023-11-12 02:06:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:42,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:42,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:42,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:42,662 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:06:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:42,727 INFO L93 Difference]: Finished difference Result 273 states and 402 transitions. [2023-11-12 02:06:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:06:42,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2023-11-12 02:06:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:42,730 INFO L225 Difference]: With dead ends: 273 [2023-11-12 02:06:42,731 INFO L226 Difference]: Without dead ends: 141 [2023-11-12 02:06:42,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:06:42,734 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:42,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 579 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-12 02:06:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2023-11-12 02:06:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2023-11-12 02:06:42,756 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2023-11-12 02:06:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:42,757 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2023-11-12 02:06:42,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:06:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2023-11-12 02:06:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-12 02:06:42,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:42,762 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:42,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:06:42,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:42,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash 145765470, now seen corresponding path program 1 times [2023-11-12 02:06:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974288130] [2023-11-12 02:06:42,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:06:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:43,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974288130] [2023-11-12 02:06:43,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974288130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:43,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:43,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57519149] [2023-11-12 02:06:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:43,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:43,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:43,227 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:43,308 INFO L93 Difference]: Finished difference Result 304 states and 447 transitions. [2023-11-12 02:06:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:06:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2023-11-12 02:06:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:43,320 INFO L225 Difference]: With dead ends: 304 [2023-11-12 02:06:43,320 INFO L226 Difference]: Without dead ends: 170 [2023-11-12 02:06:43,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:06:43,331 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 87 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:43,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 611 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-12 02:06:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 139. [2023-11-12 02:06:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2023-11-12 02:06:43,367 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2023-11-12 02:06:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:43,371 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2023-11-12 02:06:43,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2023-11-12 02:06:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:06:43,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:43,380 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:43,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:06:43,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:43,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1498114201, now seen corresponding path program 1 times [2023-11-12 02:06:43,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:43,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65975709] [2023-11-12 02:06:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:43,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:06:43,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:43,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65975709] [2023-11-12 02:06:43,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65975709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546575314] [2023-11-12 02:06:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:43,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:43,674 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:43,733 INFO L93 Difference]: Finished difference Result 309 states and 452 transitions. [2023-11-12 02:06:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:06:43,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-12 02:06:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:43,736 INFO L225 Difference]: With dead ends: 309 [2023-11-12 02:06:43,737 INFO L226 Difference]: Without dead ends: 173 [2023-11-12 02:06:43,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:06:43,739 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 72 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:43,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 598 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-12 02:06:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 141. [2023-11-12 02:06:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2023-11-12 02:06:43,752 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 158 [2023-11-12 02:06:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:43,753 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2023-11-12 02:06:43,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2023-11-12 02:06:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:06:43,756 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:43,757 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:43,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:06:43,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:43,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash 911308187, now seen corresponding path program 1 times [2023-11-12 02:06:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638778363] [2023-11-12 02:06:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:43,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:43,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:06:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:44,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638778363] [2023-11-12 02:06:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638778363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188620291] [2023-11-12 02:06:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:44,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:44,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:44,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:44,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:44,013 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:44,053 INFO L93 Difference]: Finished difference Result 291 states and 422 transitions. [2023-11-12 02:06:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:06:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-12 02:06:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:44,056 INFO L225 Difference]: With dead ends: 291 [2023-11-12 02:06:44,056 INFO L226 Difference]: Without dead ends: 153 [2023-11-12 02:06:44,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:06:44,058 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 21 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:44,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 581 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-12 02:06:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2023-11-12 02:06:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2023-11-12 02:06:44,068 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 158 [2023-11-12 02:06:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:44,069 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2023-11-12 02:06:44,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2023-11-12 02:06:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:06:44,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:44,072 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:44,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:06:44,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:44,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1591366557, now seen corresponding path program 1 times [2023-11-12 02:06:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118413402] [2023-11-12 02:06:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:44,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:06:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:44,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118413402] [2023-11-12 02:06:44,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118413402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:44,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:44,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:44,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18713428] [2023-11-12 02:06:44,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:44,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:44,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:44,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:44,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:44,368 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:44,415 INFO L93 Difference]: Finished difference Result 291 states and 420 transitions. [2023-11-12 02:06:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:06:44,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-12 02:06:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:44,418 INFO L225 Difference]: With dead ends: 291 [2023-11-12 02:06:44,418 INFO L226 Difference]: Without dead ends: 151 [2023-11-12 02:06:44,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:06:44,420 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 12 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 579 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:06:44,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 579 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-12 02:06:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2023-11-12 02:06:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2023-11-12 02:06:44,435 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 158 [2023-11-12 02:06:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:44,437 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2023-11-12 02:06:44,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2023-11-12 02:06:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:06:44,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:44,440 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:44,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:06:44,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:44,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -928593377, now seen corresponding path program 1 times [2023-11-12 02:06:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871351529] [2023-11-12 02:06:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:06:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:44,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871351529] [2023-11-12 02:06:44,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871351529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:06:44,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:06:44,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:06:44,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022073436] [2023-11-12 02:06:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:06:44,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:06:44,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:06:44,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:06:44,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:06:44,697 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:06:44,728 INFO L93 Difference]: Finished difference Result 291 states and 418 transitions. [2023-11-12 02:06:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:06:44,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2023-11-12 02:06:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:06:44,730 INFO L225 Difference]: With dead ends: 291 [2023-11-12 02:06:44,730 INFO L226 Difference]: Without dead ends: 149 [2023-11-12 02:06:44,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:06:44,732 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 3 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:06:44,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 578 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:06:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-11-12 02:06:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2023-11-12 02:06:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-12 02:06:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2023-11-12 02:06:44,740 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 158 [2023-11-12 02:06:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:06:44,741 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2023-11-12 02:06:44,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:06:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2023-11-12 02:06:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:06:44,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:06:44,744 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:44,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:06:44,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:06:44,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:06:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash -926746335, now seen corresponding path program 1 times [2023-11-12 02:06:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:06:44,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443127489] [2023-11-12 02:06:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:06:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:06:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:06:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:06:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:06:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:06:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:06:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:06:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:06:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:06:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:06:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:06:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:06:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:06:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:06:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:06:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:49,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:06:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:49,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:06:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:06:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-12 02:06:49,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:06:49,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443127489] [2023-11-12 02:06:49,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443127489] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:06:49,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683582055] [2023-11-12 02:06:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:06:49,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:06:49,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:06:49,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:06:49,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:06:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:06:49,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-12 02:06:49,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:06:51,597 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-12 02:06:52,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:06:53,327 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:06:54,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:06:54,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:06:55,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:06:56,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:06:57,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-12 02:06:58,103 INFO L322 Elim1Store]: treesize reduction 264, result has 11.7 percent of original size [2023-11-12 02:06:58,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 472 treesize of output 311 [2023-11-12 02:06:58,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,266 INFO L322 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2023-11-12 02:06:58,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2023-11-12 02:06:58,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,363 INFO L322 Elim1Store]: treesize reduction 13, result has 50.0 percent of original size [2023-11-12 02:06:58,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 47 [2023-11-12 02:06:58,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,636 INFO L322 Elim1Store]: treesize reduction 50, result has 31.5 percent of original size [2023-11-12 02:06:58,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 56 [2023-11-12 02:06:58,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:58,824 INFO L322 Elim1Store]: treesize reduction 54, result has 26.0 percent of original size [2023-11-12 02:06:58,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 52 [2023-11-12 02:06:58,875 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2023-11-12 02:06:58,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:06:59,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2023-11-12 02:06:59,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,109 INFO L322 Elim1Store]: treesize reduction 137, result has 0.7 percent of original size [2023-11-12 02:06:59,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 150 [2023-11-12 02:06:59,182 INFO L322 Elim1Store]: treesize reduction 380, result has 0.3 percent of original size [2023-11-12 02:06:59,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 592 treesize of output 318 [2023-11-12 02:06:59,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 121 [2023-11-12 02:06:59,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,319 INFO L322 Elim1Store]: treesize reduction 220, result has 0.5 percent of original size [2023-11-12 02:06:59,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 206 [2023-11-12 02:06:59,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 02:06:59,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2023-11-12 02:06:59,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 45 [2023-11-12 02:06:59,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2023-11-12 02:06:59,648 INFO L322 Elim1Store]: treesize reduction 280, result has 0.4 percent of original size [2023-11-12 02:06:59,648 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 220 treesize of output 184 [2023-11-12 02:06:59,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 60 [2023-11-12 02:06:59,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2023-11-12 02:06:59,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-11-12 02:06:59,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2023-11-12 02:06:59,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:06:59,860 INFO L322 Elim1Store]: treesize reduction 145, result has 0.7 percent of original size [2023-11-12 02:06:59,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 141 [2023-11-12 02:06:59,886 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 02:07:00,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:07:00,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:07:00,109 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-12 02:07:00,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2023-11-12 02:07:00,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2023-11-12 02:07:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 199 proven. 161 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-11-12 02:07:00,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:07:03,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683582055] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:07:03,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:07:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-11-12 02:07:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955772996] [2023-11-12 02:07:03,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:07:03,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 02:07:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:03,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 02:07:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=395, Unknown=1, NotChecked=0, Total=462 [2023-11-12 02:07:03,825 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2023-11-12 02:07:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:07:08,563 INFO L93 Difference]: Finished difference Result 554 states and 782 transitions. [2023-11-12 02:07:08,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-12 02:07:08,564 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) Word has length 158 [2023-11-12 02:07:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:07:08,568 INFO L225 Difference]: With dead ends: 554 [2023-11-12 02:07:08,568 INFO L226 Difference]: Without dead ends: 410 [2023-11-12 02:07:08,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=465, Invalid=1696, Unknown=1, NotChecked=0, Total=2162 [2023-11-12 02:07:08,571 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1354 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:07:08,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 1045 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-12 02:07:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-12 02:07:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 200. [2023-11-12 02:07:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 175 states have (on average 1.3828571428571428) internal successors, (242), 176 states have internal predecessors, (242), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-12 02:07:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 284 transitions. [2023-11-12 02:07:08,596 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 284 transitions. Word has length 158 [2023-11-12 02:07:08,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:07:08,597 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 284 transitions. [2023-11-12 02:07:08,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.555555555555555) internal successors, (136), 20 states have internal predecessors, (136), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2023-11-12 02:07:08,597 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 284 transitions. [2023-11-12 02:07:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-11-12 02:07:08,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:08,600 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:08,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:07:08,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2181fc1-ad9d-4d16-ad46-f236d2dd94b8/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:07:08,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:08,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1374076255, now seen corresponding path program 1 times [2023-11-12 02:07:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:08,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108712935] [2023-11-12 02:07:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:07:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:07:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:07:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:07:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:07:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:07:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:07:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:07:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:07:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:07:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:07:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:07:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:07:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:07:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:07:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:07:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:07:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:07:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:07:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108712935] [2023-11-12 02:07:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108712935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:12,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:12,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:07:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691069213] [2023-11-12 02:07:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:12,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:07:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:07:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:07:12,693 INFO L87 Difference]: Start difference. First operand 200 states and 284 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-12 02:07:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:07:14,127 INFO L93 Difference]: Finished difference Result 589 states and 839 transitions. [2023-11-12 02:07:14,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:07:14,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2023-11-12 02:07:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:07:14,133 INFO L225 Difference]: With dead ends: 589 [2023-11-12 02:07:14,134 INFO L226 Difference]: Without dead ends: 420 [2023-11-12 02:07:14,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:07:14,136 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 395 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:07:14,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 993 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 02:07:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-11-12 02:07:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 336. [2023-11-12 02:07:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 291 states have (on average 1.3745704467353952) internal successors, (400), 292 states have internal predecessors, (400), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-12 02:07:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 478 transitions. [2023-11-12 02:07:14,202 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 478 transitions. Word has length 158 [2023-11-12 02:07:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:07:14,203 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 478 transitions. [2023-11-12 02:07:14,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-12 02:07:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 478 transitions. [2023-11-12 02:07:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-12 02:07:14,206 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:14,206 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:14,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:07:14,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:14,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1377135848, now seen corresponding path program 1 times [2023-11-12 02:07:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532094470] [2023-11-12 02:07:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:07:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:07:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:07:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:07:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:07:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:07:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:07:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:07:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:07:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:07:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:07:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:07:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:07:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:07:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:07:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:07:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:07:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:07:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:07:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:17,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532094470] [2023-11-12 02:07:17,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532094470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:17,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:07:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250642930] [2023-11-12 02:07:17,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:07:17,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:17,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:07:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:07:17,255 INFO L87 Difference]: Start difference. First operand 336 states and 478 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:07:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:07:18,321 INFO L93 Difference]: Finished difference Result 736 states and 1044 transitions. [2023-11-12 02:07:18,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:07:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2023-11-12 02:07:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:07:18,325 INFO L225 Difference]: With dead ends: 736 [2023-11-12 02:07:18,326 INFO L226 Difference]: Without dead ends: 431 [2023-11-12 02:07:18,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:07:18,327 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 517 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:07:18,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 404 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:07:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-11-12 02:07:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 360. [2023-11-12 02:07:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 315 states have (on average 1.3746031746031746) internal successors, (433), 316 states have internal predecessors, (433), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-12 02:07:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 511 transitions. [2023-11-12 02:07:18,396 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 511 transitions. Word has length 160 [2023-11-12 02:07:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:07:18,397 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 511 transitions. [2023-11-12 02:07:18,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-12 02:07:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 511 transitions. [2023-11-12 02:07:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-12 02:07:18,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:18,400 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:18,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:07:18,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:18,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1963941862, now seen corresponding path program 1 times [2023-11-12 02:07:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877344037] [2023-11-12 02:07:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-12 02:07:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:07:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:07:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:07:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:07:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:07:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:07:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:07:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:07:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:07:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:07:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:07:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:07:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:07:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:07:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:07:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:07:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:19,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:07:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:07:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-12 02:07:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:07:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877344037] [2023-11-12 02:07:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877344037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:07:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:07:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:07:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845806269] [2023-11-12 02:07:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:07:19,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:07:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:07:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:07:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:07:19,042 INFO L87 Difference]: Start difference. First operand 360 states and 511 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:07:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:07:19,580 INFO L93 Difference]: Finished difference Result 877 states and 1236 transitions. [2023-11-12 02:07:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:07:19,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2023-11-12 02:07:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:07:19,586 INFO L225 Difference]: With dead ends: 877 [2023-11-12 02:07:19,586 INFO L226 Difference]: Without dead ends: 548 [2023-11-12 02:07:19,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:07:19,588 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 383 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:07:19,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 717 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:07:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-11-12 02:07:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 406. [2023-11-12 02:07:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 361 states have (on average 1.368421052631579) internal successors, (494), 362 states have internal predecessors, (494), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-12 02:07:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 572 transitions. [2023-11-12 02:07:19,660 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 572 transitions. Word has length 160 [2023-11-12 02:07:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:07:19,661 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 572 transitions. [2023-11-12 02:07:19,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-12 02:07:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 572 transitions. [2023-11-12 02:07:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-11-12 02:07:19,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:07:19,664 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:19,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:07:19,665 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:07:19,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:07:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1176656518, now seen corresponding path program 1 times [2023-11-12 02:07:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:07:19,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017726233] [2023-11-12 02:07:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:07:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:07:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat