./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya --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 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:27:58,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:27:59,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:27:59,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:27:59,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:27:59,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:27:59,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:27:59,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:27:59,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:27:59,100 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:27:59,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:27:59,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:27:59,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:27:59,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:27:59,103 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:27:59,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:27:59,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:27:59,105 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:27:59,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:27:59,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:27:59,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:27:59,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:27:59,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:27:59,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:27:59,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:27:59,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:27:59,109 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:27:59,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:27:59,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:27:59,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:27:59,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:27:59,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:27:59,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:27:59,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:27:59,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:27:59,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:27:59,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:27:59,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:27:59,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:27:59,113 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:27:59,114 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:27:59,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:27:59,114 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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2023-11-28 20:27:59,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:27:59,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:27:59,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:27:59,402 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:27:59,402 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:27:59,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2023-11-28 20:28:02,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:28:02,517 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:28:02,517 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2023-11-28 20:28:02,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data/64a026a82/1940373b02194d65b62aa1556bc1ba26/FLAG88abbb0be [2023-11-28 20:28:02,546 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data/64a026a82/1940373b02194d65b62aa1556bc1ba26 [2023-11-28 20:28:02,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:28:02,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:28:02,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:28:02,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:28:02,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:28:02,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:02,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be93bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02, skipping insertion in model container [2023-11-28 20:28:02,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:02,599 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:28:02,775 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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2023-11-28 20:28:02,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:28:02,842 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:28:02,858 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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2023-11-28 20:28:02,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:28:02,904 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:28:02,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02 WrapperNode [2023-11-28 20:28:02,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:28:02,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:28:02,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:28:02,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:28:02,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:02,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:02,970 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2023-11-28 20:28:02,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:28:02,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:28:02,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:28:02,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:28:02,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:02,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:02,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,008 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:28:03,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:28:03,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:28:03,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:28:03,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:28:03,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (1/1) ... [2023-11-28 20:28:03,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:28:03,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:28:03,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:28:03,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:28:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:28:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:28:03,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:28:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:28:03,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:28:03,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:28:03,201 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:28:03,203 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:28:03,547 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:28:03,580 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:28:03,581 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:28:03,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:03 BoogieIcfgContainer [2023-11-28 20:28:03,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:28:03,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:28:03,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:28:03,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:28:03,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:28:02" (1/3) ... [2023-11-28 20:28:03,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424f0885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:28:03, skipping insertion in model container [2023-11-28 20:28:03,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:28:02" (2/3) ... [2023-11-28 20:28:03,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424f0885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:28:03, skipping insertion in model container [2023-11-28 20:28:03,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:03" (3/3) ... [2023-11-28 20:28:03,593 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2023-11-28 20:28:03,610 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:28:03,610 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:28:03,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:28:03,666 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;@1e030b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:28:03,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:28:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-28 20:28:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-28 20:28:03,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:03,686 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:03,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:03,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:03,692 INFO L85 PathProgramCache]: Analyzing trace with hash 538348796, now seen corresponding path program 1 times [2023-11-28 20:28:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566788106] [2023-11-28 20:28:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:03,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:03,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:03,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:04,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566788106] [2023-11-28 20:28:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566788106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:04,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:04,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:28:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335416984] [2023-11-28 20:28:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:04,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:28:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:28:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:28:04,180 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 states have internal predecessors, (58), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-28 20:28:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:04,226 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2023-11-28 20:28:04,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:28:04,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2023-11-28 20:28:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:04,237 INFO L225 Difference]: With dead ends: 121 [2023-11-28 20:28:04,237 INFO L226 Difference]: Without dead ends: 60 [2023-11-28 20:28:04,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:28:04,245 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:04,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:28:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-28 20:28:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-28 20:28:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-28 20:28:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 93 transitions. [2023-11-28 20:28:04,298 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 93 transitions. Word has length 125 [2023-11-28 20:28:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:04,299 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 93 transitions. [2023-11-28 20:28:04,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-28 20:28:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 93 transitions. [2023-11-28 20:28:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-28 20:28:04,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:04,304 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:04,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:28:04,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:04,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash -888789764, now seen corresponding path program 1 times [2023-11-28 20:28:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513878628] [2023-11-28 20:28:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513878628] [2023-11-28 20:28:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513878628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:28:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179548201] [2023-11-28 20:28:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:04,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:28:04,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:04,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:28:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:28:04,622 INFO L87 Difference]: Start difference. First operand 60 states and 93 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:04,700 INFO L93 Difference]: Finished difference Result 143 states and 222 transitions. [2023-11-28 20:28:04,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:28:04,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-28 20:28:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:04,704 INFO L225 Difference]: With dead ends: 143 [2023-11-28 20:28:04,704 INFO L226 Difference]: Without dead ends: 84 [2023-11-28 20:28:04,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-28 20:28:04,706 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:04,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:28:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-28 20:28:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2023-11-28 20:28:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-28 20:28:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 114 transitions. [2023-11-28 20:28:04,723 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 114 transitions. Word has length 125 [2023-11-28 20:28:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:04,725 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 114 transitions. [2023-11-28 20:28:04,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 114 transitions. [2023-11-28 20:28:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-28 20:28:04,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:04,729 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:04,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:28:04,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:04,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash -946048066, now seen corresponding path program 1 times [2023-11-28 20:28:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925095373] [2023-11-28 20:28:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:17,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925095373] [2023-11-28 20:28:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925095373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:17,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:28:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165956066] [2023-11-28 20:28:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:17,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:28:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:28:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:28:17,704 INFO L87 Difference]: Start difference. First operand 72 states and 114 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:20,064 INFO L93 Difference]: Finished difference Result 343 states and 520 transitions. [2023-11-28 20:28:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-28 20:28:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-28 20:28:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:20,069 INFO L225 Difference]: With dead ends: 343 [2023-11-28 20:28:20,070 INFO L226 Difference]: Without dead ends: 272 [2023-11-28 20:28:20,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2023-11-28 20:28:20,073 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 409 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:20,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 527 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-28 20:28:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-11-28 20:28:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 166. [2023-11-28 20:28:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.5121951219512195) internal successors, (186), 123 states have internal predecessors, (186), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-28 20:28:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 266 transitions. [2023-11-28 20:28:20,112 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 266 transitions. Word has length 125 [2023-11-28 20:28:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:20,113 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 266 transitions. [2023-11-28 20:28:20,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 266 transitions. [2023-11-28 20:28:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-28 20:28:20,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:20,118 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:20,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:28:20,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:20,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash -687882628, now seen corresponding path program 1 times [2023-11-28 20:28:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987004965] [2023-11-28 20:28:20,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:20,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987004965] [2023-11-28 20:28:20,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987004965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:20,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:28:20,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551397209] [2023-11-28 20:28:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:20,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:28:20,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:20,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:28:20,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:28:20,232 INFO L87 Difference]: Start difference. First operand 166 states and 266 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:20,271 INFO L93 Difference]: Finished difference Result 322 states and 514 transitions. [2023-11-28 20:28:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:28:20,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-28 20:28:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:20,275 INFO L225 Difference]: With dead ends: 322 [2023-11-28 20:28:20,275 INFO L226 Difference]: Without dead ends: 157 [2023-11-28 20:28:20,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-28 20:28:20,279 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:20,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:28:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-28 20:28:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-11-28 20:28:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.4649122807017543) internal successors, (167), 114 states have internal predecessors, (167), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-28 20:28:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 247 transitions. [2023-11-28 20:28:20,307 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 247 transitions. Word has length 125 [2023-11-28 20:28:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:20,308 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 247 transitions. [2023-11-28 20:28:20,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 247 transitions. [2023-11-28 20:28:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-28 20:28:20,310 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:20,311 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:20,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:28:20,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:20,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1475595778, now seen corresponding path program 1 times [2023-11-28 20:28:20,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625232734] [2023-11-28 20:28:20,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625232734] [2023-11-28 20:28:20,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625232734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:20,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:28:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158333388] [2023-11-28 20:28:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:20,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:28:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:20,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:28:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:28:20,410 INFO L87 Difference]: Start difference. First operand 157 states and 247 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:20,447 INFO L93 Difference]: Finished difference Result 313 states and 493 transitions. [2023-11-28 20:28:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:28:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-28 20:28:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:20,450 INFO L225 Difference]: With dead ends: 313 [2023-11-28 20:28:20,450 INFO L226 Difference]: Without dead ends: 157 [2023-11-28 20:28:20,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-28 20:28:20,453 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:20,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:28:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-28 20:28:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2023-11-28 20:28:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-28 20:28:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 245 transitions. [2023-11-28 20:28:20,475 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 245 transitions. Word has length 125 [2023-11-28 20:28:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:20,476 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 245 transitions. [2023-11-28 20:28:20,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:20,477 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 245 transitions. [2023-11-28 20:28:20,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-28 20:28:20,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:20,478 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:20,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:28:20,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:20,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1217430340, now seen corresponding path program 1 times [2023-11-28 20:28:20,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:20,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256683504] [2023-11-28 20:28:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256683504] [2023-11-28 20:28:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256683504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:39,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:39,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:28:39,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658232940] [2023-11-28 20:28:39,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:39,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:28:39,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:39,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:28:39,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:28:39,152 INFO L87 Difference]: Start difference. First operand 157 states and 245 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:40,319 INFO L93 Difference]: Finished difference Result 379 states and 581 transitions. [2023-11-28 20:28:40,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:28:40,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-28 20:28:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:40,325 INFO L225 Difference]: With dead ends: 379 [2023-11-28 20:28:40,325 INFO L226 Difference]: Without dead ends: 223 [2023-11-28 20:28:40,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:28:40,327 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 130 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:40,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 264 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:28:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-11-28 20:28:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 161. [2023-11-28 20:28:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 118 states have internal predecessors, (171), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-28 20:28:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 251 transitions. [2023-11-28 20:28:40,358 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 251 transitions. Word has length 125 [2023-11-28 20:28:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:40,358 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 251 transitions. [2023-11-28 20:28:40,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 251 transitions. [2023-11-28 20:28:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-11-28 20:28:40,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:40,362 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:40,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:28:40,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:40,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1274688642, now seen corresponding path program 1 times [2023-11-28 20:28:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874929916] [2023-11-28 20:28:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:40,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:40,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874929916] [2023-11-28 20:28:40,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874929916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:40,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:40,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:28:40,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000034931] [2023-11-28 20:28:40,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:40,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:28:40,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:40,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:28:40,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:28:40,469 INFO L87 Difference]: Start difference. First operand 161 states and 251 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:40,527 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2023-11-28 20:28:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:28:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2023-11-28 20:28:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:40,530 INFO L225 Difference]: With dead ends: 347 [2023-11-28 20:28:40,530 INFO L226 Difference]: Without dead ends: 187 [2023-11-28 20:28:40,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-28 20:28:40,532 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 28 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:40,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 191 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:28:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-28 20:28:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 161. [2023-11-28 20:28:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.4152542372881356) internal successors, (167), 118 states have internal predecessors, (167), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-28 20:28:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2023-11-28 20:28:40,551 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 125 [2023-11-28 20:28:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:40,551 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2023-11-28 20:28:40,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2023-11-28 20:28:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-28 20:28:40,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:40,553 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:40,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:28:40,554 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:40,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash 848728012, now seen corresponding path program 1 times [2023-11-28 20:28:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:40,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167189855] [2023-11-28 20:28:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:40,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:40,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167189855] [2023-11-28 20:28:40,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167189855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:28:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031660050] [2023-11-28 20:28:40,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:40,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:28:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:28:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:28:40,883 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:41,225 INFO L93 Difference]: Finished difference Result 377 states and 552 transitions. [2023-11-28 20:28:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:28:41,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-11-28 20:28:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:41,229 INFO L225 Difference]: With dead ends: 377 [2023-11-28 20:28:41,230 INFO L226 Difference]: Without dead ends: 375 [2023-11-28 20:28:41,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:28:41,231 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 158 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:41,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 422 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:28:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-11-28 20:28:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 299. [2023-11-28 20:28:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 222 states have (on average 1.337837837837838) internal successors, (297), 224 states have internal predecessors, (297), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-28 20:28:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 441 transitions. [2023-11-28 20:28:41,284 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 441 transitions. Word has length 127 [2023-11-28 20:28:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:41,285 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 441 transitions. [2023-11-28 20:28:41,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:41,285 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 441 transitions. [2023-11-28 20:28:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-28 20:28:41,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:41,287 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:41,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:28:41,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:41,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1499188359, now seen corresponding path program 1 times [2023-11-28 20:28:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:41,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967295341] [2023-11-28 20:28:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967295341] [2023-11-28 20:28:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967295341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:28:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340766436] [2023-11-28 20:28:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:46,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:28:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:28:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:28:46,510 INFO L87 Difference]: Start difference. First operand 299 states and 441 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:46,958 INFO L93 Difference]: Finished difference Result 547 states and 791 transitions. [2023-11-28 20:28:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:28:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-11-28 20:28:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:46,964 INFO L225 Difference]: With dead ends: 547 [2023-11-28 20:28:46,964 INFO L226 Difference]: Without dead ends: 407 [2023-11-28 20:28:46,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:28:46,966 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 92 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:46,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 239 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-28 20:28:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-28 20:28:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 299. [2023-11-28 20:28:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 222 states have (on average 1.337837837837838) internal successors, (297), 224 states have internal predecessors, (297), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-28 20:28:47,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 441 transitions. [2023-11-28 20:28:47,014 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 441 transitions. Word has length 127 [2023-11-28 20:28:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:47,015 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 441 transitions. [2023-11-28 20:28:47,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:28:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 441 transitions. [2023-11-28 20:28:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-28 20:28:47,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:47,018 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:28:47,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:28:47,019 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:47,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash 912382345, now seen corresponding path program 1 times [2023-11-28 20:28:47,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:28:47,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918528026] [2023-11-28 20:28:47,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:28:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:28:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:28:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:28:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:28:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:28:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:28:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:28:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:28:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:28:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:28:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:28:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:28:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:28:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:28:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:28:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:28:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:28:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:28:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:28:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:28:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:28:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:28:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:28:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:28:58,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918528026] [2023-11-28 20:28:58,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918528026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:28:58,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:28:58,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-28 20:28:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092334165] [2023-11-28 20:28:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:28:58,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 20:28:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:28:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 20:28:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:28:58,411 INFO L87 Difference]: Start difference. First operand 299 states and 441 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:29:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:29:00,017 INFO L93 Difference]: Finished difference Result 732 states and 1057 transitions. [2023-11-28 20:29:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:29:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-11-28 20:29:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:29:00,023 INFO L225 Difference]: With dead ends: 732 [2023-11-28 20:29:00,023 INFO L226 Difference]: Without dead ends: 434 [2023-11-28 20:29:00,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:29:00,025 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 273 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:29:00,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 497 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:29:00,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-28 20:29:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 295. [2023-11-28 20:29:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 218 states have (on average 1.3440366972477065) internal successors, (293), 220 states have internal predecessors, (293), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-28 20:29:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 437 transitions. [2023-11-28 20:29:00,090 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 437 transitions. Word has length 127 [2023-11-28 20:29:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:29:00,091 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 437 transitions. [2023-11-28 20:29:00,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:29:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 437 transitions. [2023-11-28 20:29:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-28 20:29:00,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:29:00,094 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:00,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:29:00,095 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:29:00,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:00,095 INFO L85 PathProgramCache]: Analyzing trace with hash -734534267, now seen corresponding path program 1 times [2023-11-28 20:29:00,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:00,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316690503] [2023-11-28 20:29:00,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:00,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:29:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:29:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:29:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:29:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:29:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:29:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:29:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:29:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:29:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:29:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:29:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:29:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:29:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:29:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:29:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:29:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:29:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:29:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:29:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:29:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:29:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316690503] [2023-11-28 20:29:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316690503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:29:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123993507] [2023-11-28 20:29:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:36,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:29:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:36,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:29:36,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:29:36,138 INFO L87 Difference]: Start difference. First operand 295 states and 437 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:29:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:29:38,158 INFO L93 Difference]: Finished difference Result 565 states and 816 transitions. [2023-11-28 20:29:38,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:29:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-11-28 20:29:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:29:38,163 INFO L225 Difference]: With dead ends: 565 [2023-11-28 20:29:38,163 INFO L226 Difference]: Without dead ends: 407 [2023-11-28 20:29:38,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:29:38,164 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 99 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:29:38,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 369 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-28 20:29:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-11-28 20:29:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 307. [2023-11-28 20:29:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 230 states have (on average 1.3695652173913044) internal successors, (315), 232 states have internal predecessors, (315), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-28 20:29:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 459 transitions. [2023-11-28 20:29:38,228 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 459 transitions. Word has length 127 [2023-11-28 20:29:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:29:38,229 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 459 transitions. [2023-11-28 20:29:38,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:29:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2023-11-28 20:29:38,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-28 20:29:38,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:29:38,231 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:38,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:29:38,232 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:29:38,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1321340281, now seen corresponding path program 1 times [2023-11-28 20:29:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909720618] [2023-11-28 20:29:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:38,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:04,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:04,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909720618] [2023-11-28 20:30:04,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909720618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:04,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:04,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:30:04,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533886332] [2023-11-28 20:30:04,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:04,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:30:04,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:04,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:30:04,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:30:04,539 INFO L87 Difference]: Start difference. First operand 307 states and 459 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:05,323 INFO L93 Difference]: Finished difference Result 671 states and 990 transitions. [2023-11-28 20:30:05,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:30:05,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-11-28 20:30:05,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:05,327 INFO L225 Difference]: With dead ends: 671 [2023-11-28 20:30:05,327 INFO L226 Difference]: Without dead ends: 365 [2023-11-28 20:30:05,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:30:05,329 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 63 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:05,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 312 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-28 20:30:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-11-28 20:30:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 283. [2023-11-28 20:30:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 206 states have (on average 1.354368932038835) internal successors, (279), 208 states have internal predecessors, (279), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-28 20:30:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 423 transitions. [2023-11-28 20:30:05,367 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 423 transitions. Word has length 127 [2023-11-28 20:30:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:05,367 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 423 transitions. [2023-11-28 20:30:05,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 423 transitions. [2023-11-28 20:30:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-28 20:30:05,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:05,369 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:05,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:30:05,370 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:05,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash -140187246, now seen corresponding path program 1 times [2023-11-28 20:30:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695311429] [2023-11-28 20:30:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:05,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695311429] [2023-11-28 20:30:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695311429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:05,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:30:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497606023] [2023-11-28 20:30:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:05,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:30:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:05,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:30:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:30:05,466 INFO L87 Difference]: Start difference. First operand 283 states and 423 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:05,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:05,541 INFO L93 Difference]: Finished difference Result 679 states and 997 transitions. [2023-11-28 20:30:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:30:05,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-28 20:30:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:05,545 INFO L225 Difference]: With dead ends: 679 [2023-11-28 20:30:05,545 INFO L226 Difference]: Without dead ends: 397 [2023-11-28 20:30:05,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-28 20:30:05,547 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 48 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:05,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 207 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:30:05,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-28 20:30:05,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 375. [2023-11-28 20:30:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 274 states have (on average 1.3248175182481752) internal successors, (363), 278 states have internal predecessors, (363), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2023-11-28 20:30:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 547 transitions. [2023-11-28 20:30:05,599 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 547 transitions. Word has length 129 [2023-11-28 20:30:05,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:05,599 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 547 transitions. [2023-11-28 20:30:05,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 547 transitions. [2023-11-28 20:30:05,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-28 20:30:05,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:05,601 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:05,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:30:05,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:05,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash -118726393, now seen corresponding path program 1 times [2023-11-28 20:30:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981525199] [2023-11-28 20:30:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981525199] [2023-11-28 20:30:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981525199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:05,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:30:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461113264] [2023-11-28 20:30:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:05,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:30:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:30:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:30:05,701 INFO L87 Difference]: Start difference. First operand 375 states and 547 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:05,776 INFO L93 Difference]: Finished difference Result 761 states and 1102 transitions. [2023-11-28 20:30:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:30:05,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-28 20:30:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:05,779 INFO L225 Difference]: With dead ends: 761 [2023-11-28 20:30:05,780 INFO L226 Difference]: Without dead ends: 387 [2023-11-28 20:30:05,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-28 20:30:05,782 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:05,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 171 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:30:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-11-28 20:30:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 337. [2023-11-28 20:30:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 256 states have (on average 1.32421875) internal successors, (339), 258 states have internal predecessors, (339), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-28 20:30:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 483 transitions. [2023-11-28 20:30:05,822 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 483 transitions. Word has length 129 [2023-11-28 20:30:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:05,823 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 483 transitions. [2023-11-28 20:30:05,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 483 transitions. [2023-11-28 20:30:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-28 20:30:05,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:05,825 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:05,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:30:05,825 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:05,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1766848535, now seen corresponding path program 1 times [2023-11-28 20:30:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:05,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845487083] [2023-11-28 20:30:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845487083] [2023-11-28 20:30:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845487083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:05,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:05,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:30:05,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040796297] [2023-11-28 20:30:05,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:05,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:30:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:30:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:30:05,943 INFO L87 Difference]: Start difference. First operand 337 states and 483 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:06,065 INFO L93 Difference]: Finished difference Result 597 states and 846 transitions. [2023-11-28 20:30:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:30:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-28 20:30:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:06,070 INFO L225 Difference]: With dead ends: 597 [2023-11-28 20:30:06,070 INFO L226 Difference]: Without dead ends: 412 [2023-11-28 20:30:06,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:30:06,072 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 45 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:06,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 255 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:30:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2023-11-28 20:30:06,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 408. [2023-11-28 20:30:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 317 states have (on average 1.2965299684542586) internal successors, (411), 321 states have internal predecessors, (411), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-28 20:30:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 571 transitions. [2023-11-28 20:30:06,140 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 571 transitions. Word has length 129 [2023-11-28 20:30:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:06,140 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 571 transitions. [2023-11-28 20:30:06,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 571 transitions. [2023-11-28 20:30:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-28 20:30:06,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:06,142 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:06,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:30:06,143 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:06,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1373821525, now seen corresponding path program 1 times [2023-11-28 20:30:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777829579] [2023-11-28 20:30:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:06,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777829579] [2023-11-28 20:30:06,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777829579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:06,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:06,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:30:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597258692] [2023-11-28 20:30:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:06,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:30:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:30:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:30:06,544 INFO L87 Difference]: Start difference. First operand 408 states and 571 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:06,730 INFO L93 Difference]: Finished difference Result 423 states and 587 transitions. [2023-11-28 20:30:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:30:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2023-11-28 20:30:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:06,735 INFO L225 Difference]: With dead ends: 423 [2023-11-28 20:30:06,735 INFO L226 Difference]: Without dead ends: 421 [2023-11-28 20:30:06,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:30:06,737 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 69 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:06,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 405 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:30:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2023-11-28 20:30:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 385. [2023-11-28 20:30:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 294 states have (on average 1.316326530612245) internal successors, (387), 298 states have internal predecessors, (387), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-28 20:30:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 547 transitions. [2023-11-28 20:30:06,814 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 547 transitions. Word has length 129 [2023-11-28 20:30:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:06,815 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 547 transitions. [2023-11-28 20:30:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 547 transitions. [2023-11-28 20:30:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-28 20:30:06,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:06,817 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:06,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:30:06,818 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:06,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1278516915, now seen corresponding path program 1 times [2023-11-28 20:30:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011972870] [2023-11-28 20:30:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011972870] [2023-11-28 20:30:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011972870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:07,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:07,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:30:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906058514] [2023-11-28 20:30:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:07,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:30:07,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:30:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:30:07,242 INFO L87 Difference]: Start difference. First operand 385 states and 547 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:07,641 INFO L93 Difference]: Finished difference Result 506 states and 713 transitions. [2023-11-28 20:30:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:30:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2023-11-28 20:30:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:07,646 INFO L225 Difference]: With dead ends: 506 [2023-11-28 20:30:07,646 INFO L226 Difference]: Without dead ends: 504 [2023-11-28 20:30:07,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:30:07,647 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 79 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:07,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 690 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:30:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2023-11-28 20:30:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 500. [2023-11-28 20:30:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 386 states have (on average 1.310880829015544) internal successors, (506), 393 states have internal predecessors, (506), 100 states have call successors, (100), 13 states have call predecessors, (100), 13 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-28 20:30:07,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 706 transitions. [2023-11-28 20:30:07,723 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 706 transitions. Word has length 131 [2023-11-28 20:30:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:07,724 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 706 transitions. [2023-11-28 20:30:07,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 706 transitions. [2023-11-28 20:30:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-28 20:30:07,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:07,726 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:07,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:30:07,726 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:07,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1736586703, now seen corresponding path program 1 times [2023-11-28 20:30:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052407619] [2023-11-28 20:30:07,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:07,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052407619] [2023-11-28 20:30:07,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052407619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 20:30:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177411200] [2023-11-28 20:30:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:07,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:30:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:07,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:30:07,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:30:07,832 INFO L87 Difference]: Start difference. First operand 500 states and 706 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:07,996 INFO L93 Difference]: Finished difference Result 1161 states and 1624 transitions. [2023-11-28 20:30:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:30:07,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2023-11-28 20:30:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:08,002 INFO L225 Difference]: With dead ends: 1161 [2023-11-28 20:30:08,003 INFO L226 Difference]: Without dead ends: 662 [2023-11-28 20:30:08,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-28 20:30:08,006 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:08,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:30:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-11-28 20:30:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 606. [2023-11-28 20:30:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 492 states have (on average 1.3252032520325203) internal successors, (652), 499 states have internal predecessors, (652), 100 states have call successors, (100), 13 states have call predecessors, (100), 13 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-28 20:30:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 852 transitions. [2023-11-28 20:30:08,108 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 852 transitions. Word has length 131 [2023-11-28 20:30:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:08,109 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 852 transitions. [2023-11-28 20:30:08,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 852 transitions. [2023-11-28 20:30:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-28 20:30:08,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:08,111 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:08,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:30:08,111 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:08,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1793845005, now seen corresponding path program 1 times [2023-11-28 20:30:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873146772] [2023-11-28 20:30:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:08,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:08,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873146772] [2023-11-28 20:30:08,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873146772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:08,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:08,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:30:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821986059] [2023-11-28 20:30:08,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:08,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:30:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:30:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:30:08,340 INFO L87 Difference]: Start difference. First operand 606 states and 852 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:08,652 INFO L93 Difference]: Finished difference Result 1391 states and 1916 transitions. [2023-11-28 20:30:08,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:30:08,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2023-11-28 20:30:08,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:08,657 INFO L225 Difference]: With dead ends: 1391 [2023-11-28 20:30:08,657 INFO L226 Difference]: Without dead ends: 786 [2023-11-28 20:30:08,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:30:08,660 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 172 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:08,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 374 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-28 20:30:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2023-11-28 20:30:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 638. [2023-11-28 20:30:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 524 states have (on average 1.3053435114503817) internal successors, (684), 531 states have internal predecessors, (684), 100 states have call successors, (100), 13 states have call predecessors, (100), 13 states have return successors, (100), 93 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-28 20:30:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 884 transitions. [2023-11-28 20:30:08,730 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 884 transitions. Word has length 131 [2023-11-28 20:30:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:08,730 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 884 transitions. [2023-11-28 20:30:08,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 884 transitions. [2023-11-28 20:30:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-28 20:30:08,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:08,732 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:08,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:30:08,732 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:08,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2012696843, now seen corresponding path program 1 times [2023-11-28 20:30:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620721054] [2023-11-28 20:30:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-28 20:30:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620721054] [2023-11-28 20:30:08,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620721054] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:30:08,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761700707] [2023-11-28 20:30:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:08,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:30:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:30:08,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:30:08,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:30:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:09,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-28 20:30:09,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:30:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-11-28 20:30:09,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:30:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-28 20:30:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761700707] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:30:09,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:30:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-11-28 20:30:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860283797] [2023-11-28 20:30:09,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:30:09,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:30:09,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:30:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:30:09,394 INFO L87 Difference]: Start difference. First operand 638 states and 884 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-28 20:30:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:10,380 INFO L93 Difference]: Finished difference Result 1727 states and 2353 transitions. [2023-11-28 20:30:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-28 20:30:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 131 [2023-11-28 20:30:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:10,387 INFO L225 Difference]: With dead ends: 1727 [2023-11-28 20:30:10,387 INFO L226 Difference]: Without dead ends: 1090 [2023-11-28 20:30:10,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 297 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=308, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:30:10,389 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 161 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:10,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 475 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-28 20:30:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2023-11-28 20:30:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 994. [2023-11-28 20:30:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 780 states have (on average 1.1538461538461537) internal successors, (900), 793 states have internal predecessors, (900), 184 states have call successors, (184), 29 states have call predecessors, (184), 29 states have return successors, (184), 171 states have call predecessors, (184), 184 states have call successors, (184) [2023-11-28 20:30:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1268 transitions. [2023-11-28 20:30:10,527 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1268 transitions. Word has length 131 [2023-11-28 20:30:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:10,528 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 1268 transitions. [2023-11-28 20:30:10,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-28 20:30:10,528 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1268 transitions. [2023-11-28 20:30:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-28 20:30:10,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:10,530 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:10,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:30:10,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:30:10,731 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:10,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash 333400200, now seen corresponding path program 1 times [2023-11-28 20:30:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935416219] [2023-11-28 20:30:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:10,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:11,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:11,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935416219] [2023-11-28 20:30:11,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935416219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:11,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:11,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-28 20:30:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568890446] [2023-11-28 20:30:11,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:11,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:30:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:11,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:30:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:30:11,247 INFO L87 Difference]: Start difference. First operand 994 states and 1268 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:12,033 INFO L93 Difference]: Finished difference Result 1136 states and 1439 transitions. [2023-11-28 20:30:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-28 20:30:12,034 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2023-11-28 20:30:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:12,042 INFO L225 Difference]: With dead ends: 1136 [2023-11-28 20:30:12,043 INFO L226 Difference]: Without dead ends: 1134 [2023-11-28 20:30:12,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:30:12,044 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 120 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:12,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 794 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-28 20:30:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2023-11-28 20:30:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1066. [2023-11-28 20:30:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 810 states have (on average 1.145679012345679) internal successors, (928), 827 states have internal predecessors, (928), 216 states have call successors, (216), 39 states have call predecessors, (216), 39 states have return successors, (216), 199 states have call predecessors, (216), 216 states have call successors, (216) [2023-11-28 20:30:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1360 transitions. [2023-11-28 20:30:12,312 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1360 transitions. Word has length 132 [2023-11-28 20:30:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:12,312 INFO L495 AbstractCegarLoop]: Abstraction has 1066 states and 1360 transitions. [2023-11-28 20:30:12,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1360 transitions. [2023-11-28 20:30:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-28 20:30:12,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:12,315 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:30:12,315 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:12,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1786006596, now seen corresponding path program 1 times [2023-11-28 20:30:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950948059] [2023-11-28 20:30:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-28 20:30:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-28 20:30:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-28 20:30:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-28 20:30:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-28 20:30:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-28 20:30:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-28 20:30:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-28 20:30:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-28 20:30:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-28 20:30:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-28 20:30:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-28 20:30:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-28 20:30:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-28 20:30:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-28 20:30:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-28 20:30:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-28 20:30:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-28 20:30:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-28 20:30:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-28 20:30:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-28 20:30:12,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950948059] [2023-11-28 20:30:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950948059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:12,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:12,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:30:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073170432] [2023-11-28 20:30:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:12,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:30:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:30:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:30:12,418 INFO L87 Difference]: Start difference. First operand 1066 states and 1360 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:12,816 INFO L93 Difference]: Finished difference Result 2469 states and 3130 transitions. [2023-11-28 20:30:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:30:12,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2023-11-28 20:30:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:12,823 INFO L225 Difference]: With dead ends: 2469 [2023-11-28 20:30:12,823 INFO L226 Difference]: Without dead ends: 1404 [2023-11-28 20:30:12,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:30:12,826 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 74 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:12,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 340 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-28 20:30:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2023-11-28 20:30:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1054. [2023-11-28 20:30:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 798 states have (on average 1.1428571428571428) internal successors, (912), 815 states have internal predecessors, (912), 216 states have call successors, (216), 39 states have call predecessors, (216), 39 states have return successors, (216), 199 states have call predecessors, (216), 216 states have call successors, (216) [2023-11-28 20:30:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1344 transitions. [2023-11-28 20:30:13,121 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1344 transitions. Word has length 132 [2023-11-28 20:30:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:13,122 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1344 transitions. [2023-11-28 20:30:13,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1344 transitions. [2023-11-28 20:30:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-28 20:30:13,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:13,124 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:13,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:30:13,125 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:13,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 764938242, now seen corresponding path program 1 times [2023-11-28 20:30:13,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:13,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495914955] [2023-11-28 20:30:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:30:13,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:30:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:30:13,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:30:13,251 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:30:13,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:30:13,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:30:13,259 INFO L445 BasicCegarLoop]: Path program histogram: [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-28 20:30:13,263 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:30:13,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-28 20:30:13,332 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-28 20:30:13,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:30:13,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-28 20:30:13,333 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:30:13,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-28 20:30:13,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:30:13,334 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:30:13,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-28 20:30:13,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-28 20:30:13,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:30:13,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite18 could not be translated [2023-11-28 20:30:13,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-28 20:30:13,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-28 20:30:13,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-28 20:30:13,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-28 20:30:13,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-28 20:30:13,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite18 could not be translated [2023-11-28 20:30:13,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:30:13 BoogieIcfgContainer [2023-11-28 20:30:13,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:30:13,359 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:30:13,359 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:30:13,360 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:30:13,360 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:28:03" (3/4) ... [2023-11-28 20:30:13,363 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:30:13,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:30:13,365 INFO L158 Benchmark]: Toolchain (without parser) took 130813.44ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 123.6MB in the beginning and 394.9MB in the end (delta: -271.3MB). Peak memory consumption was 197.4MB. Max. memory is 16.1GB. [2023-11-28 20:30:13,365 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:30:13,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.45ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 110.4MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-28 20:30:13,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.98ms. Allocated memory is still 163.6MB. Free memory was 110.4MB in the beginning and 106.8MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:30:13,367 INFO L158 Benchmark]: Boogie Preprocessor took 58.72ms. Allocated memory is still 163.6MB. Free memory was 106.2MB in the beginning and 101.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:30:13,367 INFO L158 Benchmark]: RCFGBuilder took 551.64ms. Allocated memory is still 163.6MB. Free memory was 101.5MB in the beginning and 79.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-28 20:30:13,367 INFO L158 Benchmark]: TraceAbstraction took 129773.07ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 78.4MB in the beginning and 395.9MB in the end (delta: -317.5MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2023-11-28 20:30:13,368 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 629.1MB. Free memory was 395.9MB in the beginning and 394.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:30:13,370 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.45ms. Allocated memory is still 163.6MB. Free memory was 123.6MB in the beginning and 110.4MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.98ms. Allocated memory is still 163.6MB. Free memory was 110.4MB in the beginning and 106.8MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.72ms. Allocated memory is still 163.6MB. Free memory was 106.2MB in the beginning and 101.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 551.64ms. Allocated memory is still 163.6MB. Free memory was 101.5MB in the beginning and 79.0MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 129773.07ms. Allocated memory was 163.6MB in the beginning and 629.1MB in the end (delta: 465.6MB). Free memory was 78.4MB in the beginning and 395.9MB in the end (delta: -317.5MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 629.1MB. Free memory was 395.9MB in the beginning and 394.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite18 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 107, overapproximation of shiftLeft at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] signed long int var_1_9 = 10; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] signed long int var_1_13 = 99; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] last_1_var_1_14 = var_1_14 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_7=2, var_1_8=8, var_1_9=10] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=2, var_1_8=8, var_1_9=10] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=2, var_1_8=8, var_1_9=10] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_8=8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_8=8, var_1_9=10] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=8, var_1_9=10] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=8, var_1_9=10] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_9=10] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_9=10] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L93] var_1_13 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L94] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L95] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L98] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L99] var_1_18 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L100] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L101] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L115] RET updateVariables() [L116] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L40] COND FALSE !((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) [L43] var_1_1 = (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L45] COND TRUE (var_1_8 + var_1_1) >= var_1_7 [L46] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L49] COND TRUE var_1_1 >= (var_1_8 << var_1_3) [L50] COND TRUE var_1_6 > var_1_7 [L51] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=2, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=2, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L107] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L107-L108] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=3, var_1_3=4, var_1_5=127, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 129.6s, OverallIterations: 23, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2145 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2108 mSDsluCounter, 7303 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5042 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2659 IncrementalHoareTripleChecker+Invalid, 2999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 2261 mSDtfsCounter, 2659 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1382 GetRequests, 1220 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1066occurred in iteration=21, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 1545 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 113.8s InterpolantComputationTime, 3077 NumberOfCodeBlocks, 3077 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3052 ConstructedInterpolants, 0 QuantifiedInterpolants, 24992 SizeOfPredicates, 4 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 18231/18240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:30:13,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya --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 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:30:15,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:30:15,584 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:30:15,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:30:15,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:30:15,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:30:15,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:30:15,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:30:15,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:30:15,632 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:30:15,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:30:15,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:30:15,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:30:15,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:30:15,636 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:30:15,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:30:15,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:30:15,638 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:30:15,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:30:15,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:30:15,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:30:15,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:30:15,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:30:15,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:30:15,641 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:30:15,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:30:15,642 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:30:15,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:30:15,643 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:30:15,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:30:15,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:30:15,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:30:15,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:30:15,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:30:15,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:30:15,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:30:15,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:30:15,647 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:30:15,647 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:30:15,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:30:15,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:30:15,648 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:30:15,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:30:15,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:30:15,648 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:30:15,649 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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2023-11-28 20:30:15,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:30:16,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:30:16,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:30:16,019 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:30:16,019 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:30:16,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2023-11-28 20:30:18,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:30:19,164 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:30:19,165 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2023-11-28 20:30:19,175 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data/82730ab9d/57409ef5ba444707a04ce3292b8fdfdd/FLAG1856851c0 [2023-11-28 20:30:19,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/data/82730ab9d/57409ef5ba444707a04ce3292b8fdfdd [2023-11-28 20:30:19,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:30:19,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:30:19,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:30:19,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:30:19,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:30:19,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4329b147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19, skipping insertion in model container [2023-11-28 20:30:19,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,247 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:30:19,421 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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2023-11-28 20:30:19,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:30:19,486 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:30:19,498 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_0e1a5c89-d7d6-474a-b5eb-99d969d78046/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i[916,929] [2023-11-28 20:30:19,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:30:19,560 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:30:19,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19 WrapperNode [2023-11-28 20:30:19,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:30:19,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:30:19,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:30:19,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:30:19,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,616 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2023-11-28 20:30:19,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:30:19,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:30:19,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:30:19,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:30:19,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:30:19,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:30:19,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:30:19,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:30:19,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:30:19,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (1/1) ... [2023-11-28 20:30:19,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:30:19,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:30:19,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:30:19,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:30:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:30:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:30:19,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:30:19,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:30:19,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:30:19,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:30:19,862 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:30:19,865 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:30:20,133 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:30:20,180 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:30:20,181 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:30:20,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:20 BoogieIcfgContainer [2023-11-28 20:30:20,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:30:20,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:30:20,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:30:20,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:30:20,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:30:19" (1/3) ... [2023-11-28 20:30:20,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcc355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:30:20, skipping insertion in model container [2023-11-28 20:30:20,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:30:19" (2/3) ... [2023-11-28 20:30:20,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcc355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:30:20, skipping insertion in model container [2023-11-28 20:30:20,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:30:20" (3/3) ... [2023-11-28 20:30:20,192 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2023-11-28 20:30:20,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:30:20,223 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:30:20,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:30:20,282 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;@165aedb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:30:20,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:30:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-28 20:30:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-28 20:30:20,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:20,305 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:20,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:20,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1863254693, now seen corresponding path program 1 times [2023-11-28 20:30:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:30:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160871636] [2023-11-28 20:30:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:20,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:30:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:30:20,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:30:20,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 20:30:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:20,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-28 20:30:20,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:30:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2023-11-28 20:30:20,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:30:20,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:30:20,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160871636] [2023-11-28 20:30:20,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160871636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:30:20,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:30:20,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:30:20,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314440265] [2023-11-28 20:30:20,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:30:20,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-28 20:30:20,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:30:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-28 20:30:20,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-28 20:30:20,582 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:20,632 INFO L93 Difference]: Finished difference Result 101 states and 182 transitions. [2023-11-28 20:30:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-28 20:30:20,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-28 20:30:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:20,644 INFO L225 Difference]: With dead ends: 101 [2023-11-28 20:30:20,644 INFO L226 Difference]: Without dead ends: 50 [2023-11-28 20:30:20,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-28 20:30:20,652 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:20,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-28 20:30:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-28 20:30:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-28 20:30:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-28 20:30:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 77 transitions. [2023-11-28 20:30:20,710 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 77 transitions. Word has length 120 [2023-11-28 20:30:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:20,710 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 77 transitions. [2023-11-28 20:30:20,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-28 20:30:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2023-11-28 20:30:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-28 20:30:20,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:20,716 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:20,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:30:20,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:30:20,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:20,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash -490706267, now seen corresponding path program 1 times [2023-11-28 20:30:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:30:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584152578] [2023-11-28 20:30:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:20,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:30:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:30:20,921 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:30:20,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e1a5c89-d7d6-474a-b5eb-99d969d78046/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:30:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:21,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 20:30:21,066 INFO L285 TraceCheckSpWp]: Computing forward predicates...