./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.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 f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:14:21,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:14:21,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:14:21,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:14:21,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:14:21,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:14:21,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:14:21,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:14:21,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:14:21,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:14:21,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:14:21,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:14:21,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:14:21,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:14:21,982 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:14:21,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:14:21,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:14:21,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:14:21,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:14:21,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:14:21,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:14:21,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:14:21,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:14:21,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:14:21,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:14:21,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:14:21,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:14:21,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:14:21,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:14:21,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:14:21,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:14:21,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:14:21,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:14:21,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:14:21,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:14:21,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:14:21,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:14:21,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:14:21,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:14:21,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:14:21,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:14:21,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:14:21,996 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 -> f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 [2024-11-12 07:14:22,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:14:22,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:14:22,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:14:22,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:14:22,290 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:14:22,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-11-12 07:14:23,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:14:24,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:14:24,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-11-12 07:14:24,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bdff9bd/20c9019cbfa54431958afc7befd94e0f/FLAGf0d2655b5 [2024-11-12 07:14:24,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98bdff9bd/20c9019cbfa54431958afc7befd94e0f [2024-11-12 07:14:24,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:14:24,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:14:24,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:14:24,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:14:24,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:14:24,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ab34f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24, skipping insertion in model container [2024-11-12 07:14:24,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:14:24,672 WARN L250 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-a_file-84.i[916,929] [2024-11-12 07:14:24,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:14:24,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:14:24,781 WARN L250 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-a_file-84.i[916,929] [2024-11-12 07:14:24,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:14:24,852 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:14:24,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24 WrapperNode [2024-11-12 07:14:24,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:14:24,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:14:24,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:14:24,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:14:24,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,930 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2024-11-12 07:14:24,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:14:24,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:14:24,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:14:24,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:14:24,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,988 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2024-11-12 07:14:24,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:24,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:25,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:25,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:25,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:25,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:25,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:14:25,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:14:25,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:14:25,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:14:25,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (1/1) ... [2024-11-12 07:14:25,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:14:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:14:25,103 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-11-12 07:14:25,110 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-11-12 07:14:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:14:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:14:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:14:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-12 07:14:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-12 07:14:25,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-12 07:14:25,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-12 07:14:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:14:25,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:14:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 07:14:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 07:14:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 07:14:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 07:14:25,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:14:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:14:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-12 07:14:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-12 07:14:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-12 07:14:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-12 07:14:25,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:14:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:14:25,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 07:14:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 07:14:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 07:14:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:14:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:14:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:14:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:14:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 07:14:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 07:14:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 07:14:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 07:14:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:14:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:14:25,322 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:14:25,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:14:25,857 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-12 07:14:25,857 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:14:25,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:14:25,872 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:14:25,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:25 BoogieIcfgContainer [2024-11-12 07:14:25,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:14:25,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:14:25,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:14:25,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:14:25,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:14:24" (1/3) ... [2024-11-12 07:14:25,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b9b7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:14:25, skipping insertion in model container [2024-11-12 07:14:25,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:14:24" (2/3) ... [2024-11-12 07:14:25,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b9b7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:14:25, skipping insertion in model container [2024-11-12 07:14:25,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:25" (3/3) ... [2024-11-12 07:14:25,882 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2024-11-12 07:14:25,900 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:14:25,901 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:14:25,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:14:25,966 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;@2df93804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:14:25,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:14:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:14:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:14:25,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:25,987 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:14:25,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1023549121, now seen corresponding path program 1 times [2024-11-12 07:14:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824728148] [2024-11-12 07:14:26,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:26,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:26,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824728148] [2024-11-12 07:14:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824728148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:26,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:14:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701837701] [2024-11-12 07:14:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:26,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:14:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:26,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:14:26,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:14:26,656 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:26,686 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-12 07:14:26,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:14:26,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-12 07:14:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:26,697 INFO L225 Difference]: With dead ends: 199 [2024-11-12 07:14:26,698 INFO L226 Difference]: Without dead ends: 99 [2024-11-12 07:14:26,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:14:26,708 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:26,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:14:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-12 07:14:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-12 07:14:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:14:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-12 07:14:26,762 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-12 07:14:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:26,763 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-12 07:14:26,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-12 07:14:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:14:26,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:26,768 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:14:26,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:14:26,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:26,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1345191521, now seen corresponding path program 1 times [2024-11-12 07:14:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:26,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976955580] [2024-11-12 07:14:26,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:27,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976955580] [2024-11-12 07:14:27,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976955580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:27,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:27,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:14:27,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921274629] [2024-11-12 07:14:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:27,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:14:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:14:27,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:14:27,159 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:27,223 INFO L93 Difference]: Finished difference Result 197 states and 282 transitions. [2024-11-12 07:14:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:14:27,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-12 07:14:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:27,226 INFO L225 Difference]: With dead ends: 197 [2024-11-12 07:14:27,227 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:14:27,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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-11-12 07:14:27,229 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:27,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:14:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:14:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-12 07:14:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:14:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-12 07:14:27,251 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2024-11-12 07:14:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:27,253 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-12 07:14:27,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-12 07:14:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:14:27,262 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:27,262 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:14:27,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:14:27,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:27,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1708658019, now seen corresponding path program 1 times [2024-11-12 07:14:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577663563] [2024-11-12 07:14:27,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577663563] [2024-11-12 07:14:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577663563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:14:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194571935] [2024-11-12 07:14:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:27,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:14:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:14:27,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:14:27,629 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:14:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:27,681 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-12 07:14:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:14:27,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-12 07:14:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:27,688 INFO L225 Difference]: With dead ends: 202 [2024-11-12 07:14:27,688 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 07:14:27,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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-11-12 07:14:27,694 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:27,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:14:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 07:14:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-12 07:14:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:14:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-12 07:14:27,718 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 150 [2024-11-12 07:14:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:27,719 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-12 07:14:27,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:14:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-12 07:14:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:14:27,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:27,726 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:14:27,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:14:27,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:27,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1706810977, now seen corresponding path program 1 times [2024-11-12 07:14:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:27,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817678554] [2024-11-12 07:14:27,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:28,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817678554] [2024-11-12 07:14:28,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817678554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:28,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:28,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:14:28,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914641684] [2024-11-12 07:14:28,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:28,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:14:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:28,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:14:28,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:14:28,246 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:28,532 INFO L93 Difference]: Finished difference Result 330 states and 465 transitions. [2024-11-12 07:14:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:14:28,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-12 07:14:28,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:28,536 INFO L225 Difference]: With dead ends: 330 [2024-11-12 07:14:28,536 INFO L226 Difference]: Without dead ends: 230 [2024-11-12 07:14:28,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:14:28,537 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 293 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:28,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 535 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:14:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-12 07:14:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2024-11-12 07:14:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.2875) internal successors, (206), 160 states have internal predecessors, (206), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 07:14:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 286 transitions. [2024-11-12 07:14:28,578 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 286 transitions. Word has length 150 [2024-11-12 07:14:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:28,578 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 286 transitions. [2024-11-12 07:14:28,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:28,579 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 286 transitions. [2024-11-12 07:14:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:14:28,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:28,585 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:28,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:14:28,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:28,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1924195517, now seen corresponding path program 1 times [2024-11-12 07:14:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:28,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202919197] [2024-11-12 07:14:28,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:32,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:32,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202919197] [2024-11-12 07:14:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202919197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:32,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 07:14:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776091441] [2024-11-12 07:14:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:14:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:32,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:14:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:14:32,186 INFO L87 Difference]: Start difference. First operand 203 states and 286 transitions. Second operand has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:35,174 INFO L93 Difference]: Finished difference Result 783 states and 1089 transitions. [2024-11-12 07:14:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 07:14:35,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2024-11-12 07:14:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:35,182 INFO L225 Difference]: With dead ends: 783 [2024-11-12 07:14:35,183 INFO L226 Difference]: Without dead ends: 583 [2024-11-12 07:14:35,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:14:35,185 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 255 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:35,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 2458 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 07:14:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-12 07:14:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 353. [2024-11-12 07:14:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 294 states have (on average 1.3129251700680271) internal successors, (386), 296 states have internal predecessors, (386), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:14:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 494 transitions. [2024-11-12 07:14:35,250 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 494 transitions. Word has length 158 [2024-11-12 07:14:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:35,252 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 494 transitions. [2024-11-12 07:14:35,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 494 transitions. [2024-11-12 07:14:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 07:14:35,255 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:35,255 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:35,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:14:35,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:35,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1948069953, now seen corresponding path program 1 times [2024-11-12 07:14:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052430534] [2024-11-12 07:14:35,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:35,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052430534] [2024-11-12 07:14:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052430534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:14:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569738488] [2024-11-12 07:14:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:37,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:14:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:14:37,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:14:37,156 INFO L87 Difference]: Start difference. First operand 353 states and 494 transitions. Second operand has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:38,117 INFO L93 Difference]: Finished difference Result 713 states and 996 transitions. [2024-11-12 07:14:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:14:38,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2024-11-12 07:14:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:38,120 INFO L225 Difference]: With dead ends: 713 [2024-11-12 07:14:38,120 INFO L226 Difference]: Without dead ends: 363 [2024-11-12 07:14:38,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:14:38,126 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 93 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:38,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1699 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:14:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-12 07:14:38,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 339. [2024-11-12 07:14:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 280 states have (on average 1.3035714285714286) internal successors, (365), 282 states have internal predecessors, (365), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:14:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 473 transitions. [2024-11-12 07:14:38,172 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 473 transitions. Word has length 158 [2024-11-12 07:14:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:38,173 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 473 transitions. [2024-11-12 07:14:38,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.083333333333333) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 473 transitions. [2024-11-12 07:14:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:38,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:38,176 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:38,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:14:38,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:38,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2098989630, now seen corresponding path program 1 times [2024-11-12 07:14:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:38,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654053165] [2024-11-12 07:14:38,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:39,569 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:39,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654053165] [2024-11-12 07:14:39,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654053165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:39,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:39,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:14:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341856237] [2024-11-12 07:14:39,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:39,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:14:39,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:39,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:14:39,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:14:39,572 INFO L87 Difference]: Start difference. First operand 339 states and 473 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:40,369 INFO L93 Difference]: Finished difference Result 821 states and 1145 transitions. [2024-11-12 07:14:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:14:40,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-12 07:14:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:40,378 INFO L225 Difference]: With dead ends: 821 [2024-11-12 07:14:40,378 INFO L226 Difference]: Without dead ends: 485 [2024-11-12 07:14:40,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:14:40,382 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 85 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:40,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1038 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:14:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-12 07:14:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 379. [2024-11-12 07:14:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 320 states have (on average 1.31875) internal successors, (422), 322 states have internal predecessors, (422), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:14:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 530 transitions. [2024-11-12 07:14:40,437 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 530 transitions. Word has length 160 [2024-11-12 07:14:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:40,438 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 530 transitions. [2024-11-12 07:14:40,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 530 transitions. [2024-11-12 07:14:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:40,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:40,440 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:40,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:14:40,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:40,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1174909312, now seen corresponding path program 1 times [2024-11-12 07:14:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036112700] [2024-11-12 07:14:40,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036112700] [2024-11-12 07:14:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036112700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:14:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813777910] [2024-11-12 07:14:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:41,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:14:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:14:41,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:14:41,825 INFO L87 Difference]: Start difference. First operand 379 states and 530 transitions. Second operand has 11 states, 8 states have (on average 7.875) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:14:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:42,528 INFO L93 Difference]: Finished difference Result 861 states and 1200 transitions. [2024-11-12 07:14:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:14:42,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.875) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-12 07:14:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:42,533 INFO L225 Difference]: With dead ends: 861 [2024-11-12 07:14:42,533 INFO L226 Difference]: Without dead ends: 485 [2024-11-12 07:14:42,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:14:42,536 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 81 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:42,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1132 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:14:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-12 07:14:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 375. [2024-11-12 07:14:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 316 states have (on average 1.3164556962025316) internal successors, (416), 318 states have internal predecessors, (416), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:14:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 524 transitions. [2024-11-12 07:14:42,580 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 524 transitions. Word has length 160 [2024-11-12 07:14:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:42,581 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 524 transitions. [2024-11-12 07:14:42,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.875) internal successors, (63), 11 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:14:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 524 transitions. [2024-11-12 07:14:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:42,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:42,583 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:42,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:14:42,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:42,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1177324662, now seen corresponding path program 1 times [2024-11-12 07:14:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:42,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153288919] [2024-11-12 07:14:42,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153288919] [2024-11-12 07:14:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153288919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:42,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:42,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:14:42,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640591334] [2024-11-12 07:14:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:42,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:14:42,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:14:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:14:42,808 INFO L87 Difference]: Start difference. First operand 375 states and 524 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:14:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:42,867 INFO L93 Difference]: Finished difference Result 759 states and 1061 transitions. [2024-11-12 07:14:42,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:14:42,868 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-12 07:14:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:42,871 INFO L225 Difference]: With dead ends: 759 [2024-11-12 07:14:42,871 INFO L226 Difference]: Without dead ends: 387 [2024-11-12 07:14:42,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-11-12 07:14:42,874 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:42,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:14:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-12 07:14:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2024-11-12 07:14:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 328 states have (on average 1.3048780487804879) internal successors, (428), 330 states have internal predecessors, (428), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:14:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 536 transitions. [2024-11-12 07:14:42,943 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 536 transitions. Word has length 160 [2024-11-12 07:14:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 536 transitions. [2024-11-12 07:14:42,944 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:14:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 536 transitions. [2024-11-12 07:14:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:42,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:42,948 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:42,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:14:42,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash 919159224, now seen corresponding path program 1 times [2024-11-12 07:14:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926698062] [2024-11-12 07:14:42,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926698062] [2024-11-12 07:14:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926698062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:14:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903576154] [2024-11-12 07:14:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:44,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:14:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:14:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:14:44,583 INFO L87 Difference]: Start difference. First operand 387 states and 536 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:45,326 INFO L93 Difference]: Finished difference Result 1091 states and 1509 transitions. [2024-11-12 07:14:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:14:45,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-12 07:14:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:45,331 INFO L225 Difference]: With dead ends: 1091 [2024-11-12 07:14:45,331 INFO L226 Difference]: Without dead ends: 707 [2024-11-12 07:14:45,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:14:45,333 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:45,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1003 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:14:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-12 07:14:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 691. [2024-11-12 07:14:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 590 states have (on average 1.3101694915254238) internal successors, (773), 596 states have internal predecessors, (773), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-12 07:14:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 957 transitions. [2024-11-12 07:14:45,419 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 957 transitions. Word has length 160 [2024-11-12 07:14:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:45,420 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 957 transitions. [2024-11-12 07:14:45,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 957 transitions. [2024-11-12 07:14:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:45,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:45,423 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:45,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:14:45,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:45,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash -521589342, now seen corresponding path program 1 times [2024-11-12 07:14:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354747325] [2024-11-12 07:14:45,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:45,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354747325] [2024-11-12 07:14:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354747325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:14:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412660896] [2024-11-12 07:14:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:46,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:14:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:46,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:14:46,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:14:46,781 INFO L87 Difference]: Start difference. First operand 691 states and 957 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:47,696 INFO L93 Difference]: Finished difference Result 1669 states and 2304 transitions. [2024-11-12 07:14:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:14:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-12 07:14:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:47,703 INFO L225 Difference]: With dead ends: 1669 [2024-11-12 07:14:47,703 INFO L226 Difference]: Without dead ends: 981 [2024-11-12 07:14:47,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:14:47,706 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 80 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:47,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1184 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:14:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-11-12 07:14:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 741. [2024-11-12 07:14:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 640 states have (on average 1.3171875) internal successors, (843), 646 states have internal predecessors, (843), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-12 07:14:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1027 transitions. [2024-11-12 07:14:47,796 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1027 transitions. Word has length 160 [2024-11-12 07:14:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:47,796 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1027 transitions. [2024-11-12 07:14:47,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1027 transitions. [2024-11-12 07:14:47,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:47,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:47,801 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:47,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:14:47,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1779233248, now seen corresponding path program 1 times [2024-11-12 07:14:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853279844] [2024-11-12 07:14:47,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:48,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:48,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853279844] [2024-11-12 07:14:48,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853279844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:48,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:48,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:14:48,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451981737] [2024-11-12 07:14:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:48,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:14:48,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:48,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:14:48,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:14:48,230 INFO L87 Difference]: Start difference. First operand 741 states and 1027 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:14:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:48,709 INFO L93 Difference]: Finished difference Result 1987 states and 2738 transitions. [2024-11-12 07:14:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:14:48,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-12 07:14:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:48,719 INFO L225 Difference]: With dead ends: 1987 [2024-11-12 07:14:48,720 INFO L226 Difference]: Without dead ends: 1249 [2024-11-12 07:14:48,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:14:48,723 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 82 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:48,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 463 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:14:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-12 07:14:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 803. [2024-11-12 07:14:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 702 states have (on average 1.311965811965812) internal successors, (921), 708 states have internal predecessors, (921), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-12 07:14:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1105 transitions. [2024-11-12 07:14:48,823 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1105 transitions. Word has length 160 [2024-11-12 07:14:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:48,824 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1105 transitions. [2024-11-12 07:14:48,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:14:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1105 transitions. [2024-11-12 07:14:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:48,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:48,826 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:48,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:14:48,827 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 499369570, now seen corresponding path program 1 times [2024-11-12 07:14:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430696056] [2024-11-12 07:14:48,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:50,257 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:50,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:50,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430696056] [2024-11-12 07:14:50,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430696056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:50,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:50,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:14:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125687354] [2024-11-12 07:14:50,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:50,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:14:50,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:50,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:14:50,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:14:50,259 INFO L87 Difference]: Start difference. First operand 803 states and 1105 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:51,152 INFO L93 Difference]: Finished difference Result 1837 states and 2516 transitions. [2024-11-12 07:14:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:14:51,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-12 07:14:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:51,161 INFO L225 Difference]: With dead ends: 1837 [2024-11-12 07:14:51,161 INFO L226 Difference]: Without dead ends: 1037 [2024-11-12 07:14:51,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:14:51,165 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 75 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:51,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1197 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:14:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-12 07:14:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 807. [2024-11-12 07:14:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 706 states have (on average 1.3101983002832862) internal successors, (925), 712 states have internal predecessors, (925), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-12 07:14:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1109 transitions. [2024-11-12 07:14:51,259 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1109 transitions. Word has length 160 [2024-11-12 07:14:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:51,260 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1109 transitions. [2024-11-12 07:14:51,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1109 transitions. [2024-11-12 07:14:51,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:51,264 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:51,264 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:51,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:14:51,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:51,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:51,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1059707834, now seen corresponding path program 1 times [2024-11-12 07:14:51,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:51,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567606360] [2024-11-12 07:14:51,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:51,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567606360] [2024-11-12 07:14:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567606360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:51,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:51,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:14:51,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610265172] [2024-11-12 07:14:51,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:51,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:14:51,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:14:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:14:51,690 INFO L87 Difference]: Start difference. First operand 807 states and 1109 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:51,827 INFO L93 Difference]: Finished difference Result 1697 states and 2328 transitions. [2024-11-12 07:14:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:14:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-11-12 07:14:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:51,833 INFO L225 Difference]: With dead ends: 1697 [2024-11-12 07:14:51,833 INFO L226 Difference]: Without dead ends: 893 [2024-11-12 07:14:51,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-11-12 07:14:51,835 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 39 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:51,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 805 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:14:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-11-12 07:14:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 799. [2024-11-12 07:14:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 698 states have (on average 1.3022922636103151) internal successors, (909), 704 states have internal predecessors, (909), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-12 07:14:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1093 transitions. [2024-11-12 07:14:51,914 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1093 transitions. Word has length 160 [2024-11-12 07:14:51,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:51,914 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1093 transitions. [2024-11-12 07:14:51,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1093 transitions. [2024-11-12 07:14:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:51,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:51,916 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:51,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:14:51,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:51,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:51,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2076357376, now seen corresponding path program 1 times [2024-11-12 07:14:51,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332103009] [2024-11-12 07:14:51,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332103009] [2024-11-12 07:14:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332103009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:52,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:14:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394250157] [2024-11-12 07:14:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:52,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:14:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:52,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:14:52,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:14:52,424 INFO L87 Difference]: Start difference. First operand 799 states and 1093 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:52,895 INFO L93 Difference]: Finished difference Result 2030 states and 2764 transitions. [2024-11-12 07:14:52,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:14:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-11-12 07:14:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:52,902 INFO L225 Difference]: With dead ends: 2030 [2024-11-12 07:14:52,902 INFO L226 Difference]: Without dead ends: 1234 [2024-11-12 07:14:52,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:14:52,906 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 104 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:52,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 538 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:14:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-11-12 07:14:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 846. [2024-11-12 07:14:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 738 states have (on average 1.3008130081300813) internal successors, (960), 744 states have internal predecessors, (960), 97 states have call successors, (97), 10 states have call predecessors, (97), 10 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-12 07:14:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1154 transitions. [2024-11-12 07:14:53,009 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1154 transitions. Word has length 160 [2024-11-12 07:14:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:53,011 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1154 transitions. [2024-11-12 07:14:53,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:14:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1154 transitions. [2024-11-12 07:14:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:53,014 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:53,014 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:53,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:14:53,014 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:53,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash -153129342, now seen corresponding path program 1 times [2024-11-12 07:14:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:53,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746930549] [2024-11-12 07:14:53,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:54,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:54,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746930549] [2024-11-12 07:14:54,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746930549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:54,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:14:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42873389] [2024-11-12 07:14:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:54,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:14:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:14:54,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:14:54,360 INFO L87 Difference]: Start difference. First operand 846 states and 1154 transitions. Second operand has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:14:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:55,115 INFO L93 Difference]: Finished difference Result 2003 states and 2722 transitions. [2024-11-12 07:14:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:14:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-12 07:14:55,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:55,123 INFO L225 Difference]: With dead ends: 2003 [2024-11-12 07:14:55,123 INFO L226 Difference]: Without dead ends: 1160 [2024-11-12 07:14:55,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:14:55,126 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 83 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:55,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 904 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:14:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-12 07:14:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 718. [2024-11-12 07:14:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 631 states have (on average 1.3106180665610143) internal successors, (827), 635 states have internal predecessors, (827), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:14:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 983 transitions. [2024-11-12 07:14:55,203 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 983 transitions. Word has length 160 [2024-11-12 07:14:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:55,204 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 983 transitions. [2024-11-12 07:14:55,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:14:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 983 transitions. [2024-11-12 07:14:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:55,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:55,206 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:55,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:14:55,207 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:55,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:55,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1174197696, now seen corresponding path program 1 times [2024-11-12 07:14:55,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:55,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763541923] [2024-11-12 07:14:55,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:56,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:56,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763541923] [2024-11-12 07:14:56,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763541923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:56,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:56,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:14:56,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061516164] [2024-11-12 07:14:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:56,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:14:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:56,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:14:56,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:14:56,333 INFO L87 Difference]: Start difference. First operand 718 states and 983 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:57,012 INFO L93 Difference]: Finished difference Result 1563 states and 2134 transitions. [2024-11-12 07:14:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:14:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-12 07:14:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:57,017 INFO L225 Difference]: With dead ends: 1563 [2024-11-12 07:14:57,017 INFO L226 Difference]: Without dead ends: 848 [2024-11-12 07:14:57,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:14:57,020 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 80 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:57,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1060 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:14:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-12 07:14:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 692. [2024-11-12 07:14:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 605 states have (on average 1.3024793388429752) internal successors, (788), 609 states have internal predecessors, (788), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:14:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 944 transitions. [2024-11-12 07:14:57,116 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 944 transitions. Word has length 160 [2024-11-12 07:14:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:57,117 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 944 transitions. [2024-11-12 07:14:57,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 944 transitions. [2024-11-12 07:14:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:57,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:57,119 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:57,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:14:57,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:57,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash -498957088, now seen corresponding path program 1 times [2024-11-12 07:14:57,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:57,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726024822] [2024-11-12 07:14:57,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:58,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726024822] [2024-11-12 07:14:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726024822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:14:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245191168] [2024-11-12 07:14:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:58,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:14:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:14:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:14:58,176 INFO L87 Difference]: Start difference. First operand 692 states and 944 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:14:58,817 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2024-11-12 07:14:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:14:58,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-12 07:14:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:14:58,823 INFO L225 Difference]: With dead ends: 1515 [2024-11-12 07:14:58,823 INFO L226 Difference]: Without dead ends: 826 [2024-11-12 07:14:58,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:14:58,825 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 81 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:14:58,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1407 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:14:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-12 07:14:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 684. [2024-11-12 07:14:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 597 states have (on average 1.2998324958123952) internal successors, (776), 601 states have internal predecessors, (776), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:14:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 932 transitions. [2024-11-12 07:14:58,902 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 932 transitions. Word has length 160 [2024-11-12 07:14:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:14:58,903 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 932 transitions. [2024-11-12 07:14:58,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:14:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 932 transitions. [2024-11-12 07:14:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 07:14:58,905 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:14:58,905 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:14:58,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:14:58,906 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:14:58,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:14:58,906 INFO L85 PathProgramCache]: Analyzing trace with hash 522001824, now seen corresponding path program 1 times [2024-11-12 07:14:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:14:58,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096122628] [2024-11-12 07:14:58,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:14:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:14:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:14:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:14:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:14:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:14:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:14:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:14:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:14:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:14:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:14:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:14:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:14:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:14:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:14:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:14:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:14:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:14:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:14:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:14:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:14:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:14:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:14:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:14:59,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:14:59,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096122628] [2024-11-12 07:14:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096122628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:14:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:14:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:14:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583692652] [2024-11-12 07:14:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:14:59,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:14:59,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:14:59,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:14:59,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:14:59,925 INFO L87 Difference]: Start difference. First operand 684 states and 932 transitions. Second operand has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:00,742 INFO L93 Difference]: Finished difference Result 1489 states and 2019 transitions. [2024-11-12 07:15:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:15:00,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-12 07:15:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:00,748 INFO L225 Difference]: With dead ends: 1489 [2024-11-12 07:15:00,749 INFO L226 Difference]: Without dead ends: 808 [2024-11-12 07:15:00,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:15:00,752 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 75 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:00,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1549 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:15:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-12 07:15:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 658. [2024-11-12 07:15:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 571 states have (on average 1.2907180385288968) internal successors, (737), 575 states have internal predecessors, (737), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:15:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 893 transitions. [2024-11-12 07:15:00,862 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 893 transitions. Word has length 160 [2024-11-12 07:15:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:00,863 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 893 transitions. [2024-11-12 07:15:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.0) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 893 transitions. [2024-11-12 07:15:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:00,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:00,866 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:15:00,866 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:00,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1331949209, now seen corresponding path program 1 times [2024-11-12 07:15:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930903308] [2024-11-12 07:15:00,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930903308] [2024-11-12 07:15:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930903308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:03,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-12 07:15:03,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892294640] [2024-11-12 07:15:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 07:15:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:03,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 07:15:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2024-11-12 07:15:03,138 INFO L87 Difference]: Start difference. First operand 658 states and 893 transitions. Second operand has 24 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:06,438 INFO L93 Difference]: Finished difference Result 2189 states and 2936 transitions. [2024-11-12 07:15:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 07:15:06,439 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-12 07:15:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:06,447 INFO L225 Difference]: With dead ends: 2189 [2024-11-12 07:15:06,447 INFO L226 Difference]: Without dead ends: 1534 [2024-11-12 07:15:06,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=228, Invalid=1934, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 07:15:06,452 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 323 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:06,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 2622 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 07:15:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-12 07:15:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 718. [2024-11-12 07:15:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 631 states have (on average 1.301109350237718) internal successors, (821), 635 states have internal predecessors, (821), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:15:06,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 977 transitions. [2024-11-12 07:15:06,563 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 977 transitions. Word has length 162 [2024-11-12 07:15:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:06,564 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 977 transitions. [2024-11-12 07:15:06,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:06,564 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 977 transitions. [2024-11-12 07:15:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:06,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:06,565 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:06,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 07:15:06,566 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:06,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1683154409, now seen corresponding path program 1 times [2024-11-12 07:15:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:06,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355981823] [2024-11-12 07:15:06,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355981823] [2024-11-12 07:15:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355981823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:15:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102981235] [2024-11-12 07:15:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:08,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:15:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:08,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:15:08,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:15:08,046 INFO L87 Difference]: Start difference. First operand 718 states and 977 transitions. Second operand has 14 states, 11 states have (on average 5.909090909090909) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:08,839 INFO L93 Difference]: Finished difference Result 1697 states and 2295 transitions. [2024-11-12 07:15:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:15:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.909090909090909) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-12 07:15:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:08,845 INFO L225 Difference]: With dead ends: 1697 [2024-11-12 07:15:08,845 INFO L226 Difference]: Without dead ends: 982 [2024-11-12 07:15:08,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:15:08,848 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 83 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:08,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1155 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:15:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-12 07:15:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 742. [2024-11-12 07:15:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 655 states have (on average 1.2946564885496183) internal successors, (848), 659 states have internal predecessors, (848), 78 states have call successors, (78), 8 states have call predecessors, (78), 8 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 07:15:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1004 transitions. [2024-11-12 07:15:08,937 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1004 transitions. Word has length 162 [2024-11-12 07:15:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:08,937 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1004 transitions. [2024-11-12 07:15:08,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.909090909090909) internal successors, (65), 14 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1004 transitions. [2024-11-12 07:15:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:08,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:08,939 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:08,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:15:08,939 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:08,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash -310990297, now seen corresponding path program 1 times [2024-11-12 07:15:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:08,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803582444] [2024-11-12 07:15:08,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:08,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803582444] [2024-11-12 07:15:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803582444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:09,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:09,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 07:15:09,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535399522] [2024-11-12 07:15:09,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:09,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 07:15:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:09,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 07:15:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:15:09,898 INFO L87 Difference]: Start difference. First operand 742 states and 1004 transitions. Second operand has 11 states, 8 states have (on average 8.125) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:10,602 INFO L93 Difference]: Finished difference Result 1753 states and 2360 transitions. [2024-11-12 07:15:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:15:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 8.125) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-12 07:15:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:10,608 INFO L225 Difference]: With dead ends: 1753 [2024-11-12 07:15:10,608 INFO L226 Difference]: Without dead ends: 1014 [2024-11-12 07:15:10,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:15:10,611 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 89 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:10,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1222 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:15:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-12 07:15:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 811. [2024-11-12 07:15:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 710 states have (on average 1.276056338028169) internal successors, (906), 715 states have internal predecessors, (906), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-12 07:15:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1086 transitions. [2024-11-12 07:15:10,717 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1086 transitions. Word has length 162 [2024-11-12 07:15:10,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:10,717 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1086 transitions. [2024-11-12 07:15:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 8.125) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1086 transitions. [2024-11-12 07:15:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:10,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:10,719 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:10,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 07:15:10,719 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:10,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash 54254185, now seen corresponding path program 1 times [2024-11-12 07:15:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:10,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437344808] [2024-11-12 07:15:10,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:10,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437344808] [2024-11-12 07:15:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437344808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:15:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049109537] [2024-11-12 07:15:11,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:11,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:15:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:11,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:15:11,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:15:11,041 INFO L87 Difference]: Start difference. First operand 811 states and 1086 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:15:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:11,524 INFO L93 Difference]: Finished difference Result 1745 states and 2332 transitions. [2024-11-12 07:15:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:15:11,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2024-11-12 07:15:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:11,529 INFO L225 Difference]: With dead ends: 1745 [2024-11-12 07:15:11,529 INFO L226 Difference]: Without dead ends: 937 [2024-11-12 07:15:11,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:15:11,532 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 101 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:11,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 626 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:15:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-12 07:15:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 651. [2024-11-12 07:15:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 571 states have (on average 1.2889667250437828) internal successors, (736), 574 states have internal predecessors, (736), 71 states have call successors, (71), 8 states have call predecessors, (71), 8 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-12 07:15:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 878 transitions. [2024-11-12 07:15:11,635 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 878 transitions. Word has length 162 [2024-11-12 07:15:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:11,635 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 878 transitions. [2024-11-12 07:15:11,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:15:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 878 transitions. [2024-11-12 07:15:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:11,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:11,638 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:11,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 07:15:11,638 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:11,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash -198710584, now seen corresponding path program 1 times [2024-11-12 07:15:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:11,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220355656] [2024-11-12 07:15:11,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220355656] [2024-11-12 07:15:11,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220355656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:11,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:11,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:15:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852325093] [2024-11-12 07:15:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:11,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:15:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:15:11,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:15:11,786 INFO L87 Difference]: Start difference. First operand 651 states and 878 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:15:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:11,888 INFO L93 Difference]: Finished difference Result 1314 states and 1773 transitions. [2024-11-12 07:15:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:15:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-12 07:15:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:11,892 INFO L225 Difference]: With dead ends: 1314 [2024-11-12 07:15:11,893 INFO L226 Difference]: Without dead ends: 666 [2024-11-12 07:15:11,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-11-12 07:15:11,895 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:11,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:15:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-12 07:15:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2024-11-12 07:15:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 586 states have (on average 1.2815699658703072) internal successors, (751), 589 states have internal predecessors, (751), 71 states have call successors, (71), 8 states have call predecessors, (71), 8 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-12 07:15:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 893 transitions. [2024-11-12 07:15:11,975 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 893 transitions. Word has length 162 [2024-11-12 07:15:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:11,975 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 893 transitions. [2024-11-12 07:15:11,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 07:15:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 893 transitions. [2024-11-12 07:15:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:11,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:11,977 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:11,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 07:15:11,978 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:11,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash 329013799, now seen corresponding path program 1 times [2024-11-12 07:15:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:11,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344301197] [2024-11-12 07:15:11,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:11,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344301197] [2024-11-12 07:15:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344301197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:15:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772441231] [2024-11-12 07:15:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:13,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:15:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:15:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:15:13,170 INFO L87 Difference]: Start difference. First operand 666 states and 893 transitions. Second operand has 13 states, 10 states have (on average 6.5) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:14,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:14,107 INFO L93 Difference]: Finished difference Result 1435 states and 1919 transitions. [2024-11-12 07:15:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 07:15:14,108 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.5) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-12 07:15:14,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:14,112 INFO L225 Difference]: With dead ends: 1435 [2024-11-12 07:15:14,113 INFO L226 Difference]: Without dead ends: 764 [2024-11-12 07:15:14,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:15:14,115 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 80 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:14,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1229 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:15:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-12 07:15:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 654. [2024-11-12 07:15:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 574 states have (on average 1.2735191637630663) internal successors, (731), 577 states have internal predecessors, (731), 71 states have call successors, (71), 8 states have call predecessors, (71), 8 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-12 07:15:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 873 transitions. [2024-11-12 07:15:14,212 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 873 transitions. Word has length 162 [2024-11-12 07:15:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 873 transitions. [2024-11-12 07:15:14,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.5) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 07:15:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 873 transitions. [2024-11-12 07:15:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:14,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:14,218 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 07:15:14,219 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:14,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1349972711, now seen corresponding path program 1 times [2024-11-12 07:15:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251806564] [2024-11-12 07:15:14,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:15,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:15,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251806564] [2024-11-12 07:15:15,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251806564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:15,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:15,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-12 07:15:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105629467] [2024-11-12 07:15:15,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:15,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 07:15:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:15,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 07:15:15,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:15:15,117 INFO L87 Difference]: Start difference. First operand 654 states and 873 transitions. Second operand has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:15:16,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:16,848 INFO L93 Difference]: Finished difference Result 1813 states and 2396 transitions. [2024-11-12 07:15:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 07:15:16,848 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2024-11-12 07:15:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:16,853 INFO L225 Difference]: With dead ends: 1813 [2024-11-12 07:15:16,853 INFO L226 Difference]: Without dead ends: 1162 [2024-11-12 07:15:16,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-11-12 07:15:16,855 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 276 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:16,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2907 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 07:15:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-12 07:15:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 686. [2024-11-12 07:15:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 606 states have (on average 1.268976897689769) internal successors, (769), 609 states have internal predecessors, (769), 71 states have call successors, (71), 8 states have call predecessors, (71), 8 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-12 07:15:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 911 transitions. [2024-11-12 07:15:16,942 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 911 transitions. Word has length 162 [2024-11-12 07:15:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:16,942 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 911 transitions. [2024-11-12 07:15:16,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 17 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:15:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 911 transitions. [2024-11-12 07:15:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 07:15:16,944 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:16,944 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 07:15:16,944 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:16,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -455465623, now seen corresponding path program 1 times [2024-11-12 07:15:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:16,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013332397] [2024-11-12 07:15:16,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013332397] [2024-11-12 07:15:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013332397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:17,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:17,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:15:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169058047] [2024-11-12 07:15:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:17,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:15:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:15:17,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:15:17,710 INFO L87 Difference]: Start difference. First operand 686 states and 911 transitions. Second operand has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:15:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:18,517 INFO L93 Difference]: Finished difference Result 1525 states and 2018 transitions. [2024-11-12 07:15:18,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 07:15:18,518 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2024-11-12 07:15:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:18,522 INFO L225 Difference]: With dead ends: 1525 [2024-11-12 07:15:18,522 INFO L226 Difference]: Without dead ends: 842 [2024-11-12 07:15:18,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-12 07:15:18,524 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 97 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:18,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1878 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:15:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-12 07:15:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 640. [2024-11-12 07:15:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 560 states have (on average 1.275) internal successors, (714), 563 states have internal predecessors, (714), 71 states have call successors, (71), 8 states have call predecessors, (71), 8 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-12 07:15:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 856 transitions. [2024-11-12 07:15:18,615 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 856 transitions. Word has length 162 [2024-11-12 07:15:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:18,615 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 856 transitions. [2024-11-12 07:15:18,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-12 07:15:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 856 transitions. [2024-11-12 07:15:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 07:15:18,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:18,617 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:18,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 07:15:18,617 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 738607137, now seen corresponding path program 1 times [2024-11-12 07:15:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435349765] [2024-11-12 07:15:18,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:15:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:15:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:15:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:15:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:15:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:15:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:15:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 07:15:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:15:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 07:15:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:15:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:15:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 07:15:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:15:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:15:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:15:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 07:15:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 07:15:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 07:15:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 07:15:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:15:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 07:15:18,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:15:18,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435349765] [2024-11-12 07:15:18,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435349765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:15:18,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:15:18,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:15:18,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648374633] [2024-11-12 07:15:18,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:15:18,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:15:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:15:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:15:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:15:18,867 INFO L87 Difference]: Start difference. First operand 640 states and 856 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:15:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:15:18,972 INFO L93 Difference]: Finished difference Result 1381 states and 1839 transitions. [2024-11-12 07:15:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:15:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2024-11-12 07:15:18,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:15:18,976 INFO L225 Difference]: With dead ends: 1381 [2024-11-12 07:15:18,976 INFO L226 Difference]: Without dead ends: 744 [2024-11-12 07:15:18,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:15:18,978 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:15:18,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 655 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:15:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-11-12 07:15:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 640. [2024-11-12 07:15:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 560 states have (on average 1.2678571428571428) internal successors, (710), 563 states have internal predecessors, (710), 71 states have call successors, (71), 8 states have call predecessors, (71), 8 states have return successors, (71), 68 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-12 07:15:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 852 transitions. [2024-11-12 07:15:19,052 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 852 transitions. Word has length 164 [2024-11-12 07:15:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:15:19,053 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 852 transitions. [2024-11-12 07:15:19,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 07:15:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 852 transitions. [2024-11-12 07:15:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 07:15:19,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:19,054 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:15:19,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 07:15:19,054 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:15:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:15:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1759675491, now seen corresponding path program 1 times [2024-11-12 07:15:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:15:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479455709] [2024-11-12 07:15:19,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:15:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:15:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:15:19,147 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:15:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:15:19,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:15:19,311 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:15:19,311 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:15:19,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-12 07:15:19,316 INFO L421 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] [2024-11-12 07:15:19,435 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:15:19,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:15:19 BoogieIcfgContainer [2024-11-12 07:15:19,440 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:15:19,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:15:19,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:15:19,441 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:15:19,442 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:14:25" (3/4) ... [2024-11-12 07:15:19,444 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:15:19,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:15:19,445 INFO L158 Benchmark]: Toolchain (without parser) took 55025.48ms. Allocated memory was 123.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 53.6MB in the beginning and 914.7MB in the end (delta: -861.1MB). Peak memory consumption was 247.2MB. Max. memory is 16.1GB. [2024-11-12 07:15:19,446 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:15:19,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.21ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 53.3MB in the beginning and 114.2MB in the end (delta: -60.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-12 07:15:19,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.60ms. Allocated memory is still 148.9MB. Free memory was 114.2MB in the beginning and 109.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 07:15:19,446 INFO L158 Benchmark]: Boogie Preprocessor took 121.28ms. Allocated memory is still 148.9MB. Free memory was 109.0MB in the beginning and 103.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:15:19,448 INFO L158 Benchmark]: RCFGBuilder took 818.79ms. Allocated memory is still 148.9MB. Free memory was 102.8MB in the beginning and 66.1MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-12 07:15:19,448 INFO L158 Benchmark]: TraceAbstraction took 53565.46ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 66.1MB in the beginning and 915.8MB in the end (delta: -849.6MB). Peak memory consumption was 230.3MB. Max. memory is 16.1GB. [2024-11-12 07:15:19,448 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 1.2GB. Free memory was 915.8MB in the beginning and 914.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:15:19,449 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 123.7MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.21ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 53.3MB in the beginning and 114.2MB in the end (delta: -60.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.60ms. Allocated memory is still 148.9MB. Free memory was 114.2MB in the beginning and 109.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.28ms. Allocated memory is still 148.9MB. Free memory was 109.0MB in the beginning and 103.7MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 818.79ms. Allocated memory is still 148.9MB. Free memory was 102.8MB in the beginning and 66.1MB in the end (delta: 36.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 53565.46ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 66.1MB in the beginning and 915.8MB in the end (delta: -849.6MB). Peak memory consumption was 230.3MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 1.2GB. Free memory was 915.8MB in the beginning and 914.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -4; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 64; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] EXPR signed_short_int_Array_0[0] [L96] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L97] EXPR unsigned_short_int_Array_0[0] [L97] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[1] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L68] EXPR float_Array_0[1] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L70] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_char_Array_0[5] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, stepLocal_0=-4, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != last_1_unsigned_short_int_Array_0_0_ [L44] EXPR unsigned_char_Array_0[5] [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[1] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] unsigned_char_Array_0[6] = (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))) [L48] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE BOOL_unsigned_char_Array_0[0] [L49] EXPR unsigned_short_int_Array_0[1] [L49] EXPR unsigned_char_Array_0[3] [L49] unsigned_short_int_Array_0[0] = ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])) [L51] EXPR unsigned_char_Array_0[4] [L51] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND TRUE ! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1]) [L52] signed_short_int_Array_0[1] = (32 - 8) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR float_Array_0[1] [L56] float_Array_0[0] = float_Array_0[1] [L57] EXPR unsigned_char_Array_0[6] [L57] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR unsigned_char_Array_0[5] [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L100] EXPR unsigned_char_Array_0[1] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR unsigned_short_int_Array_0[1] [L100] EXPR unsigned_char_Array_0[3] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L100] EXPR float_Array_0[0] [L100] EXPR float_Array_0[1] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100-L101] return (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.4s, OverallIterations: 29, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2727 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2682 mSDsluCounter, 31288 SdHoareTripleChecker+Invalid, 13.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26750 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17621 IncrementalHoareTripleChecker+Invalid, 17870 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 4538 mSDtfsCounter, 17621 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1696 GetRequests, 1365 SyntacticMatches, 5 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=846occurred in iteration=15, InterpolantAutomatonStates: 295, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 5239 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 4620 NumberOfCodeBlocks, 4620 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4428 ConstructedInterpolants, 0 QuantifiedInterpolants, 16581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 21280/21280 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-11-12 07:15:19,632 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.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 f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:15:21,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:15:21,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:15:21,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:15:21,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:15:21,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:15:21,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:15:21,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:15:21,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:15:21,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:15:21,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:15:21,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:15:21,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:15:21,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:15:21,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:15:21,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:15:21,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:15:21,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:15:21,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:15:21,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:15:21,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:15:21,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:15:21,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:15:21,921 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:15:21,921 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:15:21,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:15:21,922 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:15:21,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:15:21,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:15:21,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:15:21,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:15:21,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:15:21,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:15:21,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:15:21,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:15:21,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:15:21,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:15:21,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:15:21,926 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:15:21,926 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:15:21,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:15:21,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:15:21,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:15:21,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:15:21,927 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 -> f0a95c837253461e666811310d33281cfc4592599bb0e38960c7585c8a470237 [2024-11-12 07:15:22,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:15:22,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:15:22,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:15:22,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:15:22,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:15:22,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-11-12 07:15:23,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:15:24,208 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:15:24,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2024-11-12 07:15:24,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ed355b9/4726edfd04864498865258085df2e3fc/FLAG0de3de0b9 [2024-11-12 07:15:24,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ed355b9/4726edfd04864498865258085df2e3fc [2024-11-12 07:15:24,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:15:24,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:15:24,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:15:24,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:15:24,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:15:24,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c05b0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24, skipping insertion in model container [2024-11-12 07:15:24,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:15:24,478 WARN L250 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-a_file-84.i[916,929] [2024-11-12 07:15:24,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:15:24,580 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:15:24,595 WARN L250 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-a_file-84.i[916,929] [2024-11-12 07:15:24,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:15:24,666 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:15:24,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24 WrapperNode [2024-11-12 07:15:24,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:15:24,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:15:24,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:15:24,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:15:24,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,766 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2024-11-12 07:15:24,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:15:24,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:15:24,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:15:24,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:15:24,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,830 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2024-11-12 07:15:24,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:15:24,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:15:24,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:15:24,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:15:24,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (1/1) ... [2024-11-12 07:15:24,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:15:24,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:15:24,958 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-11-12 07:15:24,966 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-11-12 07:15:25,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:15:25,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:15:25,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:15:25,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 07:15:25,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-12 07:15:25,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-12 07:15:25,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-12 07:15:25,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:15:25,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-12 07:15:25,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:15:25,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:15:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-12 07:15:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-12 07:15:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-12 07:15:25,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-12 07:15:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-12 07:15:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-12 07:15:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-12 07:15:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-12 07:15:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-12 07:15:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-12 07:15:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:15:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:15:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:15:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:15:25,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:15:25,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:15:25,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-12 07:15:25,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-12 07:15:25,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-12 07:15:25,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-12 07:15:25,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:15:25,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:15:25,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-12 07:15:25,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-12 07:15:25,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-12 07:15:25,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-12 07:15:25,223 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:15:25,227 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:15:25,916 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-12 07:15:25,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:15:25,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:15:25,944 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:15:25,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:25 BoogieIcfgContainer [2024-11-12 07:15:25,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:15:25,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:15:25,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:15:25,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:15:25,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:15:24" (1/3) ... [2024-11-12 07:15:25,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1947137d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:25, skipping insertion in model container [2024-11-12 07:15:25,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:15:24" (2/3) ... [2024-11-12 07:15:25,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1947137d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:15:25, skipping insertion in model container [2024-11-12 07:15:25,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:15:25" (3/3) ... [2024-11-12 07:15:25,954 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2024-11-12 07:15:25,971 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:15:25,971 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:15:26,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:15:26,057 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;@5bce786c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:15:26,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:15:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 07:15:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:15:26,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:15:26,076 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:15:26,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===