./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/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_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/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_70f87698-09f0-442c-85b9-98846b10494e/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 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:18:09,979 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:18:10,093 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:18:10,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:18:10,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:18:10,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:18:10,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:18:10,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:18:10,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:18:10,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:18:10,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:18:10,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:18:10,151 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:18:10,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:18:10,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:18:10,154 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:18:10,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:18:10,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:18:10,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:18:10,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:18:10,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:18:10,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:18:10,157 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:18:10,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:18:10,158 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:18:10,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:18:10,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:18:10,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:18:10,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:10,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:18:10,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:18:10,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:18:10,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:18:10,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:18:10,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:18:10,163 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:18:10,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:18:10,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:18:10,164 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:18:10,164 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_70f87698-09f0-442c-85b9-98846b10494e/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_70f87698-09f0-442c-85b9-98846b10494e/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 -> 8e24809269f51bce916d93021d3fd241dd9f82f81ed2d62c2bdb32d3cd025077 [2023-11-12 02:18:10,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:18:10,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:18:10,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:18:10,459 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:18:10,460 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:18:10,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2023-11-12 02:18:13,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:18:13,805 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:18:13,806 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2023-11-12 02:18:13,816 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/data/ed4713a7e/5c3c95e44a31424980504f8cbaa27f4f/FLAG64778b9bc [2023-11-12 02:18:13,832 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/data/ed4713a7e/5c3c95e44a31424980504f8cbaa27f4f [2023-11-12 02:18:13,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:18:13,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:18:13,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:13,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:18:13,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:18:13,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:13" (1/1) ... [2023-11-12 02:18:13,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eab26bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:13, skipping insertion in model container [2023-11-12 02:18:13,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:18:13" (1/1) ... [2023-11-12 02:18:13,876 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:18:14,046 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_70f87698-09f0-442c-85b9-98846b10494e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2023-11-12 02:18:14,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:14,119 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:18:14,129 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_70f87698-09f0-442c-85b9-98846b10494e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2023-11-12 02:18:14,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:18:14,187 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:18:14,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14 WrapperNode [2023-11-12 02:18:14,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:18:14,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:14,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:18:14,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:18:14,197 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:18:14" (1/1) ... [2023-11-12 02:18:14,212 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:18:14" (1/1) ... [2023-11-12 02:18:14,259 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2023-11-12 02:18:14,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:18:14,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:18:14,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:18:14,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:18:14,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:18:14,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:18:14,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:18:14,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:18:14,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (1/1) ... [2023-11-12 02:18:14,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:18:14,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:18:14,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/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:18:14,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70f87698-09f0-442c-85b9-98846b10494e/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:18:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:18:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:18:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:18:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:18:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:18:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:18:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:18:14,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:18:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:18:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:18:14,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:18:14,605 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:18:14,607 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:18:15,199 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:18:15,206 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:18:15,207 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:18:15,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:15 BoogieIcfgContainer [2023-11-12 02:18:15,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:18:15,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:18:15,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:18:15,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:18:15,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:18:13" (1/3) ... [2023-11-12 02:18:15,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0c445f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:15, skipping insertion in model container [2023-11-12 02:18:15,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:18:14" (2/3) ... [2023-11-12 02:18:15,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0c445f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:18:15, skipping insertion in model container [2023-11-12 02:18:15,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:18:15" (3/3) ... [2023-11-12 02:18:15,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2023-11-12 02:18:15,239 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:18:15,239 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:18:15,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:18:15,301 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;@25dec954, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:18:15,302 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:18:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 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:18:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-12 02:18:15,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:15,325 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] [2023-11-12 02:18:15,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:15,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 528541446, now seen corresponding path program 1 times [2023-11-12 02:18:15,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104078353] [2023-11-12 02:18:15,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:15,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:15,954 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:18:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104078353] [2023-11-12 02:18:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104078353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:15,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:15,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:18:15,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803085495] [2023-11-12 02:18:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:15,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:18:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:16,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:18:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:18:16,011 INFO L87 Difference]: Start difference. First operand has 112 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 92 states have internal predecessors, (128), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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:18:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:16,082 INFO L93 Difference]: Finished difference Result 217 states and 340 transitions. [2023-11-12 02:18:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:18:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 140 [2023-11-12 02:18:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:16,095 INFO L225 Difference]: With dead ends: 217 [2023-11-12 02:18:16,095 INFO L226 Difference]: Without dead ends: 108 [2023-11-12 02:18:16,099 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:18:16,103 INFO L413 NwaCegarLoop]: 155 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, 155 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:18:16,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:18:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-12 02:18:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-12 02:18:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 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:18:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2023-11-12 02:18:16,160 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2023-11-12 02:18:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:16,160 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2023-11-12 02:18:16,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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:18:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2023-11-12 02:18:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-12 02:18:16,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:16,165 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] [2023-11-12 02:18:16,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:18:16,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:16,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1839681894, now seen corresponding path program 1 times [2023-11-12 02:18:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79642290] [2023-11-12 02:18:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:18,008 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:18:18,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:18,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79642290] [2023-11-12 02:18:18,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79642290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:18,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033646500] [2023-11-12 02:18:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:18,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:18,013 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:18:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:18,066 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2023-11-12 02:18:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:18,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 140 [2023-11-12 02:18:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:18,075 INFO L225 Difference]: With dead ends: 213 [2023-11-12 02:18:18,078 INFO L226 Difference]: Without dead ends: 108 [2023-11-12 02:18:18,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:18,083 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:18,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 302 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:18:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-12 02:18:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-12 02:18:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 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:18:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2023-11-12 02:18:18,108 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2023-11-12 02:18:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:18,110 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2023-11-12 02:18:18,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:18:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2023-11-12 02:18:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-12 02:18:18,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:18,119 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] [2023-11-12 02:18:18,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:18:18,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:18,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash 818613540, now seen corresponding path program 1 times [2023-11-12 02:18:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841603330] [2023-11-12 02:18:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:20,919 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:18:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841603330] [2023-11-12 02:18:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841603330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:20,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:20,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:18:20,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383137626] [2023-11-12 02:18:20,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:20,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:18:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:20,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:18:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:18:20,934 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:18:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:21,752 INFO L93 Difference]: Finished difference Result 292 states and 419 transitions. [2023-11-12 02:18:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:18:21,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 140 [2023-11-12 02:18:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:21,761 INFO L225 Difference]: With dead ends: 292 [2023-11-12 02:18:21,762 INFO L226 Difference]: Without dead ends: 187 [2023-11-12 02:18:21,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:18:21,770 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 291 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:21,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 510 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 02:18:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-12 02:18:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 126. [2023-11-12 02:18:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 106 states have internal predecessors, (145), 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:18:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 181 transitions. [2023-11-12 02:18:21,822 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 181 transitions. Word has length 140 [2023-11-12 02:18:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:21,825 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 181 transitions. [2023-11-12 02:18:21,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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:18:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 181 transitions. [2023-11-12 02:18:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-12 02:18:21,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:21,829 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] [2023-11-12 02:18:21,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:18:21,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:21,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1519678118, now seen corresponding path program 1 times [2023-11-12 02:18:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003134643] [2023-11-12 02:18:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:27,985 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:18:27,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:27,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003134643] [2023-11-12 02:18:27,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003134643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:27,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:27,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-12 02:18:27,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399391857] [2023-11-12 02:18:27,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:27,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 02:18:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:27,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 02:18:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2023-11-12 02:18:27,992 INFO L87 Difference]: Start difference. First operand 126 states and 181 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2023-11-12 02:18:29,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:29,838 INFO L93 Difference]: Finished difference Result 356 states and 511 transitions. [2023-11-12 02:18:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:29,839 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 140 [2023-11-12 02:18:29,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:29,841 INFO L225 Difference]: With dead ends: 356 [2023-11-12 02:18:29,841 INFO L226 Difference]: Without dead ends: 233 [2023-11-12 02:18:29,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=358, Unknown=0, NotChecked=0, Total=552 [2023-11-12 02:18:29,852 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 514 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:29,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 788 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-12 02:18:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-12 02:18:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2023-11-12 02:18:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 188 states have (on average 1.3563829787234043) internal successors, (255), 188 states have internal predecessors, (255), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:18:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 327 transitions. [2023-11-12 02:18:29,948 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 327 transitions. Word has length 140 [2023-11-12 02:18:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:29,949 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 327 transitions. [2023-11-12 02:18:29,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 10 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2023-11-12 02:18:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 327 transitions. [2023-11-12 02:18:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-12 02:18:29,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:29,953 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] [2023-11-12 02:18:29,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:18:29,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:29,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2051277675, now seen corresponding path program 1 times [2023-11-12 02:18:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:29,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982937454] [2023-11-12 02:18:29,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:29,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:32,402 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:18:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982937454] [2023-11-12 02:18:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982937454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:32,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:32,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:18:32,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317138846] [2023-11-12 02:18:32,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:18:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:18:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:18:32,413 INFO L87 Difference]: Start difference. First operand 227 states and 327 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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:18:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:32,832 INFO L93 Difference]: Finished difference Result 378 states and 546 transitions. [2023-11-12 02:18:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:18:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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 142 [2023-11-12 02:18:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:32,837 INFO L225 Difference]: With dead ends: 378 [2023-11-12 02:18:32,837 INFO L226 Difference]: Without dead ends: 255 [2023-11-12 02:18:32,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:18:32,838 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 465 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:32,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 362 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:18:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-12 02:18:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 211. [2023-11-12 02:18:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 172 states have internal predecessors, (230), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:18:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2023-11-12 02:18:32,900 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 142 [2023-11-12 02:18:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:32,901 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2023-11-12 02:18:32,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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:18:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2023-11-12 02:18:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-12 02:18:32,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:32,905 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] [2023-11-12 02:18:32,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:18:32,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:32,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1542625043, now seen corresponding path program 1 times [2023-11-12 02:18:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688132989] [2023-11-12 02:18:32,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:32,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:38,750 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:18:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688132989] [2023-11-12 02:18:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688132989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:38,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:38,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-11-12 02:18:38,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339427567] [2023-11-12 02:18:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:38,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 02:18:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:38,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 02:18:38,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2023-11-12 02:18:38,754 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-12 02:18:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:40,887 INFO L93 Difference]: Finished difference Result 371 states and 529 transitions. [2023-11-12 02:18:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:18:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) Word has length 142 [2023-11-12 02:18:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:40,890 INFO L225 Difference]: With dead ends: 371 [2023-11-12 02:18:40,890 INFO L226 Difference]: Without dead ends: 264 [2023-11-12 02:18:40,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2023-11-12 02:18:40,893 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 424 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:40,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 720 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-12 02:18:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-12 02:18:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 227. [2023-11-12 02:18:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:18:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2023-11-12 02:18:40,982 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 326 transitions. Word has length 142 [2023-11-12 02:18:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:40,983 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 326 transitions. [2023-11-12 02:18:40,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 22 states have internal predecessors, (55), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 10 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-12 02:18:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 326 transitions. [2023-11-12 02:18:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-12 02:18:40,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:40,985 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] [2023-11-12 02:18:40,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:18:40,986 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:40,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1602478714, now seen corresponding path program 1 times [2023-11-12 02:18:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188723428] [2023-11-12 02:18:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:42,116 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:18:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188723428] [2023-11-12 02:18:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188723428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:42,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:42,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:18:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333806573] [2023-11-12 02:18:42,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:42,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:18:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:42,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:18:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:42,119 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:18:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:42,209 INFO L93 Difference]: Finished difference Result 464 states and 667 transitions. [2023-11-12 02:18:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:18:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 145 [2023-11-12 02:18:42,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:42,213 INFO L225 Difference]: With dead ends: 464 [2023-11-12 02:18:42,213 INFO L226 Difference]: Without dead ends: 240 [2023-11-12 02:18:42,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:18:42,215 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 36 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 282 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:18:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-12 02:18:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 227. [2023-11-12 02:18:42,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 188 states have (on average 1.3404255319148937) internal successors, (252), 188 states have internal predecessors, (252), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:18:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 324 transitions. [2023-11-12 02:18:42,292 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 324 transitions. Word has length 145 [2023-11-12 02:18:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:42,292 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 324 transitions. [2023-11-12 02:18:42,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:18:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 324 transitions. [2023-11-12 02:18:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-11-12 02:18:42,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:42,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] [2023-11-12 02:18:42,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:18:42,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:42,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:42,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1015672700, now seen corresponding path program 1 times [2023-11-12 02:18:42,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:42,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151259646] [2023-11-12 02:18:42,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:42,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:43,981 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:18:43,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:43,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151259646] [2023-11-12 02:18:43,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151259646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:43,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:43,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:18:43,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470962695] [2023-11-12 02:18:43,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:43,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:18:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:18:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:18:43,984 INFO L87 Difference]: Start difference. First operand 227 states and 324 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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:18:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:18:44,414 INFO L93 Difference]: Finished difference Result 555 states and 784 transitions. [2023-11-12 02:18:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:18:44,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 145 [2023-11-12 02:18:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:18:44,418 INFO L225 Difference]: With dead ends: 555 [2023-11-12 02:18:44,418 INFO L226 Difference]: Without dead ends: 331 [2023-11-12 02:18:44,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:18:44,420 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 258 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:18:44,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 619 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:18:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-12 02:18:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 253. [2023-11-12 02:18:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 214 states have (on average 1.3271028037383177) internal successors, (284), 214 states have internal predecessors, (284), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-12 02:18:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 356 transitions. [2023-11-12 02:18:44,494 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 356 transitions. Word has length 145 [2023-11-12 02:18:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:18:44,495 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 356 transitions. [2023-11-12 02:18:44,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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:18:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 356 transitions. [2023-11-12 02:18:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-12 02:18:44,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:18:44,497 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] [2023-11-12 02:18:44,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:18:44,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:18:44,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:18:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2143372836, now seen corresponding path program 1 times [2023-11-12 02:18:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:18:44,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069588983] [2023-11-12 02:18:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:18:44,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:18:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:18:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:18:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:18:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:18:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:18:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:18:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:18:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:18:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:18:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:18:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:18:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:18:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:18:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:18:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:18:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:18:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:18:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:18:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:18:51,083 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:18:51,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:18:51,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069588983] [2023-11-12 02:18:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069588983] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:18:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:18:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-11-12 02:18:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473166458] [2023-11-12 02:18:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:18:51,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-12 02:18:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:18:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-12 02:18:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:18:51,088 INFO L87 Difference]: Start difference. First operand 253 states and 356 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 11 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18)