./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:39:17,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:39:17,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:39:17,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:39:17,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:39:17,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:39:17,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:39:17,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:39:17,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:39:17,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:39:17,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:39:17,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:39:17,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:39:17,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:39:17,339 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:39:17,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:39:17,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:39:17,339 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:39:17,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:39:17,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:39:17,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:39:17,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:39:17,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:39:17,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:39:17,341 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:39:17,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:39:17,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:39:17,342 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:39:17,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:39:17,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:39:17,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:39:17,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:39:17,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:39:17,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:39:17,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:39:17,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:39:17,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:39:17,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:39:17,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:39:17,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:39:17,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:39:17,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:39:17,351 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e [2024-10-24 11:39:17,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:39:17,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:39:17,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:39:17,611 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:39:17,613 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:39:17,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2024-10-24 11:39:19,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:39:19,282 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:39:19,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2024-10-24 11:39:19,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18649c4ad/141318693ad445359428fba8477691a3/FLAG33080eb80 [2024-10-24 11:39:19,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18649c4ad/141318693ad445359428fba8477691a3 [2024-10-24 11:39:19,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:39:19,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:39:19,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:39:19,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:39:19,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:39:19,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:19,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d62237d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19, skipping insertion in model container [2024-10-24 11:39:19,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:19,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:39:19,774 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-10-24 11:39:19,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:39:19,855 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:39:19,868 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-10-24 11:39:19,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:39:19,933 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:39:19,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19 WrapperNode [2024-10-24 11:39:19,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:39:19,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:39:19,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:39:19,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:39:19,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:19,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:19,993 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 609 [2024-10-24 11:39:19,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:39:19,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:39:19,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:39:19,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:39:20,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,045 INFO L175 MemorySlicer]: Split 147 memory accesses to 15 slices as follows [2, 9, 16, 8, 22, 20, 12, 3, 6, 6, 8, 6, 15, 8, 6]. 15 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1]. [2024-10-24 11:39:20,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:39:20,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:39:20,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:39:20,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:39:20,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (1/1) ... [2024-10-24 11:39:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:39:20,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:39:20,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:39:20,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:39:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:39:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:39:20,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:39:20,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:39:20,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:39:20,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:39:20,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-24 11:39:20,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-24 11:39:20,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-24 11:39:20,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:39:20,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-24 11:39:20,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-24 11:39:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-24 11:39:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-24 11:39:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-24 11:39:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-24 11:39:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:39:20,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:39:20,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:39:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:39:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:39:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 11:39:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 11:39:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-24 11:39:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-24 11:39:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:39:20,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:39:20,338 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:39:20,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:39:20,820 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-10-24 11:39:20,821 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:39:20,872 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:39:20,872 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:39:20,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:20 BoogieIcfgContainer [2024-10-24 11:39:20,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:39:20,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:39:20,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:39:20,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:39:20,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:39:19" (1/3) ... [2024-10-24 11:39:20,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff5cbbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:20, skipping insertion in model container [2024-10-24 11:39:20,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:39:19" (2/3) ... [2024-10-24 11:39:20,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff5cbbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:39:20, skipping insertion in model container [2024-10-24 11:39:20,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:20" (3/3) ... [2024-10-24 11:39:20,881 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-56.i [2024-10-24 11:39:20,909 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:39:20,909 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:39:20,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:39:20,969 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;@7f9f11d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:39:20,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:39:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:39:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:39:21,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:21,021 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:21,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:21,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -400416270, now seen corresponding path program 1 times [2024-10-24 11:39:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:21,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824606473] [2024-10-24 11:39:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824606473] [2024-10-24 11:39:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824606473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:21,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:21,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:39:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283052265] [2024-10-24 11:39:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:21,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:39:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:21,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:39:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:39:21,479 INFO L87 Difference]: Start difference. First operand has 119 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 98 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:39:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:21,522 INFO L93 Difference]: Finished difference Result 235 states and 377 transitions. [2024-10-24 11:39:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:39:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2024-10-24 11:39:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:21,535 INFO L225 Difference]: With dead ends: 235 [2024-10-24 11:39:21,535 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 11:39:21,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-24 11:39:21,543 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:21,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 11:39:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-24 11:39:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:39:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2024-10-24 11:39:21,586 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 146 [2024-10-24 11:39:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:21,586 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2024-10-24 11:39:21,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:39:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2024-10-24 11:39:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:39:21,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:21,589 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:21,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:39:21,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:21,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1567158880, now seen corresponding path program 1 times [2024-10-24 11:39:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:21,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887808583] [2024-10-24 11:39:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:21,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:21,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887808583] [2024-10-24 11:39:21,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887808583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:39:21,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120858309] [2024-10-24 11:39:21,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:39:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:39:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:21,864 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:21,914 INFO L93 Difference]: Finished difference Result 234 states and 351 transitions. [2024-10-24 11:39:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:39:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2024-10-24 11:39:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:21,924 INFO L225 Difference]: With dead ends: 234 [2024-10-24 11:39:21,924 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 11:39:21,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:21,925 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:21,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 11:39:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 11:39:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:39:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2024-10-24 11:39:21,952 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 146 [2024-10-24 11:39:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:21,953 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2024-10-24 11:39:21,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2024-10-24 11:39:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:39:21,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:21,961 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:21,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:39:21,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:21,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -121784862, now seen corresponding path program 1 times [2024-10-24 11:39:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310543682] [2024-10-24 11:39:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:23,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:23,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310543682] [2024-10-24 11:39:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310543682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:23,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:23,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:39:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303242337] [2024-10-24 11:39:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:23,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:39:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:39:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:39:23,456 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:24,189 INFO L93 Difference]: Finished difference Result 653 states and 982 transitions. [2024-10-24 11:39:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 11:39:24,190 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2024-10-24 11:39:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:24,192 INFO L225 Difference]: With dead ends: 653 [2024-10-24 11:39:24,193 INFO L226 Difference]: Without dead ends: 536 [2024-10-24 11:39:24,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:39:24,194 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 599 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:24,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 2923 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:39:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-24 11:39:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 283. [2024-10-24 11:39:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 242 states have (on average 1.462809917355372) internal successors, (354), 242 states have internal predecessors, (354), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 430 transitions. [2024-10-24 11:39:24,223 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 430 transitions. Word has length 146 [2024-10-24 11:39:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:24,223 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 430 transitions. [2024-10-24 11:39:24,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 430 transitions. [2024-10-24 11:39:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:39:24,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:24,229 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:24,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:39:24,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:24,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:24,230 INFO L85 PathProgramCache]: Analyzing trace with hash 917368165, now seen corresponding path program 1 times [2024-10-24 11:39:24,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:24,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020293328] [2024-10-24 11:39:24,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020293328] [2024-10-24 11:39:24,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020293328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:24,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:24,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:39:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392060090] [2024-10-24 11:39:24,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:24,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:39:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:24,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:39:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:24,429 INFO L87 Difference]: Start difference. First operand 283 states and 430 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:24,456 INFO L93 Difference]: Finished difference Result 566 states and 861 transitions. [2024-10-24 11:39:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:39:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-24 11:39:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:24,458 INFO L225 Difference]: With dead ends: 566 [2024-10-24 11:39:24,458 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 11:39:24,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:24,460 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:24,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 11:39:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-24 11:39:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 243 states have (on average 1.4567901234567902) internal successors, (354), 243 states have internal predecessors, (354), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 430 transitions. [2024-10-24 11:39:24,482 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 430 transitions. Word has length 147 [2024-10-24 11:39:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:24,482 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 430 transitions. [2024-10-24 11:39:24,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 430 transitions. [2024-10-24 11:39:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:39:24,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:24,485 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:24,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:39:24,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:24,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash -628380397, now seen corresponding path program 1 times [2024-10-24 11:39:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686008102] [2024-10-24 11:39:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:24,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686008102] [2024-10-24 11:39:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686008102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:24,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:24,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:39:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381632859] [2024-10-24 11:39:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:24,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:39:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:24,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:39:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:24,610 INFO L87 Difference]: Start difference. First operand 284 states and 430 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:24,637 INFO L93 Difference]: Finished difference Result 571 states and 867 transitions. [2024-10-24 11:39:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:39:24,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-24 11:39:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:24,638 INFO L225 Difference]: With dead ends: 571 [2024-10-24 11:39:24,639 INFO L226 Difference]: Without dead ends: 288 [2024-10-24 11:39:24,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:24,641 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:24,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-24 11:39:24,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-24 11:39:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 247 states have (on average 1.4493927125506072) internal successors, (358), 247 states have internal predecessors, (358), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 434 transitions. [2024-10-24 11:39:24,663 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 434 transitions. Word has length 147 [2024-10-24 11:39:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:24,664 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 434 transitions. [2024-10-24 11:39:24,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 434 transitions. [2024-10-24 11:39:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 11:39:24,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:24,665 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:24,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:39:24,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:24,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:24,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1672867407, now seen corresponding path program 1 times [2024-10-24 11:39:24,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:24,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480823256] [2024-10-24 11:39:24,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:24,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:24,790 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:24,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480823256] [2024-10-24 11:39:24,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480823256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:24,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:24,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:39:24,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20004196] [2024-10-24 11:39:24,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:24,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:39:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:24,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:39:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:24,792 INFO L87 Difference]: Start difference. First operand 288 states and 434 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:24,822 INFO L93 Difference]: Finished difference Result 573 states and 863 transitions. [2024-10-24 11:39:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:39:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-24 11:39:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:24,823 INFO L225 Difference]: With dead ends: 573 [2024-10-24 11:39:24,824 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 11:39:24,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:24,825 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:24,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 11:39:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-24 11:39:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 245 states have (on average 1.436734693877551) internal successors, (352), 245 states have internal predecessors, (352), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 428 transitions. [2024-10-24 11:39:24,840 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 428 transitions. Word has length 147 [2024-10-24 11:39:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:24,841 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 428 transitions. [2024-10-24 11:39:24,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 428 transitions. [2024-10-24 11:39:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:24,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:24,843 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:39:24,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:24,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash -334947715, now seen corresponding path program 1 times [2024-10-24 11:39:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388065433] [2024-10-24 11:39:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:25,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:25,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388065433] [2024-10-24 11:39:25,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388065433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:25,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:25,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698792743] [2024-10-24 11:39:25,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:25,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:25,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:25,099 INFO L87 Difference]: Start difference. First operand 286 states and 428 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:25,137 INFO L93 Difference]: Finished difference Result 577 states and 863 transitions. [2024-10-24 11:39:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:25,140 INFO L225 Difference]: With dead ends: 577 [2024-10-24 11:39:25,140 INFO L226 Difference]: Without dead ends: 292 [2024-10-24 11:39:25,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:25,141 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:25,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-24 11:39:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-10-24 11:39:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 251 states have (on average 1.4262948207171315) internal successors, (358), 251 states have internal predecessors, (358), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 434 transitions. [2024-10-24 11:39:25,154 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 434 transitions. Word has length 148 [2024-10-24 11:39:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:25,155 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 434 transitions. [2024-10-24 11:39:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 434 transitions. [2024-10-24 11:39:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:25,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:25,156 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:25,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:39:25,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:25,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2025374136, now seen corresponding path program 1 times [2024-10-24 11:39:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954599204] [2024-10-24 11:39:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:25,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:25,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954599204] [2024-10-24 11:39:25,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954599204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:25,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:25,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:39:25,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893843222] [2024-10-24 11:39:25,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:25,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:39:25,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:25,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:39:25,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:39:25,977 INFO L87 Difference]: Start difference. First operand 292 states and 434 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:26,472 INFO L93 Difference]: Finished difference Result 738 states and 1101 transitions. [2024-10-24 11:39:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:39:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2024-10-24 11:39:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:26,474 INFO L225 Difference]: With dead ends: 738 [2024-10-24 11:39:26,474 INFO L226 Difference]: Without dead ends: 447 [2024-10-24 11:39:26,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:39:26,475 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 548 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:26,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 776 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:39:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-24 11:39:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 360. [2024-10-24 11:39:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.4608150470219436) internal successors, (466), 319 states have internal predecessors, (466), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 542 transitions. [2024-10-24 11:39:26,488 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 542 transitions. Word has length 148 [2024-10-24 11:39:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:26,488 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 542 transitions. [2024-10-24 11:39:26,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 542 transitions. [2024-10-24 11:39:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:26,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:26,489 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:26,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:39:26,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:26,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1258475910, now seen corresponding path program 1 times [2024-10-24 11:39:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:26,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004840991] [2024-10-24 11:39:26,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004840991] [2024-10-24 11:39:27,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004840991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:27,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:27,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:39:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029326725] [2024-10-24 11:39:27,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:27,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:39:27,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:27,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:39:27,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:39:27,074 INFO L87 Difference]: Start difference. First operand 360 states and 542 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:27,347 INFO L93 Difference]: Finished difference Result 801 states and 1199 transitions. [2024-10-24 11:39:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:39:27,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:27,353 INFO L225 Difference]: With dead ends: 801 [2024-10-24 11:39:27,353 INFO L226 Difference]: Without dead ends: 442 [2024-10-24 11:39:27,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:27,354 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 73 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:27,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 811 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-24 11:39:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 360. [2024-10-24 11:39:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.4608150470219436) internal successors, (466), 319 states have internal predecessors, (466), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 542 transitions. [2024-10-24 11:39:27,396 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 542 transitions. Word has length 148 [2024-10-24 11:39:27,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:27,397 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 542 transitions. [2024-10-24 11:39:27,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 542 transitions. [2024-10-24 11:39:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:27,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:27,398 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:27,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:39:27,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:27,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1910559764, now seen corresponding path program 1 times [2024-10-24 11:39:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:27,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729649083] [2024-10-24 11:39:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729649083] [2024-10-24 11:39:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729649083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:27,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597034563] [2024-10-24 11:39:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:27,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:27,687 INFO L87 Difference]: Start difference. First operand 360 states and 542 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:27,756 INFO L93 Difference]: Finished difference Result 819 states and 1233 transitions. [2024-10-24 11:39:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:27,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:27,759 INFO L225 Difference]: With dead ends: 819 [2024-10-24 11:39:27,759 INFO L226 Difference]: Without dead ends: 460 [2024-10-24 11:39:27,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:27,760 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 75 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:27,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 619 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-24 11:39:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 384. [2024-10-24 11:39:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 343 states have (on average 1.4577259475218658) internal successors, (500), 343 states have internal predecessors, (500), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 576 transitions. [2024-10-24 11:39:27,774 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 576 transitions. Word has length 148 [2024-10-24 11:39:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:27,774 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 576 transitions. [2024-10-24 11:39:27,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 576 transitions. [2024-10-24 11:39:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:27,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:27,776 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:27,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:39:27,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:27,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 376858044, now seen corresponding path program 1 times [2024-10-24 11:39:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816895995] [2024-10-24 11:39:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:28,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816895995] [2024-10-24 11:39:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816895995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:39:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083955934] [2024-10-24 11:39:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:39:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:28,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:39:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:28,353 INFO L87 Difference]: Start difference. First operand 384 states and 576 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:28,629 INFO L93 Difference]: Finished difference Result 885 states and 1326 transitions. [2024-10-24 11:39:28,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:39:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:28,631 INFO L225 Difference]: With dead ends: 885 [2024-10-24 11:39:28,632 INFO L226 Difference]: Without dead ends: 502 [2024-10-24 11:39:28,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:39:28,632 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 82 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:28,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1231 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-10-24 11:39:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 430. [2024-10-24 11:39:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 389 states have (on average 1.4652956298200515) internal successors, (570), 389 states have internal predecessors, (570), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:39:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 646 transitions. [2024-10-24 11:39:28,649 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 646 transitions. Word has length 148 [2024-10-24 11:39:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:28,649 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 646 transitions. [2024-10-24 11:39:28,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 646 transitions. [2024-10-24 11:39:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:28,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:28,651 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:28,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:39:28,651 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:28,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash 635023482, now seen corresponding path program 1 times [2024-10-24 11:39:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785418956] [2024-10-24 11:39:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785418956] [2024-10-24 11:39:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785418956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:28,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:28,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:39:28,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036384187] [2024-10-24 11:39:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:28,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:39:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:28,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:39:28,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:28,981 INFO L87 Difference]: Start difference. First operand 430 states and 646 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:29,120 INFO L93 Difference]: Finished difference Result 959 states and 1426 transitions. [2024-10-24 11:39:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:39:29,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:29,122 INFO L225 Difference]: With dead ends: 959 [2024-10-24 11:39:29,122 INFO L226 Difference]: Without dead ends: 530 [2024-10-24 11:39:29,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:39:29,123 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 84 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:29,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 716 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-24 11:39:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 526. [2024-10-24 11:39:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 475 states have (on average 1.433684210526316) internal successors, (681), 477 states have internal predecessors, (681), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2024-10-24 11:39:29,146 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 148 [2024-10-24 11:39:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:29,146 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2024-10-24 11:39:29,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2024-10-24 11:39:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:29,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:29,148 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:29,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:39:29,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:29,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -102146102, now seen corresponding path program 1 times [2024-10-24 11:39:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:29,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494370704] [2024-10-24 11:39:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:29,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:29,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494370704] [2024-10-24 11:39:29,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494370704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:29,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135233642] [2024-10-24 11:39:29,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:29,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:29,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:29,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:29,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:29,401 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:29,524 INFO L93 Difference]: Finished difference Result 1151 states and 1684 transitions. [2024-10-24 11:39:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:29,527 INFO L225 Difference]: With dead ends: 1151 [2024-10-24 11:39:29,528 INFO L226 Difference]: Without dead ends: 626 [2024-10-24 11:39:29,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:29,529 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 86 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:29,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 758 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-24 11:39:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 526. [2024-10-24 11:39:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 475 states have (on average 1.433684210526316) internal successors, (681), 477 states have internal predecessors, (681), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 773 transitions. [2024-10-24 11:39:29,550 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 773 transitions. Word has length 148 [2024-10-24 11:39:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:29,551 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 773 transitions. [2024-10-24 11:39:29,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 773 transitions. [2024-10-24 11:39:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:29,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:29,554 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:29,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:39:29,554 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:29,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1113263352, now seen corresponding path program 1 times [2024-10-24 11:39:29,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:29,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466222198] [2024-10-24 11:39:29,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:29,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:29,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:29,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466222198] [2024-10-24 11:39:29,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466222198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:29,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:29,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:39:29,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22236725] [2024-10-24 11:39:29,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:29,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:39:29,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:39:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:39:29,922 INFO L87 Difference]: Start difference. First operand 526 states and 773 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:30,090 INFO L93 Difference]: Finished difference Result 1141 states and 1672 transitions. [2024-10-24 11:39:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:39:30,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:30,093 INFO L225 Difference]: With dead ends: 1141 [2024-10-24 11:39:30,093 INFO L226 Difference]: Without dead ends: 616 [2024-10-24 11:39:30,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:30,095 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 64 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:30,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1207 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-10-24 11:39:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 544. [2024-10-24 11:39:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 493 states have (on average 1.434077079107505) internal successors, (707), 495 states have internal predecessors, (707), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 799 transitions. [2024-10-24 11:39:30,118 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 799 transitions. Word has length 148 [2024-10-24 11:39:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 799 transitions. [2024-10-24 11:39:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 799 transitions. [2024-10-24 11:39:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:30,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:30,120 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:30,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:39:30,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:30,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1736715780, now seen corresponding path program 1 times [2024-10-24 11:39:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345683508] [2024-10-24 11:39:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:30,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:30,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345683508] [2024-10-24 11:39:30,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345683508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:30,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:30,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:30,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965525589] [2024-10-24 11:39:30,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:30,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:30,338 INFO L87 Difference]: Start difference. First operand 544 states and 799 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:30,474 INFO L93 Difference]: Finished difference Result 1190 states and 1735 transitions. [2024-10-24 11:39:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:30,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:30,477 INFO L225 Difference]: With dead ends: 1190 [2024-10-24 11:39:30,477 INFO L226 Difference]: Without dead ends: 647 [2024-10-24 11:39:30,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:30,480 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 96 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:30,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 764 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:30,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-24 11:39:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 544. [2024-10-24 11:39:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 495 states have internal predecessors, (705), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 797 transitions. [2024-10-24 11:39:30,504 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 797 transitions. Word has length 148 [2024-10-24 11:39:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:30,505 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 797 transitions. [2024-10-24 11:39:30,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 797 transitions. [2024-10-24 11:39:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:30,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:30,506 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:39:30,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:30,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1596167170, now seen corresponding path program 1 times [2024-10-24 11:39:30,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196849752] [2024-10-24 11:39:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:31,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:31,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196849752] [2024-10-24 11:39:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196849752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:31,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 11:39:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612618717] [2024-10-24 11:39:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:31,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:39:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:39:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:39:31,110 INFO L87 Difference]: Start difference. First operand 544 states and 797 transitions. Second operand has 12 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:31,563 INFO L93 Difference]: Finished difference Result 1157 states and 1692 transitions. [2024-10-24 11:39:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 11:39:31,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 148 [2024-10-24 11:39:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:31,566 INFO L225 Difference]: With dead ends: 1157 [2024-10-24 11:39:31,566 INFO L226 Difference]: Without dead ends: 614 [2024-10-24 11:39:31,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:39:31,567 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 235 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:31,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1534 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-10-24 11:39:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 542. [2024-10-24 11:39:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 491 states have (on average 1.4276985743380854) internal successors, (701), 493 states have internal predecessors, (701), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 793 transitions. [2024-10-24 11:39:31,591 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 793 transitions. Word has length 148 [2024-10-24 11:39:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:31,591 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 793 transitions. [2024-10-24 11:39:31,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 793 transitions. [2024-10-24 11:39:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 11:39:31,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:31,593 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:31,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:39:31,593 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash 717013656, now seen corresponding path program 1 times [2024-10-24 11:39:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:31,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809728137] [2024-10-24 11:39:31,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809728137] [2024-10-24 11:39:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809728137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:31,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:31,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:31,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70472472] [2024-10-24 11:39:31,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:31,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:31,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:31,720 INFO L87 Difference]: Start difference. First operand 542 states and 793 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:31,806 INFO L93 Difference]: Finished difference Result 1083 states and 1584 transitions. [2024-10-24 11:39:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:31,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2024-10-24 11:39:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:31,809 INFO L225 Difference]: With dead ends: 1083 [2024-10-24 11:39:31,809 INFO L226 Difference]: Without dead ends: 542 [2024-10-24 11:39:31,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:31,810 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 80 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:31,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 759 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-24 11:39:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2024-10-24 11:39:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 489 states have (on average 1.425357873210634) internal successors, (697), 491 states have internal predecessors, (697), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 789 transitions. [2024-10-24 11:39:31,831 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 789 transitions. Word has length 148 [2024-10-24 11:39:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:31,831 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 789 transitions. [2024-10-24 11:39:31,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 789 transitions. [2024-10-24 11:39:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 11:39:31,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:31,833 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:31,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:39:31,833 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:31,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash -207289869, now seen corresponding path program 1 times [2024-10-24 11:39:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171540744] [2024-10-24 11:39:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171540744] [2024-10-24 11:39:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171540744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:39:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303622137] [2024-10-24 11:39:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:39:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:31,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:39:31,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:31,919 INFO L87 Difference]: Start difference. First operand 540 states and 789 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:31,978 INFO L93 Difference]: Finished difference Result 1069 states and 1561 transitions. [2024-10-24 11:39:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:39:31,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2024-10-24 11:39:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:31,982 INFO L225 Difference]: With dead ends: 1069 [2024-10-24 11:39:31,982 INFO L226 Difference]: Without dead ends: 530 [2024-10-24 11:39:31,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:31,985 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:31,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-24 11:39:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2024-10-24 11:39:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 479 states have (on average 1.417536534446764) internal successors, (679), 481 states have internal predecessors, (679), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 771 transitions. [2024-10-24 11:39:32,017 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 771 transitions. Word has length 149 [2024-10-24 11:39:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 771 transitions. [2024-10-24 11:39:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 771 transitions. [2024-10-24 11:39:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:32,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:32,020 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:39:32,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:32,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1897798466, now seen corresponding path program 1 times [2024-10-24 11:39:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929736595] [2024-10-24 11:39:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929736595] [2024-10-24 11:39:33,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929736595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:33,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:33,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 11:39:33,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025667729] [2024-10-24 11:39:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:33,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 11:39:33,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:33,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 11:39:33,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:39:33,021 INFO L87 Difference]: Start difference. First operand 530 states and 771 transitions. Second operand has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:34,327 INFO L93 Difference]: Finished difference Result 1305 states and 1879 transitions. [2024-10-24 11:39:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-24 11:39:34,327 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2024-10-24 11:39:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:34,330 INFO L225 Difference]: With dead ends: 1305 [2024-10-24 11:39:34,330 INFO L226 Difference]: Without dead ends: 776 [2024-10-24 11:39:34,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 11:39:34,332 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1042 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 2511 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:34,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 2511 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:39:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-10-24 11:39:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 559. [2024-10-24 11:39:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 508 states have (on average 1.405511811023622) internal successors, (714), 510 states have internal predecessors, (714), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 11:39:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 806 transitions. [2024-10-24 11:39:34,358 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 806 transitions. Word has length 150 [2024-10-24 11:39:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:34,358 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 806 transitions. [2024-10-24 11:39:34,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 806 transitions. [2024-10-24 11:39:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:34,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:34,359 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:34,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:39:34,360 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:34,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:34,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2038347076, now seen corresponding path program 1 times [2024-10-24 11:39:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:34,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880459450] [2024-10-24 11:39:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880459450] [2024-10-24 11:39:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880459450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:35,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 11:39:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175650769] [2024-10-24 11:39:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 11:39:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 11:39:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:39:35,193 INFO L87 Difference]: Start difference. First operand 559 states and 806 transitions. Second operand has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:36,680 INFO L93 Difference]: Finished difference Result 1393 states and 1991 transitions. [2024-10-24 11:39:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 11:39:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2024-10-24 11:39:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:36,685 INFO L225 Difference]: With dead ends: 1393 [2024-10-24 11:39:36,685 INFO L226 Difference]: Without dead ends: 835 [2024-10-24 11:39:36,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 11:39:36,687 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1361 mSDsluCounter, 2289 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:36,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 2574 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:39:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-10-24 11:39:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 644. [2024-10-24 11:39:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 571 states have (on average 1.3870402802101576) internal successors, (792), 574 states have internal predecessors, (792), 65 states have call successors, (65), 7 states have call predecessors, (65), 7 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-24 11:39:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 922 transitions. [2024-10-24 11:39:36,719 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 922 transitions. Word has length 150 [2024-10-24 11:39:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:36,719 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 922 transitions. [2024-10-24 11:39:36,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 922 transitions. [2024-10-24 11:39:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:36,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:36,721 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:39:36,721 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:36,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash 429088674, now seen corresponding path program 1 times [2024-10-24 11:39:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162633557] [2024-10-24 11:39:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:39,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162633557] [2024-10-24 11:39:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162633557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:39,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-10-24 11:39:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348881168] [2024-10-24 11:39:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:39,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 11:39:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 11:39:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:39:39,523 INFO L87 Difference]: Start difference. First operand 644 states and 922 transitions. Second operand has 28 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2024-10-24 11:39:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:42,964 INFO L93 Difference]: Finished difference Result 1556 states and 2216 transitions. [2024-10-24 11:39:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 11:39:42,968 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 150 [2024-10-24 11:39:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:42,971 INFO L225 Difference]: With dead ends: 1556 [2024-10-24 11:39:42,971 INFO L226 Difference]: Without dead ends: 913 [2024-10-24 11:39:42,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=527, Invalid=2553, Unknown=0, NotChecked=0, Total=3080 [2024-10-24 11:39:42,979 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 848 mSDsluCounter, 5036 mSDsCounter, 0 mSdLazyCounter, 2854 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:42,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 5318 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2854 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 11:39:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2024-10-24 11:39:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 734. [2024-10-24 11:39:43,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 658 states have (on average 1.3890577507598785) internal successors, (914), 662 states have internal predecessors, (914), 67 states have call successors, (67), 8 states have call predecessors, (67), 8 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-24 11:39:43,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1048 transitions. [2024-10-24 11:39:43,041 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1048 transitions. Word has length 150 [2024-10-24 11:39:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:43,041 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1048 transitions. [2024-10-24 11:39:43,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.32) internal successors, (58), 27 states have internal predecessors, (58), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2024-10-24 11:39:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1048 transitions. [2024-10-24 11:39:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:43,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:43,047 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 11:39:43,047 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:43,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash 687254112, now seen corresponding path program 1 times [2024-10-24 11:39:43,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:43,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422419683] [2024-10-24 11:39:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:43,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:43,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:43,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422419683] [2024-10-24 11:39:43,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422419683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:43,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:43,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:39:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523101087] [2024-10-24 11:39:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:43,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:39:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:43,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:39:43,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:39:43,684 INFO L87 Difference]: Start difference. First operand 734 states and 1048 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:43,990 INFO L93 Difference]: Finished difference Result 1616 states and 2293 transitions. [2024-10-24 11:39:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:39:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2024-10-24 11:39:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:43,994 INFO L225 Difference]: With dead ends: 1616 [2024-10-24 11:39:43,994 INFO L226 Difference]: Without dead ends: 883 [2024-10-24 11:39:43,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:39:43,996 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 316 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:43,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 590 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-24 11:39:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 734. [2024-10-24 11:39:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 658 states have (on average 1.384498480243161) internal successors, (911), 662 states have internal predecessors, (911), 67 states have call successors, (67), 8 states have call predecessors, (67), 8 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-24 11:39:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1045 transitions. [2024-10-24 11:39:44,047 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1045 transitions. Word has length 150 [2024-10-24 11:39:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:44,047 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1045 transitions. [2024-10-24 11:39:44,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1045 transitions. [2024-10-24 11:39:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:44,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:44,049 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:44,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 11:39:44,049 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:44,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1942650588, now seen corresponding path program 1 times [2024-10-24 11:39:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:44,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211760617] [2024-10-24 11:39:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:44,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:44,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211760617] [2024-10-24 11:39:44,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211760617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470292542] [2024-10-24 11:39:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:44,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:44,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:44,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:44,327 INFO L87 Difference]: Start difference. First operand 734 states and 1045 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:44,459 INFO L93 Difference]: Finished difference Result 1558 states and 2204 transitions. [2024-10-24 11:39:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:44,463 INFO L225 Difference]: With dead ends: 1558 [2024-10-24 11:39:44,463 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 11:39:44,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:44,464 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 95 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:44,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 594 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 11:39:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 711. [2024-10-24 11:39:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 635 states have (on average 1.3795275590551181) internal successors, (876), 639 states have internal predecessors, (876), 67 states have call successors, (67), 8 states have call predecessors, (67), 8 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-24 11:39:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1010 transitions. [2024-10-24 11:39:44,502 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1010 transitions. Word has length 150 [2024-10-24 11:39:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:44,502 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1010 transitions. [2024-10-24 11:39:44,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1010 transitions. [2024-10-24 11:39:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:44,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:44,504 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:44,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 11:39:44,504 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:44,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2032033790, now seen corresponding path program 1 times [2024-10-24 11:39:44,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:44,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080815341] [2024-10-24 11:39:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:45,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080815341] [2024-10-24 11:39:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080815341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:45,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:39:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299940621] [2024-10-24 11:39:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:45,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:39:45,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:45,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:39:45,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:39:45,076 INFO L87 Difference]: Start difference. First operand 711 states and 1010 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:45,315 INFO L93 Difference]: Finished difference Result 1157 states and 1649 transitions. [2024-10-24 11:39:45,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:39:45,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:45,318 INFO L225 Difference]: With dead ends: 1157 [2024-10-24 11:39:45,319 INFO L226 Difference]: Without dead ends: 904 [2024-10-24 11:39:45,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:39:45,322 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 83 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 959 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:45,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 959 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-10-24 11:39:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 805. [2024-10-24 11:39:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 729 states have (on average 1.3978052126200273) internal successors, (1019), 733 states have internal predecessors, (1019), 67 states have call successors, (67), 8 states have call predecessors, (67), 8 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-24 11:39:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1153 transitions. [2024-10-24 11:39:45,363 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1153 transitions. Word has length 150 [2024-10-24 11:39:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:45,363 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1153 transitions. [2024-10-24 11:39:45,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1153 transitions. [2024-10-24 11:39:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:45,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:45,364 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 11:39:45,364 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1567564444, now seen corresponding path program 1 times [2024-10-24 11:39:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132077360] [2024-10-24 11:39:45,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:45,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:45,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132077360] [2024-10-24 11:39:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132077360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:45,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:45,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:45,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040975262] [2024-10-24 11:39:45,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:45,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:45,618 INFO L87 Difference]: Start difference. First operand 805 states and 1153 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:45,764 INFO L93 Difference]: Finished difference Result 1742 states and 2479 transitions. [2024-10-24 11:39:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:45,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:45,770 INFO L225 Difference]: With dead ends: 1742 [2024-10-24 11:39:45,770 INFO L226 Difference]: Without dead ends: 938 [2024-10-24 11:39:45,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:45,772 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 80 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:45,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 810 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-24 11:39:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 805. [2024-10-24 11:39:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 729 states have (on average 1.393689986282579) internal successors, (1016), 733 states have internal predecessors, (1016), 67 states have call successors, (67), 8 states have call predecessors, (67), 8 states have return successors, (67), 63 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-24 11:39:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1150 transitions. [2024-10-24 11:39:45,822 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1150 transitions. Word has length 150 [2024-10-24 11:39:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:45,822 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1150 transitions. [2024-10-24 11:39:45,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1150 transitions. [2024-10-24 11:39:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:45,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:45,825 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:45,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 11:39:45,825 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:45,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1309399006, now seen corresponding path program 1 times [2024-10-24 11:39:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602904855] [2024-10-24 11:39:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:46,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:46,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602904855] [2024-10-24 11:39:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602904855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:39:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269185312] [2024-10-24 11:39:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:46,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 11:39:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:46,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 11:39:46,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-24 11:39:46,444 INFO L87 Difference]: Start difference. First operand 805 states and 1150 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:46,931 INFO L93 Difference]: Finished difference Result 1681 states and 2393 transitions. [2024-10-24 11:39:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:39:46,932 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:46,935 INFO L225 Difference]: With dead ends: 1681 [2024-10-24 11:39:46,935 INFO L226 Difference]: Without dead ends: 877 [2024-10-24 11:39:46,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:39:46,937 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 80 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:46,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 2712 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-24 11:39:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 830. [2024-10-24 11:39:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 751 states have (on average 1.388814913448735) internal successors, (1043), 756 states have internal predecessors, (1043), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 11:39:46,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1181 transitions. [2024-10-24 11:39:46,979 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1181 transitions. Word has length 150 [2024-10-24 11:39:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:46,980 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1181 transitions. [2024-10-24 11:39:46,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1181 transitions. [2024-10-24 11:39:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:46,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:46,981 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:46,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 11:39:46,982 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1015931682, now seen corresponding path program 1 times [2024-10-24 11:39:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466414703] [2024-10-24 11:39:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:47,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:47,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466414703] [2024-10-24 11:39:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466414703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:47,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:47,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:39:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033042941] [2024-10-24 11:39:47,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:47,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:39:47,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:47,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:39:47,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:39:47,476 INFO L87 Difference]: Start difference. First operand 830 states and 1181 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:47,847 INFO L93 Difference]: Finished difference Result 1886 states and 2679 transitions. [2024-10-24 11:39:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:39:47,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:47,851 INFO L225 Difference]: With dead ends: 1886 [2024-10-24 11:39:47,851 INFO L226 Difference]: Without dead ends: 1061 [2024-10-24 11:39:47,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:39:47,853 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 100 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:47,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2156 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-10-24 11:39:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 946. [2024-10-24 11:39:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 867 states have (on average 1.397923875432526) internal successors, (1212), 872 states have internal predecessors, (1212), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 64 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 11:39:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1350 transitions. [2024-10-24 11:39:47,890 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1350 transitions. Word has length 150 [2024-10-24 11:39:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:47,890 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1350 transitions. [2024-10-24 11:39:47,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1350 transitions. [2024-10-24 11:39:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:47,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:47,892 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:47,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 11:39:47,892 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:47,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1716996260, now seen corresponding path program 1 times [2024-10-24 11:39:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652852531] [2024-10-24 11:39:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652852531] [2024-10-24 11:39:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652852531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:48,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:48,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333534497] [2024-10-24 11:39:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:48,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:48,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:48,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:48,095 INFO L87 Difference]: Start difference. First operand 946 states and 1350 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:48,265 INFO L93 Difference]: Finished difference Result 2136 states and 3043 transitions. [2024-10-24 11:39:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:48,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:48,270 INFO L225 Difference]: With dead ends: 2136 [2024-10-24 11:39:48,270 INFO L226 Difference]: Without dead ends: 1191 [2024-10-24 11:39:48,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:48,272 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 84 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:48,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 829 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-24 11:39:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1187. [2024-10-24 11:39:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1084 states have (on average 1.3883763837638377) internal successors, (1505), 1093 states have internal predecessors, (1505), 89 states have call successors, (89), 13 states have call predecessors, (89), 13 states have return successors, (89), 80 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-24 11:39:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1683 transitions. [2024-10-24 11:39:48,356 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1683 transitions. Word has length 150 [2024-10-24 11:39:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:48,356 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1683 transitions. [2024-10-24 11:39:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1683 transitions. [2024-10-24 11:39:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:48,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:48,358 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:48,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 11:39:48,358 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:48,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:48,358 INFO L85 PathProgramCache]: Analyzing trace with hash 429125668, now seen corresponding path program 1 times [2024-10-24 11:39:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:48,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773739924] [2024-10-24 11:39:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:48,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773739924] [2024-10-24 11:39:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773739924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:48,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:48,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:48,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785830150] [2024-10-24 11:39:48,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:48,552 INFO L87 Difference]: Start difference. First operand 1187 states and 1683 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:48,672 INFO L93 Difference]: Finished difference Result 2562 states and 3639 transitions. [2024-10-24 11:39:48,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:48,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:48,677 INFO L225 Difference]: With dead ends: 2562 [2024-10-24 11:39:48,677 INFO L226 Difference]: Without dead ends: 1380 [2024-10-24 11:39:48,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:48,679 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 66 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:48,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 767 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-10-24 11:39:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1237. [2024-10-24 11:39:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1134 states have (on average 1.3924162257495591) internal successors, (1579), 1143 states have internal predecessors, (1579), 89 states have call successors, (89), 13 states have call predecessors, (89), 13 states have return successors, (89), 80 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-24 11:39:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1757 transitions. [2024-10-24 11:39:48,732 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1757 transitions. Word has length 150 [2024-10-24 11:39:48,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:48,732 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1757 transitions. [2024-10-24 11:39:48,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1757 transitions. [2024-10-24 11:39:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:48,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:48,734 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 11:39:48,734 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:48,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1077971296, now seen corresponding path program 1 times [2024-10-24 11:39:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:48,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762190399] [2024-10-24 11:39:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:49,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:49,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762190399] [2024-10-24 11:39:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762190399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:39:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099169837] [2024-10-24 11:39:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:49,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:39:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:39:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:39:49,096 INFO L87 Difference]: Start difference. First operand 1237 states and 1757 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:49,405 INFO L93 Difference]: Finished difference Result 2541 states and 3598 transitions. [2024-10-24 11:39:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:39:49,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2024-10-24 11:39:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:49,411 INFO L225 Difference]: With dead ends: 2541 [2024-10-24 11:39:49,411 INFO L226 Difference]: Without dead ends: 1309 [2024-10-24 11:39:49,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:39:49,415 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 245 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:49,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 866 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-10-24 11:39:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1148. [2024-10-24 11:39:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1055 states have (on average 1.3924170616113745) internal successors, (1469), 1061 states have internal predecessors, (1469), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1627 transitions. [2024-10-24 11:39:49,471 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1627 transitions. Word has length 150 [2024-10-24 11:39:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:49,471 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1627 transitions. [2024-10-24 11:39:49,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1627 transitions. [2024-10-24 11:39:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:49,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:49,473 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:49,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-24 11:39:49,473 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:49,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1779035874, now seen corresponding path program 1 times [2024-10-24 11:39:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68637407] [2024-10-24 11:39:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68637407] [2024-10-24 11:39:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68637407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:49,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:39:49,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137624269] [2024-10-24 11:39:49,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:39:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:49,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:39:49,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:39:49,942 INFO L87 Difference]: Start difference. First operand 1148 states and 1627 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:50,335 INFO L93 Difference]: Finished difference Result 2442 states and 3450 transitions. [2024-10-24 11:39:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:39:50,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:50,340 INFO L225 Difference]: With dead ends: 2442 [2024-10-24 11:39:50,340 INFO L226 Difference]: Without dead ends: 1295 [2024-10-24 11:39:50,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:39:50,342 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 84 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:50,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 2103 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-10-24 11:39:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1154. [2024-10-24 11:39:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1061 states have (on average 1.3901979264844486) internal successors, (1475), 1067 states have internal predecessors, (1475), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1633 transitions. [2024-10-24 11:39:50,391 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1633 transitions. Word has length 150 [2024-10-24 11:39:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:50,391 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1633 transitions. [2024-10-24 11:39:50,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1633 transitions. [2024-10-24 11:39:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:50,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:50,393 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:50,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-24 11:39:50,393 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 506458592, now seen corresponding path program 1 times [2024-10-24 11:39:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38143615] [2024-10-24 11:39:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:50,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38143615] [2024-10-24 11:39:50,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38143615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:50,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711649139] [2024-10-24 11:39:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:50,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:50,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:50,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:50,577 INFO L87 Difference]: Start difference. First operand 1154 states and 1633 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:50,702 INFO L93 Difference]: Finished difference Result 2341 states and 3311 transitions. [2024-10-24 11:39:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:50,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:50,706 INFO L225 Difference]: With dead ends: 2341 [2024-10-24 11:39:50,706 INFO L226 Difference]: Without dead ends: 1188 [2024-10-24 11:39:50,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:50,708 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 66 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:50,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 797 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2024-10-24 11:39:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1154. [2024-10-24 11:39:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1061 states have (on average 1.3845428840716305) internal successors, (1469), 1067 states have internal predecessors, (1469), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1627 transitions. [2024-10-24 11:39:50,762 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1627 transitions. Word has length 150 [2024-10-24 11:39:50,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:50,763 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1627 transitions. [2024-10-24 11:39:50,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:50,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1627 transitions. [2024-10-24 11:39:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:50,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:50,767 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:50,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-24 11:39:50,767 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:50,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash -80347422, now seen corresponding path program 1 times [2024-10-24 11:39:50,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:50,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527324370] [2024-10-24 11:39:50,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:50,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527324370] [2024-10-24 11:39:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527324370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:51,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:51,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 11:39:51,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213187535] [2024-10-24 11:39:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 11:39:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 11:39:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:39:51,499 INFO L87 Difference]: Start difference. First operand 1154 states and 1627 transitions. Second operand has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:52,645 INFO L93 Difference]: Finished difference Result 1889 states and 2663 transitions. [2024-10-24 11:39:52,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:39:52,645 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 150 [2024-10-24 11:39:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:52,651 INFO L225 Difference]: With dead ends: 1889 [2024-10-24 11:39:52,651 INFO L226 Difference]: Without dead ends: 1262 [2024-10-24 11:39:52,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:39:52,655 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 488 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:52,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 2707 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:39:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-10-24 11:39:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1152. [2024-10-24 11:39:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1059 states have (on average 1.385269121813031) internal successors, (1467), 1065 states have internal predecessors, (1467), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1625 transitions. [2024-10-24 11:39:52,715 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1625 transitions. Word has length 150 [2024-10-24 11:39:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:52,715 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1625 transitions. [2024-10-24 11:39:52,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1625 transitions. [2024-10-24 11:39:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:52,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:52,716 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:52,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-24 11:39:52,717 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:52,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1885785756, now seen corresponding path program 1 times [2024-10-24 11:39:52,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:52,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414419827] [2024-10-24 11:39:52,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:52,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414419827] [2024-10-24 11:39:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414419827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:53,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:39:53,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121717026] [2024-10-24 11:39:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:53,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:39:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:39:53,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:39:53,233 INFO L87 Difference]: Start difference. First operand 1152 states and 1625 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:53,591 INFO L93 Difference]: Finished difference Result 2411 states and 3397 transitions. [2024-10-24 11:39:53,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:39:53,592 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:53,598 INFO L225 Difference]: With dead ends: 2411 [2024-10-24 11:39:53,601 INFO L226 Difference]: Without dead ends: 1260 [2024-10-24 11:39:53,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:39:53,604 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 69 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:53,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2358 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2024-10-24 11:39:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1158. [2024-10-24 11:39:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1065 states have (on average 1.3830985915492957) internal successors, (1473), 1071 states have internal predecessors, (1473), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1631 transitions. [2024-10-24 11:39:53,706 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1631 transitions. Word has length 150 [2024-10-24 11:39:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:53,707 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1631 transitions. [2024-10-24 11:39:53,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1631 transitions. [2024-10-24 11:39:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 11:39:53,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:53,708 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:53,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-24 11:39:53,709 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:53,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash 682756770, now seen corresponding path program 1 times [2024-10-24 11:39:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:53,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571569158] [2024-10-24 11:39:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:53,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:54,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571569158] [2024-10-24 11:39:54,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571569158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:54,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:39:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293884305] [2024-10-24 11:39:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:54,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:39:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:39:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:39:54,391 INFO L87 Difference]: Start difference. First operand 1158 states and 1631 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:54,774 INFO L93 Difference]: Finished difference Result 2412 states and 3396 transitions. [2024-10-24 11:39:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:39:54,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2024-10-24 11:39:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:54,781 INFO L225 Difference]: With dead ends: 2412 [2024-10-24 11:39:54,781 INFO L226 Difference]: Without dead ends: 1255 [2024-10-24 11:39:54,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:39:54,785 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 69 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:54,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2103 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:39:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-10-24 11:39:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1147. [2024-10-24 11:39:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1054 states have (on average 1.3842504743833017) internal successors, (1459), 1060 states have internal predecessors, (1459), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1617 transitions. [2024-10-24 11:39:54,837 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1617 transitions. Word has length 150 [2024-10-24 11:39:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:54,838 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1617 transitions. [2024-10-24 11:39:54,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1617 transitions. [2024-10-24 11:39:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:39:54,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:54,840 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:54,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-24 11:39:54,840 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:54,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:54,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1017477597, now seen corresponding path program 1 times [2024-10-24 11:39:54,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:54,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633511090] [2024-10-24 11:39:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:54,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633511090] [2024-10-24 11:39:54,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633511090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:54,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:54,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:39:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303670184] [2024-10-24 11:39:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:54,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:39:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:39:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:54,899 INFO L87 Difference]: Start difference. First operand 1147 states and 1617 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:54,952 INFO L93 Difference]: Finished difference Result 2304 states and 3255 transitions. [2024-10-24 11:39:54,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:39:54,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-24 11:39:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:54,959 INFO L225 Difference]: With dead ends: 2304 [2024-10-24 11:39:54,959 INFO L226 Difference]: Without dead ends: 1158 [2024-10-24 11:39:54,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:54,963 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:54,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-10-24 11:39:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-10-24 11:39:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1065 states have (on average 1.380281690140845) internal successors, (1470), 1071 states have internal predecessors, (1470), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1628 transitions. [2024-10-24 11:39:55,011 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1628 transitions. Word has length 151 [2024-10-24 11:39:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:55,012 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1628 transitions. [2024-10-24 11:39:55,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1628 transitions. [2024-10-24 11:39:55,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 11:39:55,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:55,013 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:55,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-24 11:39:55,013 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -316413019, now seen corresponding path program 1 times [2024-10-24 11:39:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316355123] [2024-10-24 11:39:55,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:55,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:55,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316355123] [2024-10-24 11:39:55,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316355123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:55,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:55,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:39:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044646273] [2024-10-24 11:39:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:39:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:39:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:55,130 INFO L87 Difference]: Start difference. First operand 1158 states and 1628 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:55,198 INFO L93 Difference]: Finished difference Result 2359 states and 3310 transitions. [2024-10-24 11:39:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:39:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-24 11:39:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:55,202 INFO L225 Difference]: With dead ends: 2359 [2024-10-24 11:39:55,202 INFO L226 Difference]: Without dead ends: 1202 [2024-10-24 11:39:55,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:55,204 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:55,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 822 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-10-24 11:39:55,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1169. [2024-10-24 11:39:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1076 states have (on average 1.3763940520446096) internal successors, (1481), 1082 states have internal predecessors, (1481), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1639 transitions. [2024-10-24 11:39:55,252 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1639 transitions. Word has length 151 [2024-10-24 11:39:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:55,252 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1639 transitions. [2024-10-24 11:39:55,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1639 transitions. [2024-10-24 11:39:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:39:55,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:55,254 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:55,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-24 11:39:55,254 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:55,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2009850280, now seen corresponding path program 1 times [2024-10-24 11:39:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:55,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302290852] [2024-10-24 11:39:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302290852] [2024-10-24 11:39:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302290852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:55,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:55,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:55,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382518015] [2024-10-24 11:39:55,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:55,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:55,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:55,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:55,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:55,373 INFO L87 Difference]: Start difference. First operand 1169 states and 1639 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:55,544 INFO L93 Difference]: Finished difference Result 3262 states and 4521 transitions. [2024-10-24 11:39:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:39:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-10-24 11:39:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:55,549 INFO L225 Difference]: With dead ends: 3262 [2024-10-24 11:39:55,549 INFO L226 Difference]: Without dead ends: 2094 [2024-10-24 11:39:55,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:39:55,551 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 145 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:55,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 591 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:39:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2024-10-24 11:39:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1380. [2024-10-24 11:39:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1287 states have (on average 1.3162393162393162) internal successors, (1694), 1293 states have internal predecessors, (1694), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1852 transitions. [2024-10-24 11:39:55,610 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1852 transitions. Word has length 153 [2024-10-24 11:39:55,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:55,611 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 1852 transitions. [2024-10-24 11:39:55,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1852 transitions. [2024-10-24 11:39:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:39:55,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:55,612 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:55,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-24 11:39:55,612 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:55,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1955646365, now seen corresponding path program 1 times [2024-10-24 11:39:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:55,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281699224] [2024-10-24 11:39:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:55,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281699224] [2024-10-24 11:39:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281699224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:55,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:55,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:39:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097791714] [2024-10-24 11:39:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:55,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:39:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:39:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:55,672 INFO L87 Difference]: Start difference. First operand 1380 states and 1852 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:55,750 INFO L93 Difference]: Finished difference Result 2767 states and 3719 transitions. [2024-10-24 11:39:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:39:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-10-24 11:39:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:55,754 INFO L225 Difference]: With dead ends: 2767 [2024-10-24 11:39:55,754 INFO L226 Difference]: Without dead ends: 1388 [2024-10-24 11:39:55,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:39:55,756 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:55,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:39:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-10-24 11:39:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2024-10-24 11:39:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1295 states have (on average 1.3142857142857143) internal successors, (1702), 1301 states have internal predecessors, (1702), 79 states have call successors, (79), 13 states have call predecessors, (79), 13 states have return successors, (79), 73 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 11:39:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1860 transitions. [2024-10-24 11:39:55,813 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1860 transitions. Word has length 153 [2024-10-24 11:39:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:55,813 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1860 transitions. [2024-10-24 11:39:55,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:39:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1860 transitions. [2024-10-24 11:39:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 11:39:55,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:55,815 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:55,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-24 11:39:55,815 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:55,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1898388063, now seen corresponding path program 1 times [2024-10-24 11:39:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767586169] [2024-10-24 11:39:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767586169] [2024-10-24 11:39:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767586169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 11:39:56,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799828474] [2024-10-24 11:39:56,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:56,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 11:39:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:56,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 11:39:56,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:39:56,234 INFO L87 Difference]: Start difference. First operand 1388 states and 1860 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:56,740 INFO L93 Difference]: Finished difference Result 2885 states and 3788 transitions. [2024-10-24 11:39:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:39:56,740 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2024-10-24 11:39:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:56,746 INFO L225 Difference]: With dead ends: 2885 [2024-10-24 11:39:56,746 INFO L226 Difference]: Without dead ends: 2883 [2024-10-24 11:39:56,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-10-24 11:39:56,747 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 383 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:56,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1141 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:56,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2024-10-24 11:39:56,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2584. [2024-10-24 11:39:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2411 states have (on average 1.28369970966404) internal successors, (3095), 2425 states have internal predecessors, (3095), 146 states have call successors, (146), 26 states have call predecessors, (146), 26 states have return successors, (146), 132 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-24 11:39:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 3387 transitions. [2024-10-24 11:39:56,893 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 3387 transitions. Word has length 153 [2024-10-24 11:39:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:56,894 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 3387 transitions. [2024-10-24 11:39:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 3387 transitions. [2024-10-24 11:39:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 11:39:56,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:56,896 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-24 11:39:56,896 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:56,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash -366279036, now seen corresponding path program 1 times [2024-10-24 11:39:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:56,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525919078] [2024-10-24 11:39:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:57,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:57,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525919078] [2024-10-24 11:39:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525919078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:39:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444795472] [2024-10-24 11:39:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:39:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:39:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:39:57,393 INFO L87 Difference]: Start difference. First operand 2584 states and 3387 transitions. Second operand has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2024-10-24 11:39:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:58,056 INFO L93 Difference]: Finished difference Result 5776 states and 7539 transitions. [2024-10-24 11:39:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:39:58,056 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 154 [2024-10-24 11:39:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:58,062 INFO L225 Difference]: With dead ends: 5776 [2024-10-24 11:39:58,062 INFO L226 Difference]: Without dead ends: 3193 [2024-10-24 11:39:58,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:39:58,066 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 793 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:58,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1369 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:39:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2024-10-24 11:39:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2950. [2024-10-24 11:39:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2738 states have (on average 1.2775748721694669) internal successors, (3498), 2757 states have internal predecessors, (3498), 174 states have call successors, (174), 37 states have call predecessors, (174), 37 states have return successors, (174), 155 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 11:39:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3846 transitions. [2024-10-24 11:39:58,329 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3846 transitions. Word has length 154 [2024-10-24 11:39:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:58,330 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 3846 transitions. [2024-10-24 11:39:58,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2024-10-24 11:39:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3846 transitions. [2024-10-24 11:39:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 11:39:58,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:58,334 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:58,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-24 11:39:58,335 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:58,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:58,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1542688516, now seen corresponding path program 1 times [2024-10-24 11:39:58,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:58,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395787836] [2024-10-24 11:39:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:58,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:58,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:58,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395787836] [2024-10-24 11:39:58,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395787836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:58,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:58,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:39:58,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666650149] [2024-10-24 11:39:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:58,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:39:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:58,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:39:58,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:39:58,787 INFO L87 Difference]: Start difference. First operand 2950 states and 3846 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:39:59,321 INFO L93 Difference]: Finished difference Result 6191 states and 8064 transitions. [2024-10-24 11:39:59,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:39:59,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 154 [2024-10-24 11:39:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:39:59,328 INFO L225 Difference]: With dead ends: 6191 [2024-10-24 11:39:59,328 INFO L226 Difference]: Without dead ends: 3254 [2024-10-24 11:39:59,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:39:59,331 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 357 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:39:59,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1169 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:39:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2024-10-24 11:39:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2653. [2024-10-24 11:39:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2486 states have (on average 1.2771520514883348) internal successors, (3175), 2504 states have internal predecessors, (3175), 136 states have call successors, (136), 30 states have call predecessors, (136), 30 states have return successors, (136), 118 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-24 11:39:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 3447 transitions. [2024-10-24 11:39:59,479 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 3447 transitions. Word has length 154 [2024-10-24 11:39:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:39:59,479 INFO L471 AbstractCegarLoop]: Abstraction has 2653 states and 3447 transitions. [2024-10-24 11:39:59,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-24 11:39:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 3447 transitions. [2024-10-24 11:39:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:39:59,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:39:59,482 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:39:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-24 11:39:59,482 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:39:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:39:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1770408547, now seen corresponding path program 1 times [2024-10-24 11:39:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:39:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517958053] [2024-10-24 11:39:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:39:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:39:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:39:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:39:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:39:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:39:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:39:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:39:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:39:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:39:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:39:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:39:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:39:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:39:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:39:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:39:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:39:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:39:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:39:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:39:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:39:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:39:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:39:59,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:39:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517958053] [2024-10-24 11:39:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517958053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:39:59,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:39:59,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:39:59,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275359613] [2024-10-24 11:39:59,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:39:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:39:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:39:59,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:39:59,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:39:59,689 INFO L87 Difference]: Start difference. First operand 2653 states and 3447 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:00,105 INFO L93 Difference]: Finished difference Result 7651 states and 9887 transitions. [2024-10-24 11:40:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:00,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-24 11:40:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:00,116 INFO L225 Difference]: With dead ends: 7651 [2024-10-24 11:40:00,116 INFO L226 Difference]: Without dead ends: 4999 [2024-10-24 11:40:00,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:00,121 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 96 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:00,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 861 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2024-10-24 11:40:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4899. [2024-10-24 11:40:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4899 states, 4586 states have (on average 1.264718709114697) internal successors, (5800), 4624 states have internal predecessors, (5800), 252 states have call successors, (252), 60 states have call predecessors, (252), 60 states have return successors, (252), 214 states have call predecessors, (252), 252 states have call successors, (252) [2024-10-24 11:40:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4899 states to 4899 states and 6304 transitions. [2024-10-24 11:40:00,431 INFO L78 Accepts]: Start accepts. Automaton has 4899 states and 6304 transitions. Word has length 155 [2024-10-24 11:40:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:00,432 INFO L471 AbstractCegarLoop]: Abstraction has 4899 states and 6304 transitions. [2024-10-24 11:40:00,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4899 states and 6304 transitions. [2024-10-24 11:40:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:40:00,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:00,436 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:00,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-24 11:40:00,437 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2015085659, now seen corresponding path program 1 times [2024-10-24 11:40:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389642834] [2024-10-24 11:40:00,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:00,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:00,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389642834] [2024-10-24 11:40:00,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389642834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:00,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:00,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664225410] [2024-10-24 11:40:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:00,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:00,708 INFO L87 Difference]: Start difference. First operand 4899 states and 6304 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:01,141 INFO L93 Difference]: Finished difference Result 10984 states and 14100 transitions. [2024-10-24 11:40:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:01,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-24 11:40:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:01,152 INFO L225 Difference]: With dead ends: 10984 [2024-10-24 11:40:01,152 INFO L226 Difference]: Without dead ends: 6086 [2024-10-24 11:40:01,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:01,158 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 90 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:01,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 868 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2024-10-24 11:40:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 5958. [2024-10-24 11:40:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5958 states, 5574 states have (on average 1.2576246860423395) internal successors, (7010), 5622 states have internal predecessors, (7010), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-24 11:40:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5958 states to 5958 states and 7622 transitions. [2024-10-24 11:40:01,515 INFO L78 Accepts]: Start accepts. Automaton has 5958 states and 7622 transitions. Word has length 155 [2024-10-24 11:40:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:01,516 INFO L471 AbstractCegarLoop]: Abstraction has 5958 states and 7622 transitions. [2024-10-24 11:40:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5958 states and 7622 transitions. [2024-10-24 11:40:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:40:01,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:01,519 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:01,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-24 11:40:01,520 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1688638498, now seen corresponding path program 1 times [2024-10-24 11:40:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136057333] [2024-10-24 11:40:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:01,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:01,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136057333] [2024-10-24 11:40:01,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136057333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:01,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:01,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:40:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510752677] [2024-10-24 11:40:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:01,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:40:01,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:01,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:40:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:40:01,578 INFO L87 Difference]: Start difference. First operand 5958 states and 7622 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:01,958 INFO L93 Difference]: Finished difference Result 12050 states and 15513 transitions. [2024-10-24 11:40:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:40:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-24 11:40:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:01,969 INFO L225 Difference]: With dead ends: 12050 [2024-10-24 11:40:01,969 INFO L226 Difference]: Without dead ends: 6093 [2024-10-24 11:40:01,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:40:01,975 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:01,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2024-10-24 11:40:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 6093. [2024-10-24 11:40:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6093 states, 5709 states have (on average 1.2515326677176388) internal successors, (7145), 5757 states have internal predecessors, (7145), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-24 11:40:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 7757 transitions. [2024-10-24 11:40:02,334 INFO L78 Accepts]: Start accepts. Automaton has 6093 states and 7757 transitions. Word has length 155 [2024-10-24 11:40:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:02,334 INFO L471 AbstractCegarLoop]: Abstraction has 6093 states and 7757 transitions. [2024-10-24 11:40:02,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6093 states and 7757 transitions. [2024-10-24 11:40:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:40:02,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:02,338 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:02,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-24 11:40:02,338 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:02,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1554624992, now seen corresponding path program 1 times [2024-10-24 11:40:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:02,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062323747] [2024-10-24 11:40:02,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:02,514 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:02,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:02,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062323747] [2024-10-24 11:40:02,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062323747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:02,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:02,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157983591] [2024-10-24 11:40:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:02,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:02,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:02,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:02,516 INFO L87 Difference]: Start difference. First operand 6093 states and 7757 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:03,172 INFO L93 Difference]: Finished difference Result 9873 states and 12592 transitions. [2024-10-24 11:40:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-24 11:40:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:03,183 INFO L225 Difference]: With dead ends: 9873 [2024-10-24 11:40:03,184 INFO L226 Difference]: Without dead ends: 6256 [2024-10-24 11:40:03,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:03,189 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 80 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:03,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 639 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2024-10-24 11:40:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6093. [2024-10-24 11:40:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6093 states, 5709 states have (on average 1.2489052373445437) internal successors, (7130), 5757 states have internal predecessors, (7130), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-24 11:40:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 7742 transitions. [2024-10-24 11:40:03,550 INFO L78 Accepts]: Start accepts. Automaton has 6093 states and 7742 transitions. Word has length 155 [2024-10-24 11:40:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:03,551 INFO L471 AbstractCegarLoop]: Abstraction has 6093 states and 7742 transitions. [2024-10-24 11:40:03,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6093 states and 7742 transitions. [2024-10-24 11:40:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:40:03,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:03,555 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:03,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-24 11:40:03,555 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:03,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2039277726, now seen corresponding path program 1 times [2024-10-24 11:40:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21070405] [2024-10-24 11:40:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21070405] [2024-10-24 11:40:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21070405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:03,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:40:03,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860821513] [2024-10-24 11:40:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:03,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:03,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:03,683 INFO L87 Difference]: Start difference. First operand 6093 states and 7742 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:04,087 INFO L93 Difference]: Finished difference Result 12395 states and 15738 transitions. [2024-10-24 11:40:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:40:04,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-24 11:40:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:04,098 INFO L225 Difference]: With dead ends: 12395 [2024-10-24 11:40:04,098 INFO L226 Difference]: Without dead ends: 6303 [2024-10-24 11:40:04,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:04,105 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:04,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6303 states. [2024-10-24 11:40:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6303 to 6083. [2024-10-24 11:40:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6083 states, 5699 states have (on average 1.247587296016845) internal successors, (7110), 5747 states have internal predecessors, (7110), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-24 11:40:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6083 states to 6083 states and 7722 transitions. [2024-10-24 11:40:04,469 INFO L78 Accepts]: Start accepts. Automaton has 6083 states and 7722 transitions. Word has length 155 [2024-10-24 11:40:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:04,469 INFO L471 AbstractCegarLoop]: Abstraction has 6083 states and 7722 transitions. [2024-10-24 11:40:04,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 6083 states and 7722 transitions. [2024-10-24 11:40:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 11:40:04,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:04,473 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:04,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-24 11:40:04,473 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:04,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1941353945, now seen corresponding path program 1 times [2024-10-24 11:40:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030055377] [2024-10-24 11:40:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:04,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:04,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030055377] [2024-10-24 11:40:04,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030055377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:04,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:04,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:40:04,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240534929] [2024-10-24 11:40:04,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:04,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:40:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:04,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:40:04,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:04,610 INFO L87 Difference]: Start difference. First operand 6083 states and 7722 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:05,017 INFO L93 Difference]: Finished difference Result 12030 states and 15173 transitions. [2024-10-24 11:40:05,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:40:05,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-24 11:40:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:05,035 INFO L225 Difference]: With dead ends: 12030 [2024-10-24 11:40:05,035 INFO L226 Difference]: Without dead ends: 5948 [2024-10-24 11:40:05,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:40:05,044 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:05,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 492 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2024-10-24 11:40:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 5948. [2024-10-24 11:40:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5948 states, 5564 states have (on average 1.2050682961897916) internal successors, (6705), 5612 states have internal predecessors, (6705), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-24 11:40:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5948 states to 5948 states and 7317 transitions. [2024-10-24 11:40:05,399 INFO L78 Accepts]: Start accepts. Automaton has 5948 states and 7317 transitions. Word has length 155 [2024-10-24 11:40:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:05,399 INFO L471 AbstractCegarLoop]: Abstraction has 5948 states and 7317 transitions. [2024-10-24 11:40:05,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5948 states and 7317 transitions. [2024-10-24 11:40:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 11:40:05,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:05,403 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:05,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-24 11:40:05,403 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:05,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash -925652564, now seen corresponding path program 1 times [2024-10-24 11:40:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467049777] [2024-10-24 11:40:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:05,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:05,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467049777] [2024-10-24 11:40:05,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467049777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:05,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:05,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536797678] [2024-10-24 11:40:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:05,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:05,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:05,570 INFO L87 Difference]: Start difference. First operand 5948 states and 7317 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:05,960 INFO L93 Difference]: Finished difference Result 11907 states and 14640 transitions. [2024-10-24 11:40:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:05,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-10-24 11:40:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:05,969 INFO L225 Difference]: With dead ends: 11907 [2024-10-24 11:40:05,969 INFO L226 Difference]: Without dead ends: 5960 [2024-10-24 11:40:05,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:05,973 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 173 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:05,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 496 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2024-10-24 11:40:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5678. [2024-10-24 11:40:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5363 states have (on average 1.1978370315122133) internal successors, (6424), 5401 states have internal predecessors, (6424), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-10-24 11:40:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 6920 transitions. [2024-10-24 11:40:06,314 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 6920 transitions. Word has length 156 [2024-10-24 11:40:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:06,314 INFO L471 AbstractCegarLoop]: Abstraction has 5678 states and 6920 transitions. [2024-10-24 11:40:06,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 6920 transitions. [2024-10-24 11:40:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 11:40:06,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:06,318 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:06,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-24 11:40:06,318 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash -245594194, now seen corresponding path program 1 times [2024-10-24 11:40:06,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462758781] [2024-10-24 11:40:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:06,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:06,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:06,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462758781] [2024-10-24 11:40:06,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462758781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:06,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:06,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:06,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237595333] [2024-10-24 11:40:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:06,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:06,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:06,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:06,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:06,489 INFO L87 Difference]: Start difference. First operand 5678 states and 6920 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:06,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:06,861 INFO L93 Difference]: Finished difference Result 11567 states and 14099 transitions. [2024-10-24 11:40:06,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:06,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-10-24 11:40:06,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:06,875 INFO L225 Difference]: With dead ends: 11567 [2024-10-24 11:40:06,877 INFO L226 Difference]: Without dead ends: 5890 [2024-10-24 11:40:06,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:40:06,891 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 73 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:06,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 645 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states. [2024-10-24 11:40:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 5678. [2024-10-24 11:40:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5363 states have (on average 1.1941077754987879) internal successors, (6404), 5401 states have internal predecessors, (6404), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-10-24 11:40:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 6900 transitions. [2024-10-24 11:40:07,347 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 6900 transitions. Word has length 156 [2024-10-24 11:40:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:07,349 INFO L471 AbstractCegarLoop]: Abstraction has 5678 states and 6900 transitions. [2024-10-24 11:40:07,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 6900 transitions. [2024-10-24 11:40:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 11:40:07,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:07,354 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:07,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-24 11:40:07,354 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:07,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1385546080, now seen corresponding path program 1 times [2024-10-24 11:40:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601360971] [2024-10-24 11:40:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:07,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:07,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601360971] [2024-10-24 11:40:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601360971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:40:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342171261] [2024-10-24 11:40:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:07,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:40:07,635 INFO L87 Difference]: Start difference. First operand 5678 states and 6900 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:08,610 INFO L93 Difference]: Finished difference Result 13467 states and 16596 transitions. [2024-10-24 11:40:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:40:08,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2024-10-24 11:40:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:08,624 INFO L225 Difference]: With dead ends: 13467 [2024-10-24 11:40:08,624 INFO L226 Difference]: Without dead ends: 7790 [2024-10-24 11:40:08,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:08,638 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 155 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:08,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1002 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2024-10-24 11:40:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 5786. [2024-10-24 11:40:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5786 states, 5471 states have (on average 1.1802229939681959) internal successors, (6457), 5509 states have internal predecessors, (6457), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2024-10-24 11:40:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 6953 transitions. [2024-10-24 11:40:09,077 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 6953 transitions. Word has length 156 [2024-10-24 11:40:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:09,078 INFO L471 AbstractCegarLoop]: Abstraction has 5786 states and 6953 transitions. [2024-10-24 11:40:09,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 6953 transitions. [2024-10-24 11:40:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 11:40:09,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:09,083 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:09,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-24 11:40:09,083 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:09,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1700417001, now seen corresponding path program 1 times [2024-10-24 11:40:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777523413] [2024-10-24 11:40:09,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 11:40:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777523413] [2024-10-24 11:40:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777523413] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241724211] [2024-10-24 11:40:09,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:09,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:40:09,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:40:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:09,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:40:09,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:10,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:40:10,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-24 11:40:10,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 11:40:10,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:40:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-24 11:40:10,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:10,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2024-10-24 11:40:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-24 11:40:10,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241724211] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:40:10,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:40:10,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2024-10-24 11:40:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487193124] [2024-10-24 11:40:10,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:40:10,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 11:40:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 11:40:10,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:40:10,731 INFO L87 Difference]: Start difference. First operand 5786 states and 6953 transitions. Second operand has 17 states, 14 states have (on average 7.785714285714286) internal successors, (109), 17 states have internal predecessors, (109), 8 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (53), 5 states have call predecessors, (53), 8 states have call successors, (53) [2024-10-24 11:40:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:11,817 INFO L93 Difference]: Finished difference Result 12377 states and 15064 transitions. [2024-10-24 11:40:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 11:40:11,818 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 7.785714285714286) internal successors, (109), 17 states have internal predecessors, (109), 8 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (53), 5 states have call predecessors, (53), 8 states have call successors, (53) Word has length 156 [2024-10-24 11:40:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:11,829 INFO L225 Difference]: With dead ends: 12377 [2024-10-24 11:40:11,829 INFO L226 Difference]: Without dead ends: 6592 [2024-10-24 11:40:11,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 341 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 11:40:11,836 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 544 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:11,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1079 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:40:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2024-10-24 11:40:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 6088. [2024-10-24 11:40:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6088 states, 5609 states have (on average 1.1649135318238546) internal successors, (6534), 5667 states have internal predecessors, (6534), 374 states have call successors, (374), 104 states have call predecessors, (374), 104 states have return successors, (374), 316 states have call predecessors, (374), 374 states have call successors, (374) [2024-10-24 11:40:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 7282 transitions. [2024-10-24 11:40:12,378 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 7282 transitions. Word has length 156 [2024-10-24 11:40:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:12,378 INFO L471 AbstractCegarLoop]: Abstraction has 6088 states and 7282 transitions. [2024-10-24 11:40:12,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 7.785714285714286) internal successors, (109), 17 states have internal predecessors, (109), 8 states have call successors, (53), 3 states have call predecessors, (53), 5 states have return successors, (53), 5 states have call predecessors, (53), 8 states have call successors, (53) [2024-10-24 11:40:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 7282 transitions. [2024-10-24 11:40:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 11:40:12,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:12,382 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:12,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:40:12,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:40:12,583 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:12,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2076117040, now seen corresponding path program 1 times [2024-10-24 11:40:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:12,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706462691] [2024-10-24 11:40:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:40:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:40:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:40:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:40:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:40:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:40:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:40:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:40:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:40:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:40:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:40:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:40:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:40:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:40:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 11:40:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 11:40:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:40:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 11:40:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 11:40:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:40:12,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706462691] [2024-10-24 11:40:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706462691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:40:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296987915] [2024-10-24 11:40:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:12,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:40:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:40:12,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:40:12,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:40:12,935 INFO L87 Difference]: Start difference. First operand 6088 states and 7282 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:13,555 INFO L93 Difference]: Finished difference Result 6198 states and 7410 transitions. [2024-10-24 11:40:13,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:40:13,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2024-10-24 11:40:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:13,566 INFO L225 Difference]: With dead ends: 6198 [2024-10-24 11:40:13,566 INFO L226 Difference]: Without dead ends: 6196 [2024-10-24 11:40:13,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:40:13,568 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 113 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:13,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1497 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2024-10-24 11:40:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 5086. [2024-10-24 11:40:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 4848 states have (on average 1.164397689768977) internal successors, (5645), 4876 states have internal predecessors, (5645), 184 states have call successors, (184), 53 states have call predecessors, (184), 53 states have return successors, (184), 156 states have call predecessors, (184), 184 states have call successors, (184) [2024-10-24 11:40:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 6013 transitions. [2024-10-24 11:40:13,847 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 6013 transitions. Word has length 158 [2024-10-24 11:40:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 5086 states and 6013 transitions. [2024-10-24 11:40:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 6013 transitions. [2024-10-24 11:40:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-24 11:40:13,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:13,851 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:13,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-24 11:40:13,851 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -366767123, now seen corresponding path program 1 times [2024-10-24 11:40:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:40:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990066681] [2024-10-24 11:40:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:40:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:40:13,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:40:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:40:14,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:40:14,042 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:40:14,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:40:14,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-24 11:40:14,048 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:14,220 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:40:14,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:40:14 BoogieIcfgContainer [2024-10-24 11:40:14,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:40:14,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:40:14,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:40:14,222 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:40:14,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:39:20" (3/4) ... [2024-10-24 11:40:14,224 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:40:14,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:40:14,225 INFO L158 Benchmark]: Toolchain (without parser) took 54608.05ms. Allocated memory was 192.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 161.9MB in the beginning and 975.9MB in the end (delta: -814.0MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-24 11:40:14,225 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:40:14,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 192.9MB. Free memory was 161.9MB in the beginning and 145.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:40:14,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.20ms. Allocated memory is still 192.9MB. Free memory was 145.1MB in the beginning and 140.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:40:14,226 INFO L158 Benchmark]: Boogie Preprocessor took 103.80ms. Allocated memory is still 192.9MB. Free memory was 140.8MB in the beginning and 134.6MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:40:14,226 INFO L158 Benchmark]: RCFGBuilder took 771.34ms. Allocated memory is still 192.9MB. Free memory was 133.8MB in the beginning and 73.8MB in the end (delta: 60.0MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-24 11:40:14,227 INFO L158 Benchmark]: TraceAbstraction took 53347.16ms. Allocated memory was 192.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 73.0MB in the beginning and 975.9MB in the end (delta: -902.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-24 11:40:14,227 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 2.3GB. Free memory is still 975.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:40:14,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.59ms. Allocated memory is still 192.9MB. Free memory was 161.9MB in the beginning and 145.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.20ms. Allocated memory is still 192.9MB. Free memory was 145.1MB in the beginning and 140.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.80ms. Allocated memory is still 192.9MB. Free memory was 140.8MB in the beginning and 134.6MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 771.34ms. Allocated memory is still 192.9MB. Free memory was 133.8MB in the beginning and 73.8MB in the end (delta: 60.0MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 53347.16ms. Allocated memory was 192.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 73.0MB in the beginning and 975.9MB in the end (delta: -902.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 2.3GB. Free memory is still 975.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L22] unsigned char var_1_1 = 1; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] signed char var_1_3 = 0; [L24] signed char var_1_3 = 0; [L25] signed char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_5 = 128; [L26] unsigned char var_1_5 = 128; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 16; [L28] unsigned char var_1_6 = 16; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 2; [L30] unsigned char var_1_7 = 2; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_8 = 8; [L32] unsigned char var_1_8 = 8; [L33] unsigned char* var_1_8_Pointer = &(var_1_8); [L34] double var_1_9 = 10.5; [L34] double var_1_9 = 10.5; [L35] double* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_10 = 0; [L36] unsigned char var_1_10 = 0; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_12 = 0; [L38] unsigned char var_1_12 = 0; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 99.25; [L40] double var_1_13 = 99.25; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 64; [L42] unsigned char var_1_14 = 64; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_16 = 0; [L44] unsigned char var_1_16 = 0; [L45] unsigned char* var_1_16_Pointer = &(var_1_16); [L46] unsigned char var_1_17 = 0; [L46] unsigned char var_1_17 = 0; [L47] unsigned char* var_1_17_Pointer = &(var_1_17); [L48] unsigned char var_1_18 = 1; [L48] unsigned char var_1_18 = 1; [L49] unsigned char* var_1_18_Pointer = &(var_1_18); [L50] unsigned char last_1_var_1_14 = 64; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR \read(var_1_14) [L117] last_1_var_1_14 = var_1_14 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L86] var_1_3 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_10 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] var_1_12 = __VERIFIER_nondet_uchar() [L105] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] var_1_13 = __VERIFIER_nondet_double() [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] var_1_17 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] var_1_18 = __VERIFIER_nondet_uchar() [L113] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L128] RET updateVariables() [L129] CALL step() [L54] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] EXPR last_1_var_1_14 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] COND TRUE (last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14 [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_6_Pointer) [L55] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) [L55] EXPR \read(*var_1_6_Pointer) [L55] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] (*(var_1_1_Pointer)) = (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))) [L59] EXPR \read(*var_1_8_Pointer) [L59] EXPR \read(*var_1_1_Pointer) [L59] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] COND FALSE !(((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) [L62] EXPR \read(*var_1_12_Pointer) [L62] (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) [L63] EXPR \read(*var_1_1_Pointer) [L63] EXPR \read(*var_1_8_Pointer) [L63] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR (*(var_1_8_Pointer)) << (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] COND FALSE !((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) [L70] EXPR \read(*var_1_18_Pointer) [L70] (*(var_1_16_Pointer)) = (*(var_1_18_Pointer)) [L75] EXPR \read(*var_1_14_Pointer) [L75] unsigned char stepLocal_1 = (*(var_1_14_Pointer)); [L76] EXPR \read(*var_1_16_Pointer) [L76] unsigned char stepLocal_0 = (*(var_1_16_Pointer)); [L77] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] COND TRUE (*(var_1_16_Pointer)) [L78] stepLocal_0 || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_1=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] stepLocal_0 || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] COND TRUE stepLocal_0 || (*(var_1_16_Pointer)) [L79] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] COND TRUE stepLocal_1 > (*(var_1_6_Pointer)) [L80] EXPR \read(*var_1_13_Pointer) [L80] (*(var_1_9_Pointer)) = (*(var_1_13_Pointer)) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR last_1_var_1_14 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer)))))))) [L120] EXPR \read(*var_1_1_Pointer) [L120] EXPR \read(*var_1_3_Pointer) [L120] EXPR \read(*var_1_5_Pointer) [L120] EXPR \read(*var_1_6_Pointer) [L120] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) [L120] EXPR \read(*var_1_6_Pointer) [L120] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) [L120] EXPR \read(*var_1_3_Pointer) [L120] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer)))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) [L120] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1 [L120] EXPR \read(*var_1_16_Pointer) [L120] EXPR (*(var_1_16_Pointer)) || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1 [L120] EXPR \read(*var_1_14_Pointer) [L120] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1 [L120] EXPR \read(*var_1_9_Pointer) [L120] EXPR \read(*var_1_13_Pointer) [L120] EXPR ((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120-L121] return (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.1s, OverallIterations: 54, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10202 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10201 mSDsluCounter, 59996 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49317 mSDsCounter, 995 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16223 IncrementalHoareTripleChecker+Invalid, 17218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 995 mSolverCounterUnsat, 10679 mSDtfsCounter, 16223 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3022 GetRequests, 2474 SyntacticMatches, 5 SemanticMatches, 543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2041 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6093occurred in iteration=45, InterpolantAutomatonStates: 455, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 53 MinimizatonAttempts, 9583 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 8301 NumberOfCodeBlocks, 8301 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 8244 ConstructedInterpolants, 0 QuantifiedInterpolants, 28840 SizeOfPredicates, 10 NumberOfNonLiveVariables, 660 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 55 InterpolantComputations, 52 PerfectInterpolantSequences, 37410/37620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:40:14,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:40:16,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:40:16,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:40:16,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:40:16,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:40:16,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:40:16,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:40:16,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:40:16,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:40:16,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:40:16,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:40:16,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:40:16,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:40:16,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:40:16,617 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:40:16,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:40:16,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:40:16,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:40:16,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:40:16,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:40:16,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:40:16,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:40:16,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:40:16,623 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:40:16,623 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:40:16,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:40:16,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:40:16,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:40:16,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:40:16,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:40:16,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:40:16,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:40:16,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:40:16,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:40:16,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:16,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:40:16,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:40:16,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:40:16,624 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:40:16,625 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:40:16,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:40:16,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:40:16,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:40:16,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:40:16,629 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:40:16,630 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e [2024-10-24 11:40:16,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:40:16,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:40:16,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:40:16,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:40:16,994 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:40:16,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2024-10-24 11:40:18,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:40:18,561 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:40:18,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2024-10-24 11:40:18,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96583d667/54091910f3714a6782b93dd01aca5dea/FLAG5b0ddcc8f [2024-10-24 11:40:18,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96583d667/54091910f3714a6782b93dd01aca5dea [2024-10-24 11:40:18,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:40:18,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:40:18,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:18,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:40:18,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:40:18,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:18" (1/1) ... [2024-10-24 11:40:18,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0643bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:18, skipping insertion in model container [2024-10-24 11:40:18,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:40:18" (1/1) ... [2024-10-24 11:40:18,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:40:19,141 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-10-24 11:40:19,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:19,215 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:40:19,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2024-10-24 11:40:19,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:40:19,282 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:40:19,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19 WrapperNode [2024-10-24 11:40:19,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:40:19,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:19,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:40:19,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:40:19,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,334 INFO L138 Inliner]: procedures = 30, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580 [2024-10-24 11:40:19,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:40:19,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:40:19,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:40:19,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:40:19,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,399 INFO L175 MemorySlicer]: Split 147 memory accesses to 15 slices as follows [2, 9, 16, 8, 22, 20, 12, 3, 6, 6, 8, 6, 15, 8, 6]. 15 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1]. [2024-10-24 11:40:19,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:40:19,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:40:19,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:40:19,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:40:19,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (1/1) ... [2024-10-24 11:40:19,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:40:19,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:40:19,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:40:19,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:40:19,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:40:19,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:40:19,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:40:19,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-10-24 11:40:19,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-10-24 11:40:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-10-24 11:40:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-10-24 11:40:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-10-24 11:40:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-10-24 11:40:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-10-24 11:40:19,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-24 11:40:19,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-10-24 11:40:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-10-24 11:40:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-10-24 11:40:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-10-24 11:40:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-10-24 11:40:19,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-10-24 11:40:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-10-24 11:40:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-10-24 11:40:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-10-24 11:40:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-10-24 11:40:19,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-10-24 11:40:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-10-24 11:40:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:40:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:40:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:40:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:40:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:40:19,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:40:19,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 11:40:19,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 11:40:19,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-24 11:40:19,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-24 11:40:19,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-24 11:40:19,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:40:19,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-10-24 11:40:19,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:40:19,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:40:19,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:40:19,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-24 11:40:19,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-24 11:40:19,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-24 11:40:19,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-24 11:40:19,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-24 11:40:19,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-24 11:40:19,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-24 11:40:19,724 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:40:19,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:40:20,188 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-10-24 11:40:20,189 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:40:20,245 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:40:20,245 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:40:20,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:20 BoogieIcfgContainer [2024-10-24 11:40:20,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:40:20,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:40:20,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:40:20,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:40:20,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:40:18" (1/3) ... [2024-10-24 11:40:20,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604f5639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:20, skipping insertion in model container [2024-10-24 11:40:20,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:40:19" (2/3) ... [2024-10-24 11:40:20,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604f5639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:40:20, skipping insertion in model container [2024-10-24 11:40:20,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:40:20" (3/3) ... [2024-10-24 11:40:20,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-56.i [2024-10-24 11:40:20,266 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:40:20,266 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:40:20,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:40:20,323 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;@413be0f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:40:20,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:40:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:40:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:40:20,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:20,337 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:20,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:20,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:20,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1216094639, now seen corresponding path program 1 times [2024-10-24 11:40:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583241589] [2024-10-24 11:40:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:20,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:20,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:20,355 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:40:20,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:40:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:20,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:40:20,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-24 11:40:20,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:20,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583241589] [2024-10-24 11:40:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583241589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:40:20,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229120692] [2024-10-24 11:40:20,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:20,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:40:20,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:40:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:40:20,766 INFO L87 Difference]: Start difference. First operand has 111 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 90 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:40:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:20,806 INFO L93 Difference]: Finished difference Result 219 states and 353 transitions. [2024-10-24 11:40:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:40:20,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2024-10-24 11:40:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:20,820 INFO L225 Difference]: With dead ends: 219 [2024-10-24 11:40:20,820 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 11:40:20,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-24 11:40:20,828 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:20,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 11:40:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 11:40:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:40:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2024-10-24 11:40:20,890 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 144 [2024-10-24 11:40:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:20,890 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2024-10-24 11:40:20,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 11:40:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2024-10-24 11:40:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:40:20,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:20,893 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:20,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:40:21,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:21,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash -864537187, now seen corresponding path program 1 times [2024-10-24 11:40:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653704244] [2024-10-24 11:40:21,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:21,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:21,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:21,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:40:21,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:40:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:21,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 11:40:21,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:21,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:21,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653704244] [2024-10-24 11:40:21,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653704244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:21,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:21,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:40:21,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591401235] [2024-10-24 11:40:21,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:40:21,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:40:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:40:21,496 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:21,543 INFO L93 Difference]: Finished difference Result 218 states and 327 transitions. [2024-10-24 11:40:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:40:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-10-24 11:40:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:21,551 INFO L225 Difference]: With dead ends: 218 [2024-10-24 11:40:21,551 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 11:40:21,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:40:21,554 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:21,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:40:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 11:40:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 11:40:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:40:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-10-24 11:40:21,570 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 144 [2024-10-24 11:40:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:21,574 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-10-24 11:40:21,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-10-24 11:40:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 11:40:21,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:21,576 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:21,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:40:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:21,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:21,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1436285403, now seen corresponding path program 1 times [2024-10-24 11:40:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750986687] [2024-10-24 11:40:21,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:21,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:21,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:21,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:40:21,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:40:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:22,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:40:22,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:22,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:40:23,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 11:40:23,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-10-24 11:40:23,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-10-24 11:40:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:40:23,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:23,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:23,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750986687] [2024-10-24 11:40:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750986687] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:23,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:40:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 26 [2024-10-24 11:40:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114930229] [2024-10-24 11:40:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:23,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:40:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:40:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-10-24 11:40:23,933 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:24,231 INFO L93 Difference]: Finished difference Result 275 states and 411 transitions. [2024-10-24 11:40:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:40:24,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-10-24 11:40:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:24,235 INFO L225 Difference]: With dead ends: 275 [2024-10-24 11:40:24,235 INFO L226 Difference]: Without dead ends: 166 [2024-10-24 11:40:24,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:40:24,236 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 78 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:24,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1003 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:40:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-24 11:40:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2024-10-24 11:40:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 110 states have internal predecessors, (159), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:40:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-10-24 11:40:24,251 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 144 [2024-10-24 11:40:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:24,251 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-10-24 11:40:24,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-10-24 11:40:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:40:24,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:24,253 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:24,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:40:24,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:24,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:24,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash 433622181, now seen corresponding path program 1 times [2024-10-24 11:40:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781508742] [2024-10-24 11:40:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:24,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:24,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:24,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:40:24,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:40:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:24,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 11:40:24,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:24,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:40:25,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2024-10-24 11:40:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:40:25,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:40:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:25,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:25,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781508742] [2024-10-24 11:40:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781508742] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:40:25,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:40:25,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-24 11:40:25,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945960835] [2024-10-24 11:40:25,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:25,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:40:25,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:25,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:40:25,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:40:25,764 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:25,854 INFO L93 Difference]: Finished difference Result 309 states and 466 transitions. [2024-10-24 11:40:25,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:40:25,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2024-10-24 11:40:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:25,856 INFO L225 Difference]: With dead ends: 309 [2024-10-24 11:40:25,857 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 11:40:25,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:40:25,858 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 68 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:25,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 631 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:40:25,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 11:40:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 146. [2024-10-24 11:40:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 125 states have (on average 1.456) internal successors, (182), 125 states have internal predecessors, (182), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 11:40:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2024-10-24 11:40:25,867 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 145 [2024-10-24 11:40:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:25,867 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2024-10-24 11:40:25,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-10-24 11:40:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 11:40:25,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:25,869 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:25,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:40:26,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:26,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:26,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:26,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2144716241, now seen corresponding path program 1 times [2024-10-24 11:40:26,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:26,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088508093] [2024-10-24 11:40:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:26,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:26,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:26,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:40:26,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:40:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:26,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:40:26,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:26,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:40:26,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-24 11:40:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 11:40:26,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:40:26,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:40:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088508093] [2024-10-24 11:40:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088508093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:40:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:40:26,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:40:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019303883] [2024-10-24 11:40:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:40:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:40:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:40:26,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:40:26,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:40:26,571 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:40:27,908 INFO L93 Difference]: Finished difference Result 573 states and 863 transitions. [2024-10-24 11:40:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:40:27,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2024-10-24 11:40:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:40:27,911 INFO L225 Difference]: With dead ends: 573 [2024-10-24 11:40:27,911 INFO L226 Difference]: Without dead ends: 428 [2024-10-24 11:40:27,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:40:27,912 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 413 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:40:27,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 956 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:40:27,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-24 11:40:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 302. [2024-10-24 11:40:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 261 states have (on average 1.4636015325670497) internal successors, (382), 261 states have internal predecessors, (382), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 11:40:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 458 transitions. [2024-10-24 11:40:27,941 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 458 transitions. Word has length 145 [2024-10-24 11:40:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:40:27,941 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 458 transitions. [2024-10-24 11:40:27,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 11:40:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 458 transitions. [2024-10-24 11:40:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 11:40:27,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:40:27,943 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:40:27,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:40:28,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:28,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:40:28,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:40:28,144 INFO L85 PathProgramCache]: Analyzing trace with hash 679322017, now seen corresponding path program 1 times [2024-10-24 11:40:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:40:28,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464827901] [2024-10-24 11:40:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:40:28,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:40:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:40:28,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:40:28,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:40:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:40:28,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-24 11:40:28,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:40:28,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9