./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU --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 0d45567a05c43a020d83c4148b7193297efc53c68aa1babb30080e6503f970de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:03:20,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:03:21,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:03:21,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:03:21,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:03:21,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:03:21,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:03:21,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:03:21,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:03:21,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:03:21,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:03:21,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:03:21,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:03:21,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:03:21,072 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:03:21,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:03:21,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:03:21,073 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:03:21,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:03:21,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:03:21,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:03:21,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:03:21,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:03:21,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:03:21,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:03:21,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:03:21,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:03:21,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:03:21,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:03:21,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:03:21,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:03:21,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:03:21,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:03:21,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:03:21,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:03:21,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:03:21,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:03:21,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:03:21,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:03:21,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:03:21,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:03:21,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:03:21,085 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_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/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_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 0d45567a05c43a020d83c4148b7193297efc53c68aa1babb30080e6503f970de [2024-10-31 22:03:21,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:03:21,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:03:21,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:03:21,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:03:21,397 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:03:21,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i Unable to find full path for "g++" [2024-10-31 22:03:23,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:03:23,965 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:03:23,966 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i [2024-10-31 22:03:23,978 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/data/6bdba5f7b/17cd55a782984dbf81e5315bfdcb7c26/FLAG52e56af7c [2024-10-31 22:03:23,991 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/data/6bdba5f7b/17cd55a782984dbf81e5315bfdcb7c26 [2024-10-31 22:03:23,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:03:23,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:03:24,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:24,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:03:24,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:03:24,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:23" (1/1) ... [2024-10-31 22:03:24,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdf026d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24, skipping insertion in model container [2024-10-31 22:03:24,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:23" (1/1) ... [2024-10-31 22:03:24,038 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:03:24,253 WARN L251 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_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i[915,928] [2024-10-31 22:03:24,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:24,327 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:03:24,346 WARN L251 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_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i[915,928] [2024-10-31 22:03:24,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:24,414 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:03:24,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24 WrapperNode [2024-10-31 22:03:24,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:24,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:24,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:03:24,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:03:24,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,468 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-31 22:03:24,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:24,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:03:24,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:03:24,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:03:24,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,504 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]. [2024-10-31 22:03:24,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:03:24,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:03:24,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:03:24,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:03:24,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (1/1) ... [2024-10-31 22:03:24,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:03:24,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:03:24,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:03:24,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ba78b3-b2df-488d-86f7-7d6ac709d8c1/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:03:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:03:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:03:24,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:03:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:03:24,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:03:24,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:03:24,676 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:03:24,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:03:24,990 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-31 22:03:24,990 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:03:25,010 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:03:25,010 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:03:25,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:25 BoogieIcfgContainer [2024-10-31 22:03:25,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:03:25,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:03:25,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:03:25,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:03:25,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:03:23" (1/3) ... [2024-10-31 22:03:25,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10eb4e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:03:25, skipping insertion in model container [2024-10-31 22:03:25,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:24" (2/3) ... [2024-10-31 22:03:25,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10eb4e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:03:25, skipping insertion in model container [2024-10-31 22:03:25,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:25" (3/3) ... [2024-10-31 22:03:25,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-14.i [2024-10-31 22:03:25,052 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:03:25,053 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:03:25,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:03:25,223 INFO L333 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, 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;@6c8da8c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:03:25,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:03:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:03:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:03:25,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:25,272 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:25,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1173987694, now seen corresponding path program 1 times [2024-10-31 22:03:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:25,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818796649] [2024-10-31 22:03:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:03:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:03:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:03:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:03:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:03:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:03:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:03:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:03:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:03:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:03:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:03:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:03:25,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:25,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818796649] [2024-10-31 22:03:25,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818796649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:25,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:25,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:03:25,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997226583] [2024-10-31 22:03:25,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:25,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:03:25,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:25,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:03:25,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:03:25,926 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 22:03:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:25,971 INFO L93 Difference]: Finished difference Result 95 states and 158 transitions. [2024-10-31 22:03:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:03:25,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-10-31 22:03:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:25,985 INFO L225 Difference]: With dead ends: 95 [2024-10-31 22:03:25,986 INFO L226 Difference]: Without dead ends: 47 [2024-10-31 22:03:25,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:03:25,996 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:25,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-31 22:03:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-31 22:03:26,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:03:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-10-31 22:03:26,046 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 104 [2024-10-31 22:03:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:26,047 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-10-31 22:03:26,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 22:03:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-10-31 22:03:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:03:26,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:26,052 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:26,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:03:26,052 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:26,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash -807059822, now seen corresponding path program 1 times [2024-10-31 22:03:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:26,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786563954] [2024-10-31 22:03:26,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:26,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:03:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:03:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:03:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:03:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:03:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:03:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:03:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:03:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:03:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:03:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:03:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:03:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:26,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786563954] [2024-10-31 22:03:26,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786563954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:26,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:26,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:03:26,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110494594] [2024-10-31 22:03:26,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:26,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:03:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:26,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:03:26,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:03:26,781 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:26,994 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2024-10-31 22:03:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:03:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-10-31 22:03:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:26,998 INFO L225 Difference]: With dead ends: 146 [2024-10-31 22:03:26,999 INFO L226 Difference]: Without dead ends: 102 [2024-10-31 22:03:27,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:03:27,001 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:27,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 180 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:03:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-31 22:03:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2024-10-31 22:03:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-31 22:03:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-10-31 22:03:27,031 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 104 [2024-10-31 22:03:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:27,031 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-10-31 22:03:27,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-10-31 22:03:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:03:27,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:27,034 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:27,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:03:27,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:27,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash -105995244, now seen corresponding path program 1 times [2024-10-31 22:03:27,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:27,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397654652] [2024-10-31 22:03:27,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:03:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:03:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:03:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:03:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:03:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:03:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:03:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:03:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:03:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:03:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:03:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:03:32,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:32,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397654652] [2024-10-31 22:03:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397654652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:03:32,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179626525] [2024-10-31 22:03:32,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:32,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:03:32,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:03:32,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:03:32,942 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:34,117 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2024-10-31 22:03:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:03:34,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-10-31 22:03:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:34,121 INFO L225 Difference]: With dead ends: 99 [2024-10-31 22:03:34,121 INFO L226 Difference]: Without dead ends: 97 [2024-10-31 22:03:34,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:03:34,123 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:34,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 251 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:03:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-31 22:03:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-10-31 22:03:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-31 22:03:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-10-31 22:03:34,146 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 104 [2024-10-31 22:03:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:34,151 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-10-31 22:03:34,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-10-31 22:03:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-31 22:03:34,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:34,154 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:34,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:03:34,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:34,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash -104148202, now seen corresponding path program 1 times [2024-10-31 22:03:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21146973] [2024-10-31 22:03:34,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:03:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:03:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:03:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:03:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:03:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:03:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:03:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:03:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:03:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:03:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:03:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:03:34,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:34,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21146973] [2024-10-31 22:03:34,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21146973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:34,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:34,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:03:34,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942588542] [2024-10-31 22:03:34,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:34,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:03:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:34,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:03:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:03:34,416 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:34,605 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-10-31 22:03:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:03:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-10-31 22:03:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:34,608 INFO L225 Difference]: With dead ends: 222 [2024-10-31 22:03:34,609 INFO L226 Difference]: Without dead ends: 133 [2024-10-31 22:03:34,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:03:34,611 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:34,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 211 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:03:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-31 22:03:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-10-31 22:03:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 79 states have internal predecessors, (92), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:03:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2024-10-31 22:03:34,637 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 104 [2024-10-31 22:03:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:34,638 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2024-10-31 22:03:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2024-10-31 22:03:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:03:34,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:34,641 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:34,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:03:34,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:34,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash 359733697, now seen corresponding path program 1 times [2024-10-31 22:03:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244506381] [2024-10-31 22:03:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:03:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:03:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:03:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:03:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:03:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:03:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:03:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:03:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:03:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:03:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:03:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:03:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:40,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244506381] [2024-10-31 22:03:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244506381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:03:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290035009] [2024-10-31 22:03:40,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:40,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:03:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:40,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:03:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:03:40,207 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:42,276 INFO L93 Difference]: Finished difference Result 165 states and 223 transitions. [2024-10-31 22:03:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:03:42,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-31 22:03:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:42,280 INFO L225 Difference]: With dead ends: 165 [2024-10-31 22:03:42,280 INFO L226 Difference]: Without dead ends: 163 [2024-10-31 22:03:42,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:03:42,286 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 64 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:42,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 392 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-31 22:03:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-31 22:03:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2024-10-31 22:03:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:03:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-10-31 22:03:42,344 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 105 [2024-10-31 22:03:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:42,345 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-10-31 22:03:42,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-10-31 22:03:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-31 22:03:42,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:42,348 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:42,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:03:42,349 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:42,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1415273665, now seen corresponding path program 1 times [2024-10-31 22:03:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791282183] [2024-10-31 22:03:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:03:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:03:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:03:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:03:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:03:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:03:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:03:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:03:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:03:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:03:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:03:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:03:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791282183] [2024-10-31 22:03:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791282183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:03:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349994160] [2024-10-31 22:03:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:46,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:03:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:46,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:03:46,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:03:46,415 INFO L87 Difference]: Start difference. First operand 138 states and 196 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:47,401 INFO L93 Difference]: Finished difference Result 161 states and 222 transitions. [2024-10-31 22:03:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:03:47,402 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-10-31 22:03:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:47,404 INFO L225 Difference]: With dead ends: 161 [2024-10-31 22:03:47,404 INFO L226 Difference]: Without dead ends: 159 [2024-10-31 22:03:47,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:03:47,408 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:47,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 319 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:03:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-31 22:03:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2024-10-31 22:03:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 93 states have internal predecessors, (109), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-31 22:03:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-31 22:03:47,457 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 105 [2024-10-31 22:03:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:47,458 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-31 22:03:47,459 INFO L472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:03:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-31 22:03:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-31 22:03:47,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:47,469 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:47,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:03:47,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:47,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:47,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1660332687, now seen corresponding path program 1 times [2024-10-31 22:03:47,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:47,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462293351] [2024-10-31 22:03:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:47,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:03:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:03:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:03:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:03:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:03:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:03:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:03:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:03:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:03:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:03:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:03:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:03:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-31 22:03:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-31 22:03:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-31 22:03:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-31 22:03:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-31 22:03:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-31 22:03:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-31 22:03:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-31 22:03:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-31 22:03:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-31 22:03:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-31 22:03:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-31 22:03:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-31 22:03:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-31 22:03:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-31 22:03:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-31 22:03:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:48,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462293351] [2024-10-31 22:03:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462293351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:48,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:48,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:03:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817768298] [2024-10-31 22:03:48,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:48,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:03:48,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:48,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:03:48,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:03:48,417 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-31 22:03:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:49,162 INFO L93 Difference]: Finished difference Result 391 states and 542 transitions. [2024-10-31 22:03:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:03:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2024-10-31 22:03:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:49,167 INFO L225 Difference]: With dead ends: 391 [2024-10-31 22:03:49,167 INFO L226 Difference]: Without dead ends: 291 [2024-10-31 22:03:49,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:03:49,178 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:49,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 253 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:03:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-31 22:03:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 251. [2024-10-31 22:03:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 154 states have (on average 1.12987012987013) internal successors, (174), 158 states have internal predecessors, (174), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-31 22:03:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 350 transitions. [2024-10-31 22:03:49,296 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 350 transitions. Word has length 206 [2024-10-31 22:03:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:49,297 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 350 transitions. [2024-10-31 22:03:49,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-31 22:03:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 350 transitions. [2024-10-31 22:03:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-31 22:03:49,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:49,302 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:49,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:03:49,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:49,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -959268109, now seen corresponding path program 1 times [2024-10-31 22:03:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:49,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460257676] [2024-10-31 22:03:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat